java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 08:50:49,846 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:50:49,848 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:50:49,866 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:50:49,866 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:50:49,867 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:50:49,868 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:50:49,870 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:50:49,871 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:50:49,872 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:50:49,873 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:50:49,874 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:50:49,876 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:50:49,879 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:50:49,882 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:50:49,885 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:50:49,886 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:50:49,893 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:50:49,895 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:50:49,898 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:50:49,900 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:50:49,903 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:50:49,908 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:50:49,908 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:50:49,908 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:50:49,910 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:50:49,911 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:50:49,912 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:50:49,913 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:50:49,916 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:50:49,916 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:50:49,917 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:50:49,917 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:50:49,917 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:50:49,918 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:50:49,920 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:50:49,921 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 08:50:49,946 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:50:49,946 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:50:49,947 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:50:49,951 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:50:49,951 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:50:49,951 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:50:49,951 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:50:49,951 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:50:50,004 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:50:50,017 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:50:50,021 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:50:50,022 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:50:50,023 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:50:50,024 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl [2018-07-25 08:50:50,024 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl' [2018-07-25 08:50:50,069 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:50:50,071 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:50:50,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:50:50,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:50:50,072 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:50:50,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:50" (1/1) ... [2018-07-25 08:50:50,108 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:50" (1/1) ... [2018-07-25 08:50:50,113 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 08:50:50,113 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 08:50:50,114 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 08:50:50,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:50:50,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:50:50,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:50:50,117 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:50:50,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:50" (1/1) ... [2018-07-25 08:50:50,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:50" (1/1) ... [2018-07-25 08:50:50,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:50" (1/1) ... [2018-07-25 08:50:50,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:50" (1/1) ... [2018-07-25 08:50:50,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:50" (1/1) ... [2018-07-25 08:50:50,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:50" (1/1) ... [2018-07-25 08:50:50,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:50" (1/1) ... [2018-07-25 08:50:50,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:50:50,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:50:50,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:50:50,137 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:50:50,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:50" (1/1) ... [2018-07-25 08:50:50,224 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-07-25 08:50:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-25 08:50:50,225 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-25 08:50:50,349 INFO L270 CfgBuilder]: Using library mode [2018-07-25 08:50:50,350 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:50:50 BoogieIcfgContainer [2018-07-25 08:50:50,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:50:50,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:50:50,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:50:50,355 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:50:50,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:50" (1/2) ... [2018-07-25 08:50:50,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380b82aa and model type DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:50:50, skipping insertion in model container [2018-07-25 08:50:50,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:50:50" (2/2) ... [2018-07-25 08:50:50,360 INFO L112 eAbstractionObserver]: Analyzing ICFG DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl [2018-07-25 08:50:50,370 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:50:50,378 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 08:50:50,427 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:50:50,428 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:50:50,428 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:50:50,429 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:50:50,429 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:50:50,429 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:50:50,429 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:50:50,429 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:50:50,430 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:50:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2018-07-25 08:50:50,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-07-25 08:50:50,454 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:50,455 INFO L354 BasicCegarLoop]: trace histogram [1, 1] [2018-07-25 08:50:50,456 INFO L415 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:50,460 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-07-25 08:50:50,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:50,588 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:50:50,589 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-07-25 08:50:50,592 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:50:50,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:50:50,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:50:50,607 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2018-07-25 08:50:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:50,648 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-07-25 08:50:50,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:50:50,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-07-25 08:50:50,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:50,661 INFO L225 Difference]: With dead ends: 7 [2018-07-25 08:50:50,661 INFO L226 Difference]: Without dead ends: 4 [2018-07-25 08:50:50,665 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-07-25 08:50:50,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-07-25 08:50:50,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-07-25 08:50:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-07-25 08:50:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-07-25 08:50:50,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-07-25 08:50:50,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:50,700 INFO L472 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-07-25 08:50:50,700 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:50:50,701 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-07-25 08:50:50,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-25 08:50:50,701 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:50,701 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-25 08:50:50,702 INFO L415 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:50,702 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-07-25 08:50:50,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:50,796 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:50,796 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2018-07-25 08:50:50,799 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:50:50,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:50:50,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:50:50,800 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-07-25 08:50:50,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:50,817 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-07-25 08:50:50,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:50:50,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-07-25 08:50:50,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:50,819 INFO L225 Difference]: With dead ends: 6 [2018-07-25 08:50:50,819 INFO L226 Difference]: Without dead ends: 5 [2018-07-25 08:50:50,820 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:50:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-25 08:50:50,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-25 08:50:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-25 08:50:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-25 08:50:50,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-25 08:50:50,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:50,823 INFO L472 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-25 08:50:50,824 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:50:50,824 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-25 08:50:50,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 08:50:50,824 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:50,824 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-07-25 08:50:50,825 INFO L415 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:50,825 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-07-25 08:50:50,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:50,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:50,913 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:50,913 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 08:50:50,915 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:50:50,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:50:50,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:50:50,918 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-07-25 08:50:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:50,953 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-07-25 08:50:50,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:50:50,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-25 08:50:50,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:50,954 INFO L225 Difference]: With dead ends: 7 [2018-07-25 08:50:50,954 INFO L226 Difference]: Without dead ends: 6 [2018-07-25 08:50:50,955 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:50:50,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-25 08:50:50,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-25 08:50:50,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-25 08:50:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-25 08:50:50,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-25 08:50:50,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:50,959 INFO L472 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-25 08:50:50,959 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:50:50,959 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-25 08:50:50,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 08:50:50,960 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:50,960 INFO L354 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-07-25 08:50:50,961 INFO L415 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:50,961 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-07-25 08:50:50,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:51,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:51,040 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:51,040 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 08:50:51,040 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:50:51,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:50:51,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:50:51,048 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-07-25 08:50:51,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:51,077 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-25 08:50:51,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 08:50:51,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-07-25 08:50:51,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:51,078 INFO L225 Difference]: With dead ends: 8 [2018-07-25 08:50:51,078 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 08:50:51,080 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:50:51,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 08:50:51,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 08:50:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 08:50:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 08:50:51,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-25 08:50:51,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:51,090 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 08:50:51,090 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:50:51,090 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 08:50:51,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:50:51,092 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:51,092 INFO L354 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-07-25 08:50:51,093 INFO L415 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:51,093 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-07-25 08:50:51,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:51,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:51,211 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:51,211 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:50:51,212 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:50:51,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:50:51,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:50:51,215 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-07-25 08:50:51,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:51,274 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 08:50:51,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 08:50:51,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 08:50:51,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:51,275 INFO L225 Difference]: With dead ends: 9 [2018-07-25 08:50:51,276 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 08:50:51,279 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:50:51,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 08:50:51,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-25 08:50:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-25 08:50:51,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-25 08:50:51,285 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-25 08:50:51,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:51,285 INFO L472 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-25 08:50:51,286 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:50:51,286 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-25 08:50:51,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 08:50:51,287 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:51,287 INFO L354 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-07-25 08:50:51,287 INFO L415 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:51,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-07-25 08:50:51,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:51,405 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:51,406 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:51,406 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:50:51,411 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:50:51,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:50:51,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:50:51,413 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-07-25 08:50:51,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:51,481 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-25 08:50:51,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 08:50:51,481 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 08:50:51,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:51,482 INFO L225 Difference]: With dead ends: 10 [2018-07-25 08:50:51,482 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 08:50:51,483 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:50:51,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 08:50:51,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 08:50:51,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 08:50:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 08:50:51,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-25 08:50:51,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:51,489 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 08:50:51,489 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:50:51,489 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 08:50:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:50:51,490 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:51,490 INFO L354 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-07-25 08:50:51,490 INFO L415 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:51,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-07-25 08:50:51,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:51,555 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:51,556 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:51,556 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:50:51,557 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:50:51,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:50:51,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:50:51,559 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-07-25 08:50:51,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:51,616 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 08:50:51,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 08:50:51,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-07-25 08:50:51,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:51,617 INFO L225 Difference]: With dead ends: 11 [2018-07-25 08:50:51,618 INFO L226 Difference]: Without dead ends: 10 [2018-07-25 08:50:51,619 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:50:51,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-25 08:50:51,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-25 08:50:51,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-25 08:50:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-25 08:50:51,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-25 08:50:51,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:51,632 INFO L472 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-25 08:50:51,632 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:50:51,633 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-25 08:50:51,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 08:50:51,633 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:51,633 INFO L354 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-07-25 08:50:51,634 INFO L415 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:51,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-07-25 08:50:51,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:51,722 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:51,723 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:51,723 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:50:51,723 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:50:51,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:50:51,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:50:51,725 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-07-25 08:50:51,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:51,778 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-25 08:50:51,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:50:51,779 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-07-25 08:50:51,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:51,780 INFO L225 Difference]: With dead ends: 12 [2018-07-25 08:50:51,780 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 08:50:51,781 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:50:51,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 08:50:51,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 08:50:51,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 08:50:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 08:50:51,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-25 08:50:51,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:51,792 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 08:50:51,792 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:50:51,792 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 08:50:51,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:50:51,793 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:51,793 INFO L354 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-07-25 08:50:51,794 INFO L415 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:51,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-07-25 08:50:51,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:51,889 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:51,889 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:50:51,889 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:50:51,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:50:51,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:50:51,890 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-07-25 08:50:51,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:51,934 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 08:50:51,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:50:51,934 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-07-25 08:50:51,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:51,935 INFO L225 Difference]: With dead ends: 13 [2018-07-25 08:50:51,936 INFO L226 Difference]: Without dead ends: 12 [2018-07-25 08:50:51,936 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:50:51,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-25 08:50:51,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-25 08:50:51,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-25 08:50:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-25 08:50:51,942 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-25 08:50:51,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:51,943 INFO L472 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-25 08:50:51,943 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:50:51,943 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-25 08:50:51,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:50:51,944 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:51,944 INFO L354 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-07-25 08:50:51,945 INFO L415 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:51,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-07-25 08:50:51,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:52,028 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:52,028 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:50:52,028 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:50:52,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:50:52,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:50:52,030 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-07-25 08:50:52,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:52,091 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-25 08:50:52,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:50:52,091 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-07-25 08:50:52,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:52,092 INFO L225 Difference]: With dead ends: 14 [2018-07-25 08:50:52,092 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 08:50:52,093 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:50:52,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 08:50:52,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 08:50:52,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 08:50:52,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 08:50:52,099 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-25 08:50:52,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:52,100 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 08:50:52,100 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:50:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 08:50:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:50:52,101 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:52,101 INFO L354 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-07-25 08:50:52,101 INFO L415 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:52,102 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-07-25 08:50:52,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:52,190 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:52,190 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:50:52,191 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:50:52,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:50:52,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:50:52,192 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-07-25 08:50:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:52,250 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 08:50:52,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:50:52,250 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-07-25 08:50:52,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:52,251 INFO L225 Difference]: With dead ends: 15 [2018-07-25 08:50:52,251 INFO L226 Difference]: Without dead ends: 14 [2018-07-25 08:50:52,252 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:50:52,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-25 08:50:52,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-25 08:50:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-25 08:50:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-25 08:50:52,258 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-25 08:50:52,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:52,259 INFO L472 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-25 08:50:52,259 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:50:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-25 08:50:52,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:50:52,261 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:52,263 INFO L354 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-07-25 08:50:52,263 INFO L415 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:52,263 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-07-25 08:50:52,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:52,382 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:52,382 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:52,383 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:50:52,383 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:50:52,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:50:52,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:50:52,384 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-07-25 08:50:52,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:52,445 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-25 08:50:52,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:50:52,446 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-07-25 08:50:52,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:52,446 INFO L225 Difference]: With dead ends: 16 [2018-07-25 08:50:52,447 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 08:50:52,447 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:50:52,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 08:50:52,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 08:50:52,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 08:50:52,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 08:50:52,454 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-25 08:50:52,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:52,455 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 08:50:52,455 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:50:52,455 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 08:50:52,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:50:52,456 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:52,456 INFO L354 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-07-25 08:50:52,456 INFO L415 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:52,456 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-07-25 08:50:52,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:52,566 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:52,567 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:52,567 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:50:52,567 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:50:52,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:50:52,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:50:52,568 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-07-25 08:50:52,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:52,642 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 08:50:52,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:50:52,642 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-07-25 08:50:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:52,643 INFO L225 Difference]: With dead ends: 17 [2018-07-25 08:50:52,643 INFO L226 Difference]: Without dead ends: 16 [2018-07-25 08:50:52,644 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:50:52,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-25 08:50:52,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-25 08:50:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-25 08:50:52,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-25 08:50:52,652 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-25 08:50:52,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:52,653 INFO L472 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-25 08:50:52,653 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:50:52,653 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-25 08:50:52,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:50:52,654 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:52,654 INFO L354 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-07-25 08:50:52,654 INFO L415 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:52,655 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-07-25 08:50:52,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:52,782 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:52,783 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:50:52,783 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:50:52,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:50:52,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:50:52,786 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-07-25 08:50:52,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:52,876 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-25 08:50:52,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 08:50:52,877 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-07-25 08:50:52,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:52,878 INFO L225 Difference]: With dead ends: 18 [2018-07-25 08:50:52,878 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 08:50:52,878 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:50:52,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 08:50:52,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 08:50:52,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 08:50:52,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 08:50:52,892 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-07-25 08:50:52,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:52,892 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 08:50:52,892 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:50:52,892 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 08:50:52,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:50:52,893 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:52,893 INFO L354 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-07-25 08:50:52,894 INFO L415 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:52,895 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-07-25 08:50:52,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:53,047 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:53,048 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:53,048 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:50:53,048 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 08:50:53,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 08:50:53,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:50:53,049 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-07-25 08:50:53,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:53,138 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 08:50:53,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:50:53,139 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-07-25 08:50:53,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:53,140 INFO L225 Difference]: With dead ends: 19 [2018-07-25 08:50:53,140 INFO L226 Difference]: Without dead ends: 18 [2018-07-25 08:50:53,141 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:50:53,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-25 08:50:53,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-25 08:50:53,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-25 08:50:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-25 08:50:53,153 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-07-25 08:50:53,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:53,154 INFO L472 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-25 08:50:53,154 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 08:50:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-25 08:50:53,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 08:50:53,155 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:53,155 INFO L354 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-07-25 08:50:53,155 INFO L415 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:53,156 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-07-25 08:50:53,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:53,331 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:53,331 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 08:50:53,331 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 08:50:53,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 08:50:53,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:50:53,332 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-07-25 08:50:53,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:53,432 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-25 08:50:53,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:50:53,432 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-07-25 08:50:53,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:53,433 INFO L225 Difference]: With dead ends: 20 [2018-07-25 08:50:53,433 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 08:50:53,434 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:50:53,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 08:50:53,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 08:50:53,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 08:50:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 08:50:53,445 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-07-25 08:50:53,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:53,445 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 08:50:53,445 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 08:50:53,445 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 08:50:53,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:50:53,446 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:53,446 INFO L354 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-07-25 08:50:53,447 INFO L415 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:53,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-07-25 08:50:53,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:53,607 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:53,608 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:53,608 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 08:50:53,608 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 08:50:53,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 08:50:53,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:50:53,609 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-07-25 08:50:53,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:53,723 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 08:50:53,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:50:53,723 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-07-25 08:50:53,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:53,724 INFO L225 Difference]: With dead ends: 21 [2018-07-25 08:50:53,725 INFO L226 Difference]: Without dead ends: 20 [2018-07-25 08:50:53,726 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:50:53,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-25 08:50:53,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-25 08:50:53,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-25 08:50:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-25 08:50:53,739 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-07-25 08:50:53,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:53,740 INFO L472 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-25 08:50:53,740 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 08:50:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-25 08:50:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 08:50:53,741 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:53,741 INFO L354 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-07-25 08:50:53,741 INFO L415 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:53,742 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-07-25 08:50:53,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:53,904 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:53,904 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:53,905 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 08:50:53,905 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 08:50:53,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 08:50:53,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:50:53,906 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-07-25 08:50:54,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:54,025 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-25 08:50:54,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 08:50:54,026 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-07-25 08:50:54,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:54,026 INFO L225 Difference]: With dead ends: 22 [2018-07-25 08:50:54,026 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 08:50:54,027 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:50:54,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 08:50:54,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 08:50:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 08:50:54,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 08:50:54,041 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-07-25 08:50:54,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:54,041 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 08:50:54,041 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 08:50:54,042 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 08:50:54,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:50:54,043 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:54,043 INFO L354 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-07-25 08:50:54,044 INFO L415 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:54,044 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-07-25 08:50:54,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:54,301 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:54,302 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:54,302 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 08:50:54,302 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 08:50:54,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 08:50:54,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:50:54,304 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-07-25 08:50:54,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:54,445 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 08:50:54,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:50:54,446 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-07-25 08:50:54,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:54,446 INFO L225 Difference]: With dead ends: 23 [2018-07-25 08:50:54,446 INFO L226 Difference]: Without dead ends: 22 [2018-07-25 08:50:54,447 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:50:54,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-25 08:50:54,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-25 08:50:54,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-25 08:50:54,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-07-25 08:50:54,463 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-07-25 08:50:54,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:54,463 INFO L472 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-07-25 08:50:54,466 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 08:50:54,466 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-07-25 08:50:54,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:50:54,467 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:54,467 INFO L354 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-07-25 08:50:54,468 INFO L415 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:54,468 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-07-25 08:50:54,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:54,688 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:54,688 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 08:50:54,689 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 08:50:54,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 08:50:54,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:50:54,690 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-07-25 08:50:54,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:54,835 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-25 08:50:54,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:50:54,835 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-07-25 08:50:54,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:54,836 INFO L225 Difference]: With dead ends: 24 [2018-07-25 08:50:54,836 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 08:50:54,837 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:50:54,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 08:50:54,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 08:50:54,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 08:50:54,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 08:50:54,853 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-07-25 08:50:54,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:54,854 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 08:50:54,854 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 08:50:54,854 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 08:50:54,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:50:54,855 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:54,855 INFO L354 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-07-25 08:50:54,855 INFO L415 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:54,855 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-07-25 08:50:54,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:55,083 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:55,084 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:55,084 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 08:50:55,085 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 08:50:55,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 08:50:55,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:50:55,086 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-07-25 08:50:55,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:55,238 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 08:50:55,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:50:55,238 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-07-25 08:50:55,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:55,239 INFO L225 Difference]: With dead ends: 25 [2018-07-25 08:50:55,239 INFO L226 Difference]: Without dead ends: 24 [2018-07-25 08:50:55,240 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:50:55,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-25 08:50:55,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-07-25 08:50:55,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-25 08:50:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-07-25 08:50:55,256 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-07-25 08:50:55,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:55,257 INFO L472 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-07-25 08:50:55,257 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 08:50:55,257 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-07-25 08:50:55,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:50:55,259 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:55,259 INFO L354 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-07-25 08:50:55,259 INFO L415 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:55,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-07-25 08:50:55,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:55,460 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:55,461 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:55,461 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 08:50:55,461 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 08:50:55,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 08:50:55,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:50:55,463 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-07-25 08:50:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:55,628 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-25 08:50:55,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:50:55,631 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-07-25 08:50:55,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:55,632 INFO L225 Difference]: With dead ends: 26 [2018-07-25 08:50:55,632 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 08:50:55,633 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:50:55,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 08:50:55,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 08:50:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 08:50:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 08:50:55,654 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-07-25 08:50:55,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:55,655 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 08:50:55,655 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 08:50:55,655 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 08:50:55,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 08:50:55,656 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:55,656 INFO L354 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-07-25 08:50:55,656 INFO L415 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:55,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-07-25 08:50:55,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:55,858 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:55,858 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 08:50:55,859 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 08:50:55,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 08:50:55,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:50:55,860 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-07-25 08:50:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:56,022 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 08:50:56,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 08:50:56,023 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-07-25 08:50:56,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:56,023 INFO L225 Difference]: With dead ends: 27 [2018-07-25 08:50:56,023 INFO L226 Difference]: Without dead ends: 26 [2018-07-25 08:50:56,024 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:50:56,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-25 08:50:56,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-25 08:50:56,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-25 08:50:56,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-25 08:50:56,042 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-07-25 08:50:56,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:56,042 INFO L472 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-25 08:50:56,042 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 08:50:56,043 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-25 08:50:56,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 08:50:56,043 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:56,043 INFO L354 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-07-25 08:50:56,044 INFO L415 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:56,044 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-07-25 08:50:56,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:56,234 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:56,234 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 08:50:56,234 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 08:50:56,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 08:50:56,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:50:56,235 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-07-25 08:50:56,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:56,396 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-07-25 08:50:56,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 08:50:56,396 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-07-25 08:50:56,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:56,397 INFO L225 Difference]: With dead ends: 28 [2018-07-25 08:50:56,397 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 08:50:56,397 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:50:56,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 08:50:56,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 08:50:56,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 08:50:56,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 08:50:56,414 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-07-25 08:50:56,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:56,414 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 08:50:56,414 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 08:50:56,414 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 08:50:56,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 08:50:56,415 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:56,415 INFO L354 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-07-25 08:50:56,416 INFO L415 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:56,416 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-07-25 08:50:56,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:56,619 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:56,619 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:56,619 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 08:50:56,620 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 08:50:56,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 08:50:56,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:50:56,621 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-07-25 08:50:56,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:56,797 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 08:50:56,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 08:50:56,797 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-07-25 08:50:56,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:56,798 INFO L225 Difference]: With dead ends: 29 [2018-07-25 08:50:56,798 INFO L226 Difference]: Without dead ends: 28 [2018-07-25 08:50:56,798 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:50:56,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-25 08:50:56,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-25 08:50:56,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-25 08:50:56,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-07-25 08:50:56,819 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-07-25 08:50:56,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:56,819 INFO L472 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-07-25 08:50:56,819 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 08:50:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-07-25 08:50:56,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-25 08:50:56,820 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:56,820 INFO L354 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-07-25 08:50:56,822 INFO L415 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:56,823 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-07-25 08:50:56,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:57,060 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:57,060 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 08:50:57,061 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 08:50:57,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 08:50:57,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:50:57,062 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-07-25 08:50:57,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:57,298 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-25 08:50:57,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 08:50:57,298 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-07-25 08:50:57,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:57,299 INFO L225 Difference]: With dead ends: 30 [2018-07-25 08:50:57,299 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 08:50:57,300 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:50:57,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 08:50:57,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 08:50:57,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 08:50:57,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 08:50:57,322 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-07-25 08:50:57,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:57,322 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 08:50:57,322 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 08:50:57,322 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 08:50:57,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 08:50:57,323 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:57,323 INFO L354 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-07-25 08:50:57,324 INFO L415 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:57,324 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-07-25 08:50:57,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:57,686 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:57,687 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:57,687 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 08:50:57,687 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 08:50:57,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 08:50:57,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:50:57,688 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-07-25 08:50:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:57,883 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 08:50:57,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 08:50:57,883 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-07-25 08:50:57,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:57,884 INFO L225 Difference]: With dead ends: 31 [2018-07-25 08:50:57,884 INFO L226 Difference]: Without dead ends: 30 [2018-07-25 08:50:57,885 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:50:57,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-25 08:50:57,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-25 08:50:57,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-25 08:50:57,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-07-25 08:50:57,905 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-07-25 08:50:57,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:57,905 INFO L472 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-07-25 08:50:57,905 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 08:50:57,905 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-07-25 08:50:57,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-25 08:50:57,906 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:57,906 INFO L354 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-07-25 08:50:57,907 INFO L415 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:57,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-07-25 08:50:57,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:58,141 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:58,141 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:58,141 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 08:50:58,142 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 08:50:58,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 08:50:58,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:50:58,143 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-07-25 08:50:58,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:58,355 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-07-25 08:50:58,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 08:50:58,355 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-07-25 08:50:58,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:58,356 INFO L225 Difference]: With dead ends: 32 [2018-07-25 08:50:58,356 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 08:50:58,356 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:50:58,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 08:50:58,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 08:50:58,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 08:50:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 08:50:58,384 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-07-25 08:50:58,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:58,384 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 08:50:58,384 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 08:50:58,384 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 08:50:58,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 08:50:58,385 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:58,385 INFO L354 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-07-25 08:50:58,385 INFO L415 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:58,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-07-25 08:50:58,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:58,632 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:58,632 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:58,632 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 08:50:58,633 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 08:50:58,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 08:50:58,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:50:58,634 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-07-25 08:50:58,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:58,844 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 08:50:58,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 08:50:58,844 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-07-25 08:50:58,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:58,845 INFO L225 Difference]: With dead ends: 33 [2018-07-25 08:50:58,845 INFO L226 Difference]: Without dead ends: 32 [2018-07-25 08:50:58,845 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:50:58,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-25 08:50:58,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-25 08:50:58,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-25 08:50:58,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-25 08:50:58,874 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-07-25 08:50:58,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:58,874 INFO L472 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-25 08:50:58,874 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 08:50:58,874 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-25 08:50:58,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-25 08:50:58,875 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:58,875 INFO L354 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-07-25 08:50:58,876 INFO L415 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:58,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-07-25 08:50:58,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:59,102 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:59,102 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:59,102 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 08:50:59,103 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 08:50:59,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 08:50:59,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:50:59,104 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-07-25 08:50:59,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:59,324 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-07-25 08:50:59,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 08:50:59,324 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-07-25 08:50:59,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:59,325 INFO L225 Difference]: With dead ends: 34 [2018-07-25 08:50:59,325 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 08:50:59,326 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:50:59,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 08:50:59,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 08:50:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 08:50:59,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 08:50:59,349 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-07-25 08:50:59,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:59,350 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 08:50:59,350 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 08:50:59,350 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 08:50:59,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 08:50:59,350 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:59,350 INFO L354 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-07-25 08:50:59,351 INFO L415 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:59,351 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-07-25 08:50:59,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:59,593 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:59,593 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:59,594 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 08:50:59,594 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 08:50:59,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 08:50:59,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:50:59,595 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-07-25 08:50:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:59,812 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 08:50:59,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 08:50:59,813 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-07-25 08:50:59,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:59,813 INFO L225 Difference]: With dead ends: 35 [2018-07-25 08:50:59,813 INFO L226 Difference]: Without dead ends: 34 [2018-07-25 08:50:59,814 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:50:59,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-25 08:50:59,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-25 08:50:59,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-25 08:50:59,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-07-25 08:50:59,837 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-07-25 08:50:59,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:59,837 INFO L472 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-07-25 08:50:59,837 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 08:50:59,837 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-07-25 08:50:59,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-25 08:50:59,838 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:59,838 INFO L354 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-07-25 08:50:59,838 INFO L415 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:59,838 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-07-25 08:50:59,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:00,106 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:00,106 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 08:51:00,106 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 08:51:00,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 08:51:00,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:51:00,108 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-07-25 08:51:00,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:00,363 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-25 08:51:00,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 08:51:00,364 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-07-25 08:51:00,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:00,364 INFO L225 Difference]: With dead ends: 36 [2018-07-25 08:51:00,365 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 08:51:00,365 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:51:00,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 08:51:00,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 08:51:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 08:51:00,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 08:51:00,398 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-07-25 08:51:00,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:00,398 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 08:51:00,398 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 08:51:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 08:51:00,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 08:51:00,401 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:00,401 INFO L354 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-07-25 08:51:00,401 INFO L415 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:00,402 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-07-25 08:51:00,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:00,705 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:00,706 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:00,706 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 08:51:00,708 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 08:51:00,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 08:51:00,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:51:00,710 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-07-25 08:51:00,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:00,946 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 08:51:00,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 08:51:00,946 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-07-25 08:51:00,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:00,947 INFO L225 Difference]: With dead ends: 37 [2018-07-25 08:51:00,947 INFO L226 Difference]: Without dead ends: 36 [2018-07-25 08:51:00,948 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:51:00,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-25 08:51:00,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-25 08:51:00,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-25 08:51:00,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-25 08:51:00,981 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-07-25 08:51:00,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:00,982 INFO L472 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-25 08:51:00,982 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 08:51:00,982 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-25 08:51:00,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-25 08:51:00,984 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:00,984 INFO L354 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-07-25 08:51:00,985 INFO L415 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:00,985 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-07-25 08:51:00,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:01,244 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:01,244 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:01,244 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 08:51:01,245 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 08:51:01,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 08:51:01,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:51:01,246 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-07-25 08:51:01,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:01,493 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-07-25 08:51:01,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 08:51:01,494 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-07-25 08:51:01,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:01,494 INFO L225 Difference]: With dead ends: 38 [2018-07-25 08:51:01,494 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 08:51:01,495 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:51:01,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 08:51:01,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 08:51:01,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 08:51:01,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 08:51:01,523 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-07-25 08:51:01,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:01,523 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 08:51:01,523 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 08:51:01,523 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 08:51:01,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 08:51:01,524 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:01,524 INFO L354 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-07-25 08:51:01,524 INFO L415 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:01,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-07-25 08:51:01,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:01,803 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:01,803 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:01,804 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 08:51:01,804 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 08:51:01,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 08:51:01,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:51:01,805 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-07-25 08:51:02,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:02,086 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 08:51:02,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 08:51:02,086 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-07-25 08:51:02,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:02,087 INFO L225 Difference]: With dead ends: 39 [2018-07-25 08:51:02,087 INFO L226 Difference]: Without dead ends: 38 [2018-07-25 08:51:02,088 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:51:02,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-25 08:51:02,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-25 08:51:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-25 08:51:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-25 08:51:02,115 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-07-25 08:51:02,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:02,115 INFO L472 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-25 08:51:02,115 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 08:51:02,115 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-25 08:51:02,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-25 08:51:02,116 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:02,116 INFO L354 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-07-25 08:51:02,116 INFO L415 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:02,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-07-25 08:51:02,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:02,367 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:02,367 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:02,368 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 08:51:02,368 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 08:51:02,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 08:51:02,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:51:02,369 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-07-25 08:51:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:02,628 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-25 08:51:02,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 08:51:02,629 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-07-25 08:51:02,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:02,629 INFO L225 Difference]: With dead ends: 40 [2018-07-25 08:51:02,629 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 08:51:02,630 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:51:02,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 08:51:02,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 08:51:02,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 08:51:02,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 08:51:02,663 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-07-25 08:51:02,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:02,663 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 08:51:02,663 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 08:51:02,663 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 08:51:02,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 08:51:02,663 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:02,664 INFO L354 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-07-25 08:51:02,664 INFO L415 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:02,664 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-07-25 08:51:02,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:02,930 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:02,930 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 08:51:02,930 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 08:51:02,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 08:51:02,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:51:02,932 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-07-25 08:51:03,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:03,216 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 08:51:03,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 08:51:03,216 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-07-25 08:51:03,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:03,217 INFO L225 Difference]: With dead ends: 41 [2018-07-25 08:51:03,217 INFO L226 Difference]: Without dead ends: 40 [2018-07-25 08:51:03,218 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:51:03,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-25 08:51:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-25 08:51:03,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-25 08:51:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-07-25 08:51:03,246 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-07-25 08:51:03,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:03,247 INFO L472 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-07-25 08:51:03,247 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 08:51:03,247 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-07-25 08:51:03,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-25 08:51:03,247 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:03,248 INFO L354 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-07-25 08:51:03,248 INFO L415 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:03,248 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-07-25 08:51:03,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:03,586 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:03,586 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 08:51:03,586 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 08:51:03,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 08:51:03,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 08:51:03,588 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-07-25 08:51:03,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:03,914 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-25 08:51:03,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 08:51:03,914 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-07-25 08:51:03,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:03,915 INFO L225 Difference]: With dead ends: 42 [2018-07-25 08:51:03,915 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 08:51:03,916 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 08:51:03,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 08:51:03,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 08:51:03,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 08:51:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 08:51:03,944 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-07-25 08:51:03,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:03,945 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 08:51:03,945 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 08:51:03,945 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 08:51:03,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 08:51:03,946 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:03,946 INFO L354 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-07-25 08:51:03,946 INFO L415 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:03,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-07-25 08:51:03,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:04,212 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:04,212 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 08:51:04,212 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 08:51:04,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 08:51:04,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:51:04,214 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-07-25 08:51:04,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:04,486 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 08:51:04,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 08:51:04,486 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-07-25 08:51:04,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:04,487 INFO L225 Difference]: With dead ends: 43 [2018-07-25 08:51:04,487 INFO L226 Difference]: Without dead ends: 42 [2018-07-25 08:51:04,488 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:51:04,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-25 08:51:04,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-07-25 08:51:04,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-25 08:51:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-07-25 08:51:04,520 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-07-25 08:51:04,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:04,520 INFO L472 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-07-25 08:51:04,520 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 08:51:04,521 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-07-25 08:51:04,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-25 08:51:04,521 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:04,521 INFO L354 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-07-25 08:51:04,521 INFO L415 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:04,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-07-25 08:51:04,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:04,804 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:04,804 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:04,805 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 08:51:04,805 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 08:51:04,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 08:51:04,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 08:51:04,806 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-07-25 08:51:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:05,101 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-07-25 08:51:05,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 08:51:05,101 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-07-25 08:51:05,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:05,102 INFO L225 Difference]: With dead ends: 44 [2018-07-25 08:51:05,102 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 08:51:05,103 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 08:51:05,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 08:51:05,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 08:51:05,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 08:51:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 08:51:05,132 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-07-25 08:51:05,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:05,132 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 08:51:05,133 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 08:51:05,133 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 08:51:05,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 08:51:05,133 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:05,133 INFO L354 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-07-25 08:51:05,134 INFO L415 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:05,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-07-25 08:51:05,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:05,425 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:05,425 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:05,425 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 08:51:05,426 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 08:51:05,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 08:51:05,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:51:05,427 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-07-25 08:51:05,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:05,731 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 08:51:05,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 08:51:05,731 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-07-25 08:51:05,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:05,732 INFO L225 Difference]: With dead ends: 45 [2018-07-25 08:51:05,732 INFO L226 Difference]: Without dead ends: 44 [2018-07-25 08:51:05,734 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:51:05,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-25 08:51:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-25 08:51:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-25 08:51:05,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-25 08:51:05,766 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-07-25 08:51:05,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:05,766 INFO L472 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-25 08:51:05,766 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 08:51:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-25 08:51:05,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-25 08:51:05,767 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:05,767 INFO L354 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-07-25 08:51:05,767 INFO L415 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:05,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-07-25 08:51:05,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:06,074 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:06,074 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:06,074 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 08:51:06,074 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 08:51:06,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 08:51:06,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 08:51:06,076 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-07-25 08:51:06,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:06,386 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-07-25 08:51:06,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 08:51:06,386 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-07-25 08:51:06,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:06,387 INFO L225 Difference]: With dead ends: 46 [2018-07-25 08:51:06,387 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 08:51:06,388 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 08:51:06,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 08:51:06,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 08:51:06,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 08:51:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 08:51:06,416 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-07-25 08:51:06,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:06,416 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 08:51:06,417 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 08:51:06,417 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 08:51:06,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 08:51:06,417 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:06,417 INFO L354 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-07-25 08:51:06,418 INFO L415 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:06,418 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-07-25 08:51:06,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:06,736 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:06,737 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:06,737 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 08:51:06,737 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 08:51:06,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 08:51:06,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 08:51:06,738 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-07-25 08:51:07,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:07,035 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 08:51:07,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 08:51:07,035 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-07-25 08:51:07,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:07,035 INFO L225 Difference]: With dead ends: 47 [2018-07-25 08:51:07,036 INFO L226 Difference]: Without dead ends: 46 [2018-07-25 08:51:07,037 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 08:51:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-25 08:51:07,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-25 08:51:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-25 08:51:07,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-07-25 08:51:07,065 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-07-25 08:51:07,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:07,065 INFO L472 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-07-25 08:51:07,065 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 08:51:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-07-25 08:51:07,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-25 08:51:07,065 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:07,066 INFO L354 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-07-25 08:51:07,066 INFO L415 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:07,066 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-07-25 08:51:07,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:07,365 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:07,366 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:07,366 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 08:51:07,366 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 08:51:07,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 08:51:07,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 08:51:07,368 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-07-25 08:51:07,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:07,705 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-07-25 08:51:07,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 08:51:07,705 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-07-25 08:51:07,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:07,706 INFO L225 Difference]: With dead ends: 48 [2018-07-25 08:51:07,706 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 08:51:07,707 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 08:51:07,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 08:51:07,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 08:51:07,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 08:51:07,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 08:51:07,738 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-07-25 08:51:07,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:07,739 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 08:51:07,739 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 08:51:07,739 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 08:51:07,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 08:51:07,739 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:07,739 INFO L354 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-07-25 08:51:07,740 INFO L415 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:07,740 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2018-07-25 08:51:07,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:08,083 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:08,083 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 08:51:08,084 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 08:51:08,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 08:51:08,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 08:51:08,085 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-07-25 08:51:08,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:08,427 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 08:51:08,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 08:51:08,427 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-07-25 08:51:08,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:08,428 INFO L225 Difference]: With dead ends: 49 [2018-07-25 08:51:08,428 INFO L226 Difference]: Without dead ends: 48 [2018-07-25 08:51:08,429 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 08:51:08,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-25 08:51:08,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-25 08:51:08,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-25 08:51:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-07-25 08:51:08,462 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-07-25 08:51:08,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:08,462 INFO L472 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-07-25 08:51:08,462 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 08:51:08,463 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-07-25 08:51:08,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-25 08:51:08,464 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:08,464 INFO L354 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-07-25 08:51:08,464 INFO L415 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:08,464 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2018-07-25 08:51:08,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:08,804 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:08,804 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 08:51:08,804 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 08:51:08,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 08:51:08,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 08:51:08,805 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-07-25 08:51:09,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:09,176 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-07-25 08:51:09,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 08:51:09,176 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-07-25 08:51:09,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:09,177 INFO L225 Difference]: With dead ends: 50 [2018-07-25 08:51:09,177 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 08:51:09,178 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 08:51:09,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 08:51:09,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 08:51:09,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 08:51:09,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 08:51:09,223 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-07-25 08:51:09,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:09,223 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 08:51:09,223 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 08:51:09,224 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 08:51:09,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 08:51:09,224 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:09,224 INFO L354 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-07-25 08:51:09,225 INFO L415 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:09,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2018-07-25 08:51:09,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:09,679 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:09,679 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 08:51:09,679 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 08:51:09,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 08:51:09,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 08:51:09,680 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-07-25 08:51:10,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:10,044 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 08:51:10,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 08:51:10,044 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-07-25 08:51:10,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:10,045 INFO L225 Difference]: With dead ends: 51 [2018-07-25 08:51:10,045 INFO L226 Difference]: Without dead ends: 50 [2018-07-25 08:51:10,045 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 08:51:10,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-25 08:51:10,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-07-25 08:51:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-25 08:51:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-07-25 08:51:10,084 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-07-25 08:51:10,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:10,084 INFO L472 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-07-25 08:51:10,084 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 08:51:10,084 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-07-25 08:51:10,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-25 08:51:10,085 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:10,085 INFO L354 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-07-25 08:51:10,085 INFO L415 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2018-07-25 08:51:10,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:10,453 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:10,454 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 08:51:10,454 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 08:51:10,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 08:51:10,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 08:51:10,455 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-07-25 08:51:10,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:10,739 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-07-25 08:51:10,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 08:51:10,739 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-07-25 08:51:10,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:10,739 INFO L225 Difference]: With dead ends: 52 [2018-07-25 08:51:10,739 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 08:51:10,740 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 08:51:10,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 08:51:10,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 08:51:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 08:51:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 08:51:10,767 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-07-25 08:51:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:10,767 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 08:51:10,767 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 08:51:10,767 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 08:51:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 08:51:10,768 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:10,768 INFO L354 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-07-25 08:51:10,768 INFO L415 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:10,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2018-07-25 08:51:10,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:11,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:11,081 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:11,081 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 08:51:11,081 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 08:51:11,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 08:51:11,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:51:11,082 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-07-25 08:51:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:11,376 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 08:51:11,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 08:51:11,376 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-07-25 08:51:11,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:11,377 INFO L225 Difference]: With dead ends: 53 [2018-07-25 08:51:11,377 INFO L226 Difference]: Without dead ends: 52 [2018-07-25 08:51:11,377 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:51:11,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-25 08:51:11,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-07-25 08:51:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-25 08:51:11,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-07-25 08:51:11,406 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-07-25 08:51:11,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:11,406 INFO L472 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-07-25 08:51:11,406 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 08:51:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-07-25 08:51:11,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-25 08:51:11,407 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:11,407 INFO L354 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-07-25 08:51:11,407 INFO L415 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:11,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2018-07-25 08:51:11,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:11,795 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:11,796 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 08:51:11,796 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 08:51:11,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 08:51:11,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 08:51:11,797 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-07-25 08:51:12,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:12,162 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-25 08:51:12,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 08:51:12,162 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-07-25 08:51:12,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:12,163 INFO L225 Difference]: With dead ends: 54 [2018-07-25 08:51:12,163 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 08:51:12,164 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 08:51:12,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 08:51:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 08:51:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 08:51:12,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 08:51:12,200 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-07-25 08:51:12,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:12,200 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 08:51:12,200 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 08:51:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 08:51:12,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 08:51:12,201 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:12,201 INFO L354 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-07-25 08:51:12,201 INFO L415 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:12,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2018-07-25 08:51:12,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:12,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:12,565 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:12,565 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 08:51:12,565 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 08:51:12,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 08:51:12,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:51:12,566 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-07-25 08:51:12,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:12,901 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 08:51:12,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 08:51:12,902 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-07-25 08:51:12,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:12,902 INFO L225 Difference]: With dead ends: 55 [2018-07-25 08:51:12,902 INFO L226 Difference]: Without dead ends: 54 [2018-07-25 08:51:12,903 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:51:12,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-25 08:51:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-07-25 08:51:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-25 08:51:12,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-07-25 08:51:12,933 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-07-25 08:51:12,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:12,933 INFO L472 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-07-25 08:51:12,933 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 08:51:12,933 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-07-25 08:51:12,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-25 08:51:12,933 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:12,934 INFO L354 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-07-25 08:51:12,934 INFO L415 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:12,934 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2018-07-25 08:51:12,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:13,257 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:13,257 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 08:51:13,257 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 08:51:13,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 08:51:13,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 08:51:13,258 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-07-25 08:51:13,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:13,585 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-07-25 08:51:13,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 08:51:13,585 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-07-25 08:51:13,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:13,586 INFO L225 Difference]: With dead ends: 56 [2018-07-25 08:51:13,586 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 08:51:13,586 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 08:51:13,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 08:51:13,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 08:51:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 08:51:13,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 08:51:13,619 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-07-25 08:51:13,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:13,619 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 08:51:13,620 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 08:51:13,620 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 08:51:13,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 08:51:13,620 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:13,620 INFO L354 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-07-25 08:51:13,621 INFO L415 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:13,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2018-07-25 08:51:13,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:14,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:14,062 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:14,062 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 08:51:14,062 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 08:51:14,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 08:51:14,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 08:51:14,063 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-07-25 08:51:14,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:14,407 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 08:51:14,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 08:51:14,407 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-07-25 08:51:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:14,408 INFO L225 Difference]: With dead ends: 57 [2018-07-25 08:51:14,408 INFO L226 Difference]: Without dead ends: 56 [2018-07-25 08:51:14,408 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 08:51:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-25 08:51:14,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-07-25 08:51:14,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-25 08:51:14,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-25 08:51:14,438 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-07-25 08:51:14,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:14,438 INFO L472 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-25 08:51:14,438 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 08:51:14,438 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-25 08:51:14,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-25 08:51:14,438 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:14,438 INFO L354 BasicCegarLoop]: trace histogram [53, 1, 1] [2018-07-25 08:51:14,439 INFO L415 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:14,439 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2018-07-25 08:51:14,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:14,758 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:14,758 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 08:51:14,758 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 08:51:14,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 08:51:14,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 08:51:14,759 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-07-25 08:51:15,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:15,156 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-07-25 08:51:15,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 08:51:15,157 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-07-25 08:51:15,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:15,157 INFO L225 Difference]: With dead ends: 58 [2018-07-25 08:51:15,158 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 08:51:15,158 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 08:51:15,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 08:51:15,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 08:51:15,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 08:51:15,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 08:51:15,197 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-07-25 08:51:15,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:15,197 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 08:51:15,197 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 08:51:15,197 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 08:51:15,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 08:51:15,198 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:15,198 INFO L354 BasicCegarLoop]: trace histogram [54, 1, 1] [2018-07-25 08:51:15,198 INFO L415 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:15,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2018-07-25 08:51:15,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:15,705 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:15,705 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 08:51:15,706 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 08:51:15,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 08:51:15,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 08:51:15,707 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2018-07-25 08:51:16,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:16,187 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 08:51:16,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 08:51:16,188 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-07-25 08:51:16,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:16,188 INFO L225 Difference]: With dead ends: 59 [2018-07-25 08:51:16,188 INFO L226 Difference]: Without dead ends: 58 [2018-07-25 08:51:16,189 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 08:51:16,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-25 08:51:16,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-07-25 08:51:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-25 08:51:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-07-25 08:51:16,219 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-07-25 08:51:16,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:16,219 INFO L472 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-07-25 08:51:16,219 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 08:51:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-07-25 08:51:16,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-25 08:51:16,220 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:16,220 INFO L354 BasicCegarLoop]: trace histogram [55, 1, 1] [2018-07-25 08:51:16,220 INFO L415 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:16,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895647, now seen corresponding path program 55 times [2018-07-25 08:51:16,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:16,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:16,593 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:16,593 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 08:51:16,593 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 08:51:16,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 08:51:16,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 08:51:16,594 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-07-25 08:51:17,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:17,102 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-25 08:51:17,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 08:51:17,102 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-07-25 08:51:17,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:17,103 INFO L225 Difference]: With dead ends: 60 [2018-07-25 08:51:17,103 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 08:51:17,103 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 08:51:17,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 08:51:17,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 08:51:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 08:51:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 08:51:17,150 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-07-25 08:51:17,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:17,150 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 08:51:17,150 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 08:51:17,150 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 08:51:17,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 08:51:17,151 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:17,151 INFO L354 BasicCegarLoop]: trace histogram [56, 1, 1] [2018-07-25 08:51:17,153 INFO L415 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:17,154 INFO L82 PathProgramCache]: Analyzing trace with hash -836059449, now seen corresponding path program 56 times [2018-07-25 08:51:17,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:17,613 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:17,614 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 08:51:17,614 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 08:51:17,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 08:51:17,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 08:51:17,614 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2018-07-25 08:51:17,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:17,951 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 08:51:17,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 08:51:17,951 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2018-07-25 08:51:17,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:17,952 INFO L225 Difference]: With dead ends: 61 [2018-07-25 08:51:17,952 INFO L226 Difference]: Without dead ends: 60 [2018-07-25 08:51:17,953 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 08:51:17,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-25 08:51:17,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-07-25 08:51:17,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-25 08:51:17,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-07-25 08:51:17,989 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-07-25 08:51:17,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:17,989 INFO L472 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-07-25 08:51:17,989 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 08:51:17,989 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-07-25 08:51:17,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-25 08:51:17,989 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:17,989 INFO L354 BasicCegarLoop]: trace histogram [57, 1, 1] [2018-07-25 08:51:17,990 INFO L415 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:17,990 INFO L82 PathProgramCache]: Analyzing trace with hash -148039199, now seen corresponding path program 57 times [2018-07-25 08:51:17,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:18,360 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:18,360 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 08:51:18,360 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 08:51:18,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 08:51:18,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 08:51:18,361 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-07-25 08:51:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:18,705 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-07-25 08:51:18,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 08:51:18,705 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-07-25 08:51:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:18,706 INFO L225 Difference]: With dead ends: 62 [2018-07-25 08:51:18,706 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 08:51:18,706 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 08:51:18,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 08:51:18,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 08:51:18,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 08:51:18,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 08:51:18,739 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-07-25 08:51:18,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:18,739 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 08:51:18,740 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 08:51:18,740 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 08:51:18,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 08:51:18,740 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:18,740 INFO L354 BasicCegarLoop]: trace histogram [58, 1, 1] [2018-07-25 08:51:18,740 INFO L415 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:18,741 INFO L82 PathProgramCache]: Analyzing trace with hash -294247929, now seen corresponding path program 58 times [2018-07-25 08:51:18,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:19,044 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:19,044 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 08:51:19,044 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 08:51:19,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 08:51:19,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:51:19,045 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2018-07-25 08:51:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:19,395 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 08:51:19,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 08:51:19,395 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2018-07-25 08:51:19,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:19,396 INFO L225 Difference]: With dead ends: 63 [2018-07-25 08:51:19,396 INFO L226 Difference]: Without dead ends: 62 [2018-07-25 08:51:19,397 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:51:19,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-25 08:51:19,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-07-25 08:51:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-25 08:51:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-07-25 08:51:19,433 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-07-25 08:51:19,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:19,434 INFO L472 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-07-25 08:51:19,434 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 08:51:19,434 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-07-25 08:51:19,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-25 08:51:19,434 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:19,434 INFO L354 BasicCegarLoop]: trace histogram [59, 1, 1] [2018-07-25 08:51:19,435 INFO L415 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:19,435 INFO L82 PathProgramCache]: Analyzing trace with hash -531751263, now seen corresponding path program 59 times [2018-07-25 08:51:19,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:19,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:19,810 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:19,810 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 08:51:19,811 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 08:51:19,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 08:51:19,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 08:51:19,811 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-07-25 08:51:20,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:20,216 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-07-25 08:51:20,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 08:51:20,216 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-07-25 08:51:20,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:20,217 INFO L225 Difference]: With dead ends: 64 [2018-07-25 08:51:20,217 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 08:51:20,218 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 08:51:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 08:51:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 08:51:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 08:51:20,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 08:51:20,253 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-07-25 08:51:20,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:20,254 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 08:51:20,254 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 08:51:20,254 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 08:51:20,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 08:51:20,254 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:20,255 INFO L354 BasicCegarLoop]: trace histogram [60, 1, 1] [2018-07-25 08:51:20,255 INFO L415 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:20,255 INFO L82 PathProgramCache]: Analyzing trace with hash 695579975, now seen corresponding path program 60 times [2018-07-25 08:51:20,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:20,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:20,735 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:20,735 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 08:51:20,735 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 08:51:20,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 08:51:20,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 08:51:20,737 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2018-07-25 08:51:21,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:21,223 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 08:51:21,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 08:51:21,223 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2018-07-25 08:51:21,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:21,225 INFO L225 Difference]: With dead ends: 65 [2018-07-25 08:51:21,225 INFO L226 Difference]: Without dead ends: 64 [2018-07-25 08:51:21,225 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 08:51:21,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-25 08:51:21,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-07-25 08:51:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-25 08:51:21,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-07-25 08:51:21,270 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-07-25 08:51:21,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:21,271 INFO L472 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-07-25 08:51:21,271 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 08:51:21,271 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-07-25 08:51:21,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-25 08:51:21,271 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:21,272 INFO L354 BasicCegarLoop]: trace histogram [61, 1, 1] [2018-07-25 08:51:21,272 INFO L415 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:21,272 INFO L82 PathProgramCache]: Analyzing trace with hash 88142689, now seen corresponding path program 61 times [2018-07-25 08:51:21,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:21,623 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:21,623 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 08:51:21,624 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 08:51:21,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 08:51:21,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 08:51:21,625 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-07-25 08:51:21,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:21,985 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-25 08:51:21,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 08:51:21,986 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-07-25 08:51:21,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:21,986 INFO L225 Difference]: With dead ends: 66 [2018-07-25 08:51:21,987 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 08:51:21,987 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 08:51:21,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 08:51:22,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 08:51:22,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 08:51:22,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 08:51:22,023 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-07-25 08:51:22,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:22,024 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 08:51:22,024 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 08:51:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 08:51:22,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 08:51:22,024 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:22,024 INFO L354 BasicCegarLoop]: trace histogram [62, 1, 1] [2018-07-25 08:51:22,025 INFO L415 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:22,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543993, now seen corresponding path program 62 times [2018-07-25 08:51:22,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:22,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:22,630 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:22,630 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 08:51:22,631 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 08:51:22,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 08:51:22,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 08:51:22,632 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2018-07-25 08:51:23,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:23,233 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 08:51:23,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 08:51:23,233 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2018-07-25 08:51:23,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:23,234 INFO L225 Difference]: With dead ends: 67 [2018-07-25 08:51:23,234 INFO L226 Difference]: Without dead ends: 66 [2018-07-25 08:51:23,235 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 08:51:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-25 08:51:23,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-07-25 08:51:23,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-25 08:51:23,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-07-25 08:51:23,277 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-07-25 08:51:23,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:23,277 INFO L472 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-07-25 08:51:23,277 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 08:51:23,277 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-07-25 08:51:23,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-25 08:51:23,278 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:23,278 INFO L354 BasicCegarLoop]: trace histogram [63, 1, 1] [2018-07-25 08:51:23,279 INFO L415 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:23,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223583, now seen corresponding path program 63 times [2018-07-25 08:51:23,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:23,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:23,677 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:23,678 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 08:51:23,678 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 08:51:23,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 08:51:23,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 08:51:23,679 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-07-25 08:51:24,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:24,103 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-07-25 08:51:24,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 08:51:24,103 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-07-25 08:51:24,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:24,104 INFO L225 Difference]: With dead ends: 68 [2018-07-25 08:51:24,104 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 08:51:24,105 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 08:51:24,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 08:51:24,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 08:51:24,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 08:51:24,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 08:51:24,142 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-07-25 08:51:24,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:24,143 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 08:51:24,143 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 08:51:24,143 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 08:51:24,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 08:51:24,144 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:24,144 INFO L354 BasicCegarLoop]: trace histogram [64, 1, 1] [2018-07-25 08:51:24,144 INFO L415 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:24,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774535, now seen corresponding path program 64 times [2018-07-25 08:51:24,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:24,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:24,530 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:24,530 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 08:51:24,531 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 08:51:24,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 08:51:24,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 08:51:24,532 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2018-07-25 08:51:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:24,925 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 08:51:24,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 08:51:24,926 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-07-25 08:51:24,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:24,926 INFO L225 Difference]: With dead ends: 69 [2018-07-25 08:51:24,926 INFO L226 Difference]: Without dead ends: 68 [2018-07-25 08:51:24,927 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 08:51:24,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-25 08:51:24,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-07-25 08:51:24,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-25 08:51:24,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-07-25 08:51:24,964 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-07-25 08:51:24,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:24,965 INFO L472 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-07-25 08:51:24,965 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 08:51:24,965 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-07-25 08:51:24,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-25 08:51:24,965 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:24,966 INFO L354 BasicCegarLoop]: trace histogram [65, 1, 1] [2018-07-25 08:51:24,966 INFO L415 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:24,966 INFO L82 PathProgramCache]: Analyzing trace with hash -892597023, now seen corresponding path program 65 times [2018-07-25 08:51:24,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:25,352 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:25,352 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 08:51:25,353 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 08:51:25,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 08:51:25,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 08:51:25,353 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-07-25 08:51:25,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:25,757 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-07-25 08:51:25,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 08:51:25,758 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-07-25 08:51:25,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:25,758 INFO L225 Difference]: With dead ends: 70 [2018-07-25 08:51:25,758 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 08:51:25,759 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 08:51:25,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 08:51:25,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 08:51:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 08:51:25,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 08:51:25,798 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-07-25 08:51:25,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:25,799 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 08:51:25,799 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 08:51:25,799 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 08:51:25,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 08:51:25,799 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:25,799 INFO L354 BasicCegarLoop]: trace histogram [66, 1, 1] [2018-07-25 08:51:25,800 INFO L415 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:25,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703993, now seen corresponding path program 66 times [2018-07-25 08:51:25,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:26,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:26,191 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:26,191 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 08:51:26,191 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 08:51:26,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 08:51:26,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 08:51:26,192 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2018-07-25 08:51:26,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:26,789 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 08:51:26,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 08:51:26,789 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2018-07-25 08:51:26,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:26,790 INFO L225 Difference]: With dead ends: 71 [2018-07-25 08:51:26,790 INFO L226 Difference]: Without dead ends: 70 [2018-07-25 08:51:26,790 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 08:51:26,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-25 08:51:26,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-25 08:51:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-25 08:51:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-07-25 08:51:26,835 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-07-25 08:51:26,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:26,835 INFO L472 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-07-25 08:51:26,835 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 08:51:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-07-25 08:51:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-25 08:51:26,836 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:26,836 INFO L354 BasicCegarLoop]: trace histogram [67, 1, 1] [2018-07-25 08:51:26,837 INFO L415 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:26,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718305, now seen corresponding path program 67 times [2018-07-25 08:51:26,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:27,321 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:27,321 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 08:51:27,322 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 08:51:27,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 08:51:27,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 08:51:27,323 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-07-25 08:51:27,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:27,740 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-07-25 08:51:27,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 08:51:27,741 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-07-25 08:51:27,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:27,741 INFO L225 Difference]: With dead ends: 72 [2018-07-25 08:51:27,741 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 08:51:27,742 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 08:51:27,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 08:51:27,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 08:51:27,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 08:51:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 08:51:27,783 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-07-25 08:51:27,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:27,783 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 08:51:27,783 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 08:51:27,783 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 08:51:27,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 08:51:27,784 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:27,784 INFO L354 BasicCegarLoop]: trace histogram [68, 1, 1] [2018-07-25 08:51:27,784 INFO L415 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:27,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438265, now seen corresponding path program 68 times [2018-07-25 08:51:27,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:28,223 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:28,223 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 08:51:28,223 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 08:51:28,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 08:51:28,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 08:51:28,224 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2018-07-25 08:51:28,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:28,660 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 08:51:28,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 08:51:28,660 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2018-07-25 08:51:28,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:28,661 INFO L225 Difference]: With dead ends: 73 [2018-07-25 08:51:28,661 INFO L226 Difference]: Without dead ends: 72 [2018-07-25 08:51:28,661 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 08:51:28,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-25 08:51:28,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-25 08:51:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-25 08:51:28,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-07-25 08:51:28,703 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-07-25 08:51:28,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:28,703 INFO L472 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-07-25 08:51:28,703 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 08:51:28,703 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-07-25 08:51:28,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-25 08:51:28,704 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:28,704 INFO L354 BasicCegarLoop]: trace histogram [69, 1, 1] [2018-07-25 08:51:28,704 INFO L415 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:28,704 INFO L82 PathProgramCache]: Analyzing trace with hash 976119393, now seen corresponding path program 69 times [2018-07-25 08:51:28,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:29,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:29,153 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:29,153 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 08:51:29,153 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 08:51:29,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 08:51:29,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 08:51:29,154 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-07-25 08:51:29,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:29,638 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-07-25 08:51:29,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 08:51:29,638 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-07-25 08:51:29,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:29,639 INFO L225 Difference]: With dead ends: 74 [2018-07-25 08:51:29,639 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 08:51:29,639 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 08:51:29,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 08:51:29,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 08:51:29,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 08:51:29,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 08:51:29,681 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-07-25 08:51:29,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:29,681 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 08:51:29,681 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 08:51:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 08:51:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 08:51:29,682 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:29,682 INFO L354 BasicCegarLoop]: trace histogram [70, 1, 1] [2018-07-25 08:51:29,682 INFO L415 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:29,682 INFO L82 PathProgramCache]: Analyzing trace with hash 194930055, now seen corresponding path program 70 times [2018-07-25 08:51:29,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:30,111 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:30,111 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 08:51:30,111 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 08:51:30,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 08:51:30,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 08:51:30,112 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2018-07-25 08:51:30,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:30,587 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 08:51:30,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 08:51:30,587 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2018-07-25 08:51:30,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:30,587 INFO L225 Difference]: With dead ends: 75 [2018-07-25 08:51:30,587 INFO L226 Difference]: Without dead ends: 74 [2018-07-25 08:51:30,588 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 08:51:30,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-25 08:51:30,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-25 08:51:30,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-25 08:51:30,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-07-25 08:51:30,634 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-07-25 08:51:30,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:30,634 INFO L472 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-07-25 08:51:30,634 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 08:51:30,635 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-07-25 08:51:30,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-25 08:51:30,635 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:30,635 INFO L354 BasicCegarLoop]: trace histogram [71, 1, 1] [2018-07-25 08:51:30,635 INFO L415 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:30,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864353, now seen corresponding path program 71 times [2018-07-25 08:51:30,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:31,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:31,074 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:31,074 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 08:51:31,074 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 08:51:31,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 08:51:31,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 08:51:31,075 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-07-25 08:51:31,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:31,576 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-07-25 08:51:31,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 08:51:31,576 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-07-25 08:51:31,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:31,577 INFO L225 Difference]: With dead ends: 76 [2018-07-25 08:51:31,577 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 08:51:31,577 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 08:51:31,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 08:51:31,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 08:51:31,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 08:51:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 08:51:31,624 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-07-25 08:51:31,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:31,624 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 08:51:31,624 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 08:51:31,624 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 08:51:31,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 08:51:31,625 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:31,625 INFO L354 BasicCegarLoop]: trace histogram [72, 1, 1] [2018-07-25 08:51:31,625 INFO L415 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:31,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779961, now seen corresponding path program 72 times [2018-07-25 08:51:31,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:32,188 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:32,188 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 08:51:32,188 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 08:51:32,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 08:51:32,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 08:51:32,188 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2018-07-25 08:51:32,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:32,667 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 08:51:32,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 08:51:32,668 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2018-07-25 08:51:32,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:32,668 INFO L225 Difference]: With dead ends: 77 [2018-07-25 08:51:32,668 INFO L226 Difference]: Without dead ends: 76 [2018-07-25 08:51:32,669 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 08:51:32,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-25 08:51:32,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-25 08:51:32,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-25 08:51:32,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-07-25 08:51:32,733 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-07-25 08:51:32,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:32,733 INFO L472 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-07-25 08:51:32,733 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 08:51:32,733 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-07-25 08:51:32,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-25 08:51:32,734 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:32,734 INFO L354 BasicCegarLoop]: trace histogram [73, 1, 1] [2018-07-25 08:51:32,734 INFO L415 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:32,735 INFO L82 PathProgramCache]: Analyzing trace with hash 365428705, now seen corresponding path program 73 times [2018-07-25 08:51:32,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:33,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:33,206 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:33,206 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 08:51:33,206 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 08:51:33,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 08:51:33,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 08:51:33,207 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-07-25 08:51:33,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:33,794 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-25 08:51:33,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 08:51:33,794 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-07-25 08:51:33,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:33,795 INFO L225 Difference]: With dead ends: 78 [2018-07-25 08:51:33,795 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 08:51:33,796 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 08:51:33,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 08:51:33,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 08:51:33,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 08:51:33,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 08:51:33,862 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-07-25 08:51:33,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:33,863 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 08:51:33,863 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 08:51:33,863 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 08:51:33,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 08:51:33,863 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:33,863 INFO L354 BasicCegarLoop]: trace histogram [74, 1, 1] [2018-07-25 08:51:33,863 INFO L415 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:33,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612089, now seen corresponding path program 74 times [2018-07-25 08:51:33,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:34,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:34,414 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:34,414 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 08:51:34,414 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 08:51:34,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 08:51:34,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 08:51:34,415 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2018-07-25 08:51:35,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:35,035 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 08:51:35,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 08:51:35,035 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2018-07-25 08:51:35,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:35,035 INFO L225 Difference]: With dead ends: 79 [2018-07-25 08:51:35,036 INFO L226 Difference]: Without dead ends: 78 [2018-07-25 08:51:35,036 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 08:51:35,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-25 08:51:35,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-25 08:51:35,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-25 08:51:35,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-07-25 08:51:35,103 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-07-25 08:51:35,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:35,103 INFO L472 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-07-25 08:51:35,103 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 08:51:35,103 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-07-25 08:51:35,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-07-25 08:51:35,104 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:35,104 INFO L354 BasicCegarLoop]: trace histogram [75, 1, 1] [2018-07-25 08:51:35,104 INFO L415 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:35,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334559, now seen corresponding path program 75 times [2018-07-25 08:51:35,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:35,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:35,654 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:35,654 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 08:51:35,654 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 08:51:35,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 08:51:35,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 08:51:35,655 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-07-25 08:51:36,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:36,234 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-07-25 08:51:36,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 08:51:36,234 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-07-25 08:51:36,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:36,235 INFO L225 Difference]: With dead ends: 80 [2018-07-25 08:51:36,235 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 08:51:36,235 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 08:51:36,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 08:51:36,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 08:51:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 08:51:36,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 08:51:36,293 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-07-25 08:51:36,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:36,293 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 08:51:36,293 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 08:51:36,293 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 08:51:36,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 08:51:36,294 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:36,294 INFO L354 BasicCegarLoop]: trace histogram [76, 1, 1] [2018-07-25 08:51:36,294 INFO L415 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:36,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600313, now seen corresponding path program 76 times [2018-07-25 08:51:36,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:36,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:36,783 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:36,783 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 08:51:36,783 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 08:51:36,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 08:51:36,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 08:51:36,784 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2018-07-25 08:51:37,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:37,347 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 08:51:37,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 08:51:37,347 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2018-07-25 08:51:37,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:37,348 INFO L225 Difference]: With dead ends: 81 [2018-07-25 08:51:37,348 INFO L226 Difference]: Without dead ends: 80 [2018-07-25 08:51:37,348 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 08:51:37,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-25 08:51:37,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-25 08:51:37,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-25 08:51:37,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-07-25 08:51:37,399 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-07-25 08:51:37,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:37,399 INFO L472 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-07-25 08:51:37,399 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 08:51:37,399 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-07-25 08:51:37,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-25 08:51:37,400 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:37,400 INFO L354 BasicCegarLoop]: trace histogram [77, 1, 1] [2018-07-25 08:51:37,400 INFO L415 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:37,400 INFO L82 PathProgramCache]: Analyzing trace with hash -268904095, now seen corresponding path program 77 times [2018-07-25 08:51:37,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:37,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:37,915 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:37,916 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 08:51:37,916 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 08:51:37,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 08:51:37,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 08:51:37,917 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-07-25 08:51:38,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:38,623 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-07-25 08:51:38,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 08:51:38,624 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-07-25 08:51:38,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:38,624 INFO L225 Difference]: With dead ends: 82 [2018-07-25 08:51:38,625 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 08:51:38,625 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 08:51:38,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 08:51:38,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 08:51:38,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 08:51:38,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 08:51:38,723 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-07-25 08:51:38,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:38,723 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 08:51:38,723 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 08:51:38,723 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 08:51:38,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 08:51:38,724 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:38,724 INFO L354 BasicCegarLoop]: trace histogram [78, 1, 1] [2018-07-25 08:51:38,724 INFO L415 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:38,724 INFO L82 PathProgramCache]: Analyzing trace with hash 253907591, now seen corresponding path program 78 times [2018-07-25 08:51:38,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:39,590 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:39,591 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 08:51:39,591 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 08:51:39,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 08:51:39,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 08:51:39,592 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2018-07-25 08:51:40,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:40,291 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 08:51:40,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 08:51:40,291 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2018-07-25 08:51:40,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:40,292 INFO L225 Difference]: With dead ends: 83 [2018-07-25 08:51:40,292 INFO L226 Difference]: Without dead ends: 82 [2018-07-25 08:51:40,292 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 08:51:40,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-25 08:51:40,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-07-25 08:51:40,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-25 08:51:40,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-07-25 08:51:40,354 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-07-25 08:51:40,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:40,355 INFO L472 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-07-25 08:51:40,355 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 08:51:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-07-25 08:51:40,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-07-25 08:51:40,355 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:40,355 INFO L354 BasicCegarLoop]: trace histogram [79, 1, 1] [2018-07-25 08:51:40,356 INFO L415 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:40,356 INFO L82 PathProgramCache]: Analyzing trace with hash -718799327, now seen corresponding path program 79 times [2018-07-25 08:51:40,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:40,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:40,938 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:40,938 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 08:51:40,939 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 08:51:40,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 08:51:40,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 08:51:40,940 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-07-25 08:51:41,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:41,577 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-07-25 08:51:41,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 08:51:41,577 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-07-25 08:51:41,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:41,577 INFO L225 Difference]: With dead ends: 84 [2018-07-25 08:51:41,577 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 08:51:41,578 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 08:51:41,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 08:51:41,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 08:51:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 08:51:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 08:51:41,647 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-07-25 08:51:41,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:41,648 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 08:51:41,648 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 08:51:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 08:51:41,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 08:51:41,648 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:41,649 INFO L354 BasicCegarLoop]: trace histogram [80, 1, 1] [2018-07-25 08:51:41,649 INFO L415 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:41,649 INFO L82 PathProgramCache]: Analyzing trace with hash -807942713, now seen corresponding path program 80 times [2018-07-25 08:51:41,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:42,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:42,218 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:42,218 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 08:51:42,218 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 08:51:42,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 08:51:42,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 08:51:42,219 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2018-07-25 08:51:42,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:42,861 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 08:51:42,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 08:51:42,862 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 82 [2018-07-25 08:51:42,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:42,862 INFO L225 Difference]: With dead ends: 85 [2018-07-25 08:51:42,863 INFO L226 Difference]: Without dead ends: 84 [2018-07-25 08:51:42,863 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 08:51:42,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-25 08:51:42,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-07-25 08:51:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-25 08:51:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-07-25 08:51:42,938 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-07-25 08:51:42,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:42,938 INFO L472 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-07-25 08:51:42,938 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 08:51:42,938 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-07-25 08:51:42,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-25 08:51:42,939 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:42,939 INFO L354 BasicCegarLoop]: trace histogram [81, 1, 1] [2018-07-25 08:51:42,939 INFO L415 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:42,939 INFO L82 PathProgramCache]: Analyzing trace with hash 723579617, now seen corresponding path program 81 times [2018-07-25 08:51:42,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:43,505 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:43,505 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 08:51:43,506 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 08:51:43,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 08:51:43,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 08:51:43,506 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2018-07-25 08:51:44,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:44,208 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-07-25 08:51:44,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 08:51:44,208 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2018-07-25 08:51:44,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:44,208 INFO L225 Difference]: With dead ends: 86 [2018-07-25 08:51:44,209 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 08:51:44,209 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 08:51:44,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 08:51:44,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 08:51:44,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 08:51:44,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 08:51:44,273 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-07-25 08:51:44,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:44,273 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 08:51:44,273 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 08:51:44,274 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 08:51:44,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 08:51:44,274 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:44,274 INFO L354 BasicCegarLoop]: trace histogram [82, 1, 1] [2018-07-25 08:51:44,274 INFO L415 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:44,274 INFO L82 PathProgramCache]: Analyzing trace with hash 956131591, now seen corresponding path program 82 times [2018-07-25 08:51:44,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:44,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:44,954 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:44,954 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 08:51:44,954 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 08:51:44,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 08:51:44,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 08:51:44,955 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 85 states. [2018-07-25 08:51:45,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:45,677 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 08:51:45,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 08:51:45,677 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 84 [2018-07-25 08:51:45,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:45,678 INFO L225 Difference]: With dead ends: 87 [2018-07-25 08:51:45,678 INFO L226 Difference]: Without dead ends: 86 [2018-07-25 08:51:45,678 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 08:51:45,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-25 08:51:45,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-25 08:51:45,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-25 08:51:45,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-25 08:51:45,744 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-07-25 08:51:45,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:45,744 INFO L472 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-25 08:51:45,744 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 08:51:45,744 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-25 08:51:45,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-25 08:51:45,745 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:45,745 INFO L354 BasicCegarLoop]: trace histogram [83, 1, 1] [2018-07-25 08:51:45,745 INFO L415 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:45,745 INFO L82 PathProgramCache]: Analyzing trace with hash -424691807, now seen corresponding path program 83 times [2018-07-25 08:51:45,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:46,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:46,500 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:46,500 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 08:51:46,501 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 08:51:46,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 08:51:46,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 08:51:46,501 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2018-07-25 08:51:47,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:47,267 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-07-25 08:51:47,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 08:51:47,268 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 85 [2018-07-25 08:51:47,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:47,268 INFO L225 Difference]: With dead ends: 88 [2018-07-25 08:51:47,268 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 08:51:47,269 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 08:51:47,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 08:51:47,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 08:51:47,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 08:51:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 08:51:47,338 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-07-25 08:51:47,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:47,338 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 08:51:47,338 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 08:51:47,339 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 08:51:47,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 08:51:47,339 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:47,339 INFO L354 BasicCegarLoop]: trace histogram [84, 1, 1] [2018-07-25 08:51:47,339 INFO L415 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:47,339 INFO L82 PathProgramCache]: Analyzing trace with hash -280544185, now seen corresponding path program 84 times [2018-07-25 08:51:47,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:47,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:47,998 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:47,998 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 08:51:47,998 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 08:51:47,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 08:51:47,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 08:51:47,999 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 87 states. [2018-07-25 08:51:48,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:48,726 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 08:51:48,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 08:51:48,727 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 86 [2018-07-25 08:51:48,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:48,727 INFO L225 Difference]: With dead ends: 89 [2018-07-25 08:51:48,728 INFO L226 Difference]: Without dead ends: 88 [2018-07-25 08:51:48,728 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 08:51:48,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-25 08:51:48,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-07-25 08:51:48,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-25 08:51:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-07-25 08:51:48,803 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-07-25 08:51:48,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:48,803 INFO L472 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-07-25 08:51:48,803 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 08:51:48,804 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-07-25 08:51:48,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-25 08:51:48,804 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:48,804 INFO L354 BasicCegarLoop]: trace histogram [85, 1, 1] [2018-07-25 08:51:48,805 INFO L415 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:48,805 INFO L82 PathProgramCache]: Analyzing trace with hash -106935199, now seen corresponding path program 85 times [2018-07-25 08:51:48,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:49,529 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:49,529 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 08:51:49,530 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 08:51:49,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 08:51:49,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 08:51:49,531 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2018-07-25 08:51:50,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:50,332 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-25 08:51:50,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 08:51:50,332 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 87 [2018-07-25 08:51:50,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:50,333 INFO L225 Difference]: With dead ends: 90 [2018-07-25 08:51:50,333 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 08:51:50,333 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 08:51:50,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 08:51:50,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 08:51:50,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 08:51:50,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 08:51:50,404 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-07-25 08:51:50,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:50,404 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 08:51:50,404 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 08:51:50,405 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 08:51:50,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 08:51:50,405 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:50,405 INFO L354 BasicCegarLoop]: trace histogram [86, 1, 1] [2018-07-25 08:51:50,405 INFO L415 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:50,406 INFO L82 PathProgramCache]: Analyzing trace with hash 979976071, now seen corresponding path program 86 times [2018-07-25 08:51:50,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:51,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:51,139 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:51,139 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 08:51:51,140 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 08:51:51,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 08:51:51,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 08:51:51,141 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 89 states. [2018-07-25 08:51:51,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:51,918 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 08:51:51,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 08:51:51,919 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 88 [2018-07-25 08:51:51,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:51,919 INFO L225 Difference]: With dead ends: 91 [2018-07-25 08:51:51,919 INFO L226 Difference]: Without dead ends: 90 [2018-07-25 08:51:51,920 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 08:51:51,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-25 08:51:51,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-07-25 08:51:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-25 08:51:51,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-07-25 08:51:51,991 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-07-25 08:51:51,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:51,992 INFO L472 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-07-25 08:51:51,992 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 08:51:51,992 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-07-25 08:51:51,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-07-25 08:51:51,992 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:51,992 INFO L354 BasicCegarLoop]: trace histogram [87, 1, 1] [2018-07-25 08:51:51,992 INFO L415 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:51,993 INFO L82 PathProgramCache]: Analyzing trace with hash 314487073, now seen corresponding path program 87 times [2018-07-25 08:51:51,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:52,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:52,706 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:52,706 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 08:51:52,707 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 08:51:52,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 08:51:52,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 08:51:52,707 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 90 states. [2018-07-25 08:51:53,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:53,567 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-07-25 08:51:53,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 08:51:53,567 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 89 [2018-07-25 08:51:53,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:53,568 INFO L225 Difference]: With dead ends: 92 [2018-07-25 08:51:53,568 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 08:51:53,569 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 08:51:53,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 08:51:53,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 08:51:53,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 08:51:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 08:51:53,667 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-07-25 08:51:53,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:53,667 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 08:51:53,667 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 08:51:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 08:51:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 08:51:53,668 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:53,668 INFO L354 BasicCegarLoop]: trace histogram [88, 1, 1] [2018-07-25 08:51:53,668 INFO L415 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:53,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164615, now seen corresponding path program 88 times [2018-07-25 08:51:53,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:54,456 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:54,456 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 08:51:54,457 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 08:51:54,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 08:51:54,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 08:51:54,458 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 91 states. [2018-07-25 08:51:55,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:55,238 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 08:51:55,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 08:51:55,238 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 90 [2018-07-25 08:51:55,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:55,239 INFO L225 Difference]: With dead ends: 93 [2018-07-25 08:51:55,239 INFO L226 Difference]: Without dead ends: 92 [2018-07-25 08:51:55,240 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 08:51:55,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-25 08:51:55,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-25 08:51:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-25 08:51:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-07-25 08:51:55,315 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-07-25 08:51:55,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:55,315 INFO L472 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-07-25 08:51:55,315 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 08:51:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-07-25 08:51:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-25 08:51:55,316 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:55,316 INFO L354 BasicCegarLoop]: trace histogram [89, 1, 1] [2018-07-25 08:51:55,316 INFO L415 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:55,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364641, now seen corresponding path program 89 times [2018-07-25 08:51:55,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:56,110 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:56,111 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 08:51:56,111 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 08:51:56,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 08:51:56,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 08:51:56,112 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 92 states. [2018-07-25 08:51:56,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:56,979 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-07-25 08:51:56,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 08:51:56,979 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 91 [2018-07-25 08:51:56,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:56,980 INFO L225 Difference]: With dead ends: 94 [2018-07-25 08:51:56,980 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 08:51:56,981 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 08:51:56,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 08:51:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 08:51:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 08:51:57,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 08:51:57,057 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-07-25 08:51:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:57,058 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 08:51:57,058 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 08:51:57,058 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 08:51:57,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 08:51:57,058 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:57,058 INFO L354 BasicCegarLoop]: trace histogram [90, 1, 1] [2018-07-25 08:51:57,058 INFO L415 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:57,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663559, now seen corresponding path program 90 times [2018-07-25 08:51:57,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:57,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:57,857 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:57,857 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 08:51:57,857 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 08:51:57,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 08:51:57,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 08:51:57,858 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 93 states. [2018-07-25 08:51:58,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:58,642 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 08:51:58,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 08:51:58,642 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 92 [2018-07-25 08:51:58,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:58,643 INFO L225 Difference]: With dead ends: 95 [2018-07-25 08:51:58,643 INFO L226 Difference]: Without dead ends: 94 [2018-07-25 08:51:58,643 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 08:51:58,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-25 08:51:58,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-25 08:51:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-25 08:51:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-07-25 08:51:58,721 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-07-25 08:51:58,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:58,722 INFO L472 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-07-25 08:51:58,722 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 08:51:58,722 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-07-25 08:51:58,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-25 08:51:58,722 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:58,722 INFO L354 BasicCegarLoop]: trace histogram [91, 1, 1] [2018-07-25 08:51:58,722 INFO L415 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:58,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930017, now seen corresponding path program 91 times [2018-07-25 08:51:58,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:59,541 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:59,541 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 08:51:59,542 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 08:51:59,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 08:51:59,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 08:51:59,543 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 94 states. [2018-07-25 08:52:00,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:00,520 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-07-25 08:52:00,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 08:52:00,520 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 93 [2018-07-25 08:52:00,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:00,521 INFO L225 Difference]: With dead ends: 96 [2018-07-25 08:52:00,521 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 08:52:00,522 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 08:52:00,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 08:52:00,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 08:52:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 08:52:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 08:52:00,602 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-07-25 08:52:00,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:00,602 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 08:52:00,603 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 08:52:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 08:52:00,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 08:52:00,603 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:00,603 INFO L354 BasicCegarLoop]: trace histogram [92, 1, 1] [2018-07-25 08:52:00,603 INFO L415 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:00,603 INFO L82 PathProgramCache]: Analyzing trace with hash 854092103, now seen corresponding path program 92 times [2018-07-25 08:52:00,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:01,477 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:01,478 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 08:52:01,478 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 08:52:01,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 08:52:01,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 08:52:01,479 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 95 states. [2018-07-25 08:52:02,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:02,581 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 08:52:02,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 08:52:02,582 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 94 [2018-07-25 08:52:02,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:02,582 INFO L225 Difference]: With dead ends: 97 [2018-07-25 08:52:02,582 INFO L226 Difference]: Without dead ends: 96 [2018-07-25 08:52:02,583 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 08:52:02,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-25 08:52:02,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-25 08:52:02,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-25 08:52:02,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-07-25 08:52:02,696 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-07-25 08:52:02,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:02,697 INFO L472 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-07-25 08:52:02,697 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 08:52:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-07-25 08:52:02,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-25 08:52:02,697 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:02,698 INFO L354 BasicCegarLoop]: trace histogram [93, 1, 1] [2018-07-25 08:52:02,698 INFO L415 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:02,698 INFO L82 PathProgramCache]: Analyzing trace with hash 707051361, now seen corresponding path program 93 times [2018-07-25 08:52:02,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:03,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:03,524 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:03,525 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 08:52:03,525 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 08:52:03,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 08:52:03,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 08:52:03,526 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 96 states. [2018-07-25 08:52:04,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:04,557 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-07-25 08:52:04,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 08:52:04,557 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 95 [2018-07-25 08:52:04,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:04,558 INFO L225 Difference]: With dead ends: 98 [2018-07-25 08:52:04,558 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 08:52:04,558 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 08:52:04,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 08:52:04,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 08:52:04,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 08:52:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 08:52:04,658 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-07-25 08:52:04,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:04,658 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 08:52:04,658 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 08:52:04,658 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 08:52:04,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 08:52:04,659 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:04,659 INFO L354 BasicCegarLoop]: trace histogram [94, 1, 1] [2018-07-25 08:52:04,659 INFO L415 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:04,659 INFO L82 PathProgramCache]: Analyzing trace with hash 443755655, now seen corresponding path program 94 times [2018-07-25 08:52:04,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:05,605 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:05,605 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 08:52:05,605 INFO L451 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-25 08:52:05,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-25 08:52:05,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 08:52:05,606 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 97 states. [2018-07-25 08:52:06,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:06,587 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 08:52:06,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 08:52:06,588 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 96 [2018-07-25 08:52:06,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:06,588 INFO L225 Difference]: With dead ends: 99 [2018-07-25 08:52:06,588 INFO L226 Difference]: Without dead ends: 98 [2018-07-25 08:52:06,589 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 08:52:06,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-25 08:52:06,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-07-25 08:52:06,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-25 08:52:06,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-07-25 08:52:06,708 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-07-25 08:52:06,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:06,709 INFO L472 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-07-25 08:52:06,709 INFO L473 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-25 08:52:06,709 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-07-25 08:52:06,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-07-25 08:52:06,709 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:06,709 INFO L354 BasicCegarLoop]: trace histogram [95, 1, 1] [2018-07-25 08:52:06,710 INFO L415 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:06,710 INFO L82 PathProgramCache]: Analyzing trace with hash 871523361, now seen corresponding path program 95 times [2018-07-25 08:52:06,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:07,578 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:07,578 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-25 08:52:07,578 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 08:52:07,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 08:52:07,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 08:52:07,579 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 98 states. [2018-07-25 08:52:08,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:08,525 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-07-25 08:52:08,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 08:52:08,525 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 97 [2018-07-25 08:52:08,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:08,526 INFO L225 Difference]: With dead ends: 100 [2018-07-25 08:52:08,526 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 08:52:08,527 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 08:52:08,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 08:52:08,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 08:52:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 08:52:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-25 08:52:08,603 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-07-25 08:52:08,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:08,603 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-25 08:52:08,603 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 08:52:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-25 08:52:08,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 08:52:08,603 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:08,604 INFO L354 BasicCegarLoop]: trace histogram [96, 1, 1] [2018-07-25 08:52:08,604 INFO L415 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:08,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420359, now seen corresponding path program 96 times [2018-07-25 08:52:08,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:09,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:09,442 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:09,442 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 08:52:09,442 INFO L451 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-25 08:52:09,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-25 08:52:09,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 08:52:09,443 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 99 states. [2018-07-25 08:52:10,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:10,599 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-25 08:52:10,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 08:52:10,600 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 98 [2018-07-25 08:52:10,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:10,600 INFO L225 Difference]: With dead ends: 101 [2018-07-25 08:52:10,601 INFO L226 Difference]: Without dead ends: 100 [2018-07-25 08:52:10,602 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 08:52:10,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-25 08:52:10,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-07-25 08:52:10,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-25 08:52:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-07-25 08:52:10,741 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-07-25 08:52:10,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:10,742 INFO L472 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-07-25 08:52:10,742 INFO L473 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-25 08:52:10,742 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-07-25 08:52:10,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-07-25 08:52:10,742 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:10,743 INFO L354 BasicCegarLoop]: trace histogram [97, 1, 1] [2018-07-25 08:52:10,743 INFO L415 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:10,743 INFO L82 PathProgramCache]: Analyzing trace with hash 15325409, now seen corresponding path program 97 times [2018-07-25 08:52:10,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:11,691 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:11,692 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-25 08:52:11,692 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 08:52:11,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 08:52:11,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 08:52:11,693 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 100 states. [2018-07-25 08:52:12,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:12,741 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-07-25 08:52:12,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 08:52:12,741 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 99 [2018-07-25 08:52:12,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:12,742 INFO L225 Difference]: With dead ends: 102 [2018-07-25 08:52:12,742 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 08:52:12,743 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 08:52:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 08:52:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 08:52:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 08:52:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-25 08:52:12,827 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-07-25 08:52:12,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:12,827 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-25 08:52:12,827 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 08:52:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-25 08:52:12,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 08:52:12,827 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:12,828 INFO L354 BasicCegarLoop]: trace histogram [98, 1, 1] [2018-07-25 08:52:12,828 INFO L415 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:12,828 INFO L82 PathProgramCache]: Analyzing trace with hash 475087623, now seen corresponding path program 98 times [2018-07-25 08:52:12,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:13,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:13,732 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:13,732 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 08:52:13,732 INFO L451 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-25 08:52:13,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-25 08:52:13,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 08:52:13,733 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 101 states. [2018-07-25 08:52:14,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:14,760 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-25 08:52:14,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 08:52:14,761 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 100 [2018-07-25 08:52:14,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:14,761 INFO L225 Difference]: With dead ends: 103 [2018-07-25 08:52:14,761 INFO L226 Difference]: Without dead ends: 102 [2018-07-25 08:52:14,762 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 08:52:14,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-25 08:52:14,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-07-25 08:52:14,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-07-25 08:52:14,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-07-25 08:52:14,906 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-07-25 08:52:14,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:14,906 INFO L472 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-07-25 08:52:14,906 INFO L473 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-25 08:52:14,906 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-07-25 08:52:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-07-25 08:52:14,907 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:14,907 INFO L354 BasicCegarLoop]: trace histogram [99, 1, 1] [2018-07-25 08:52:14,907 INFO L415 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:14,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814369, now seen corresponding path program 99 times [2018-07-25 08:52:14,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:15,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:15,980 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:15,980 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-25 08:52:15,980 INFO L451 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-25 08:52:15,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-25 08:52:15,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 08:52:15,981 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 102 states. [2018-07-25 08:52:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:16,984 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-07-25 08:52:16,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 08:52:16,985 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 101 [2018-07-25 08:52:16,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:16,985 INFO L225 Difference]: With dead ends: 104 [2018-07-25 08:52:16,985 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 08:52:16,986 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 08:52:16,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 08:52:17,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 08:52:17,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 08:52:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-25 08:52:17,070 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-07-25 08:52:17,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:17,070 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-25 08:52:17,070 INFO L473 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-25 08:52:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-25 08:52:17,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 08:52:17,071 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:17,071 INFO L354 BasicCegarLoop]: trace histogram [100, 1, 1] [2018-07-25 08:52:17,071 INFO L415 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:17,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670535, now seen corresponding path program 100 times [2018-07-25 08:52:17,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:18,195 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:18,195 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-25 08:52:18,195 INFO L451 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-25 08:52:18,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-25 08:52:18,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 08:52:18,196 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 103 states. [2018-07-25 08:52:19,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:19,233 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-25 08:52:19,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-25 08:52:19,233 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 102 [2018-07-25 08:52:19,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:19,233 INFO L225 Difference]: With dead ends: 105 [2018-07-25 08:52:19,233 INFO L226 Difference]: Without dead ends: 104 [2018-07-25 08:52:19,234 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 08:52:19,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-25 08:52:19,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-25 08:52:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-25 08:52:19,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-07-25 08:52:19,317 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-07-25 08:52:19,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:19,317 INFO L472 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-07-25 08:52:19,317 INFO L473 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-25 08:52:19,317 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-07-25 08:52:19,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-07-25 08:52:19,317 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:19,318 INFO L354 BasicCegarLoop]: trace histogram [101, 1, 1] [2018-07-25 08:52:19,318 INFO L415 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:19,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080865, now seen corresponding path program 101 times [2018-07-25 08:52:19,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:20,323 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:20,323 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-25 08:52:20,323 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 08:52:20,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 08:52:20,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 08:52:20,324 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 104 states. [2018-07-25 08:52:21,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:21,350 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-07-25 08:52:21,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 08:52:21,350 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 103 [2018-07-25 08:52:21,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:21,351 INFO L225 Difference]: With dead ends: 106 [2018-07-25 08:52:21,351 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 08:52:21,352 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 08:52:21,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 08:52:21,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 08:52:21,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 08:52:21,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-25 08:52:21,440 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-07-25 08:52:21,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:21,440 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-25 08:52:21,440 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 08:52:21,441 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-25 08:52:21,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 08:52:21,441 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:21,441 INFO L354 BasicCegarLoop]: trace histogram [102, 1, 1] [2018-07-25 08:52:21,441 INFO L415 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:21,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833799, now seen corresponding path program 102 times [2018-07-25 08:52:21,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:22,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:22,342 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:22,342 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 08:52:22,342 INFO L451 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-25 08:52:22,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-25 08:52:22,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 08:52:22,344 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 105 states. [2018-07-25 08:52:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:23,425 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-25 08:52:23,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-25 08:52:23,426 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 104 [2018-07-25 08:52:23,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:23,427 INFO L225 Difference]: With dead ends: 107 [2018-07-25 08:52:23,427 INFO L226 Difference]: Without dead ends: 106 [2018-07-25 08:52:23,428 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 08:52:23,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-25 08:52:23,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-07-25 08:52:23,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-07-25 08:52:23,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-07-25 08:52:23,518 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-07-25 08:52:23,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:23,518 INFO L472 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-07-25 08:52:23,518 INFO L473 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-25 08:52:23,518 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-07-25 08:52:23,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-07-25 08:52:23,519 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:23,519 INFO L354 BasicCegarLoop]: trace histogram [103, 1, 1] [2018-07-25 08:52:23,519 INFO L415 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:23,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076641, now seen corresponding path program 103 times [2018-07-25 08:52:23,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:24,492 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:24,492 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-25 08:52:24,492 INFO L451 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-25 08:52:24,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-25 08:52:24,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 08:52:24,494 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 106 states. [2018-07-25 08:52:25,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:25,581 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-07-25 08:52:25,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-25 08:52:25,581 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 105 [2018-07-25 08:52:25,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:25,582 INFO L225 Difference]: With dead ends: 108 [2018-07-25 08:52:25,582 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 08:52:25,583 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 08:52:25,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 08:52:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 08:52:25,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 08:52:25,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-25 08:52:25,670 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-07-25 08:52:25,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:25,670 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-25 08:52:25,670 INFO L473 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-25 08:52:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-25 08:52:25,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 08:52:25,671 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:25,671 INFO L354 BasicCegarLoop]: trace histogram [104, 1, 1] [2018-07-25 08:52:25,671 INFO L415 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:25,671 INFO L82 PathProgramCache]: Analyzing trace with hash 748670151, now seen corresponding path program 104 times [2018-07-25 08:52:25,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:26,624 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:26,624 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-25 08:52:26,624 INFO L451 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-25 08:52:26,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-25 08:52:26,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 08:52:26,625 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 107 states. [2018-07-25 08:52:27,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:27,727 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-25 08:52:27,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-25 08:52:27,727 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 106 [2018-07-25 08:52:27,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:27,727 INFO L225 Difference]: With dead ends: 109 [2018-07-25 08:52:27,727 INFO L226 Difference]: Without dead ends: 108 [2018-07-25 08:52:27,728 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 08:52:27,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-07-25 08:52:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-07-25 08:52:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-07-25 08:52:27,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-07-25 08:52:27,817 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-07-25 08:52:27,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:27,818 INFO L472 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-07-25 08:52:27,818 INFO L473 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-25 08:52:27,818 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-07-25 08:52:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-07-25 08:52:27,818 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:27,818 INFO L354 BasicCegarLoop]: trace histogram [105, 1, 1] [2018-07-25 08:52:27,818 INFO L415 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:27,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938145, now seen corresponding path program 105 times [2018-07-25 08:52:27,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:28,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:28,874 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:28,874 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-25 08:52:28,875 INFO L451 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-25 08:52:28,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-25 08:52:28,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 08:52:28,876 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 108 states. [2018-07-25 08:52:29,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:29,953 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-07-25 08:52:29,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-25 08:52:29,954 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 107 [2018-07-25 08:52:29,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:29,954 INFO L225 Difference]: With dead ends: 110 [2018-07-25 08:52:29,954 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 08:52:29,955 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 08:52:29,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 08:52:30,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 08:52:30,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 08:52:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-25 08:52:30,048 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-07-25 08:52:30,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:30,048 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-25 08:52:30,048 INFO L473 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-25 08:52:30,048 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-25 08:52:30,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 08:52:30,048 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:30,049 INFO L354 BasicCegarLoop]: trace histogram [106, 1, 1] [2018-07-25 08:52:30,049 INFO L415 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:30,049 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492409, now seen corresponding path program 106 times [2018-07-25 08:52:30,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:31,019 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:31,019 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-25 08:52:31,019 INFO L451 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-25 08:52:31,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-25 08:52:31,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 08:52:31,020 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 109 states. [2018-07-25 08:52:32,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:32,187 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-25 08:52:32,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-25 08:52:32,188 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 108 [2018-07-25 08:52:32,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:32,188 INFO L225 Difference]: With dead ends: 111 [2018-07-25 08:52:32,188 INFO L226 Difference]: Without dead ends: 110 [2018-07-25 08:52:32,189 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 08:52:32,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-07-25 08:52:32,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-07-25 08:52:32,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-07-25 08:52:32,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-07-25 08:52:32,291 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-07-25 08:52:32,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:32,291 INFO L472 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-07-25 08:52:32,291 INFO L473 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-25 08:52:32,291 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-07-25 08:52:32,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-07-25 08:52:32,292 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:32,292 INFO L354 BasicCegarLoop]: trace histogram [107, 1, 1] [2018-07-25 08:52:32,292 INFO L415 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:32,292 INFO L82 PathProgramCache]: Analyzing trace with hash -132755295, now seen corresponding path program 107 times [2018-07-25 08:52:32,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:33,293 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:33,293 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-25 08:52:33,293 INFO L451 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-25 08:52:33,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-25 08:52:33,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 08:52:33,294 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 110 states. [2018-07-25 08:52:34,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:34,508 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-07-25 08:52:34,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-25 08:52:34,509 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 109 [2018-07-25 08:52:34,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:34,509 INFO L225 Difference]: With dead ends: 112 [2018-07-25 08:52:34,509 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 08:52:34,510 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 08:52:34,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 08:52:34,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 08:52:34,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 08:52:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-25 08:52:34,617 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-07-25 08:52:34,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:34,618 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-25 08:52:34,618 INFO L473 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-25 08:52:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-25 08:52:34,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 08:52:34,618 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:34,618 INFO L354 BasicCegarLoop]: trace histogram [108, 1, 1] [2018-07-25 08:52:34,619 INFO L415 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:34,619 INFO L82 PathProgramCache]: Analyzing trace with hash 179553095, now seen corresponding path program 108 times [2018-07-25 08:52:34,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:35,751 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:35,751 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-25 08:52:35,751 INFO L451 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-25 08:52:35,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-25 08:52:35,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 08:52:35,753 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 111 states. [2018-07-25 08:52:37,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:37,064 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-25 08:52:37,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-25 08:52:37,065 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 110 [2018-07-25 08:52:37,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:37,065 INFO L225 Difference]: With dead ends: 113 [2018-07-25 08:52:37,065 INFO L226 Difference]: Without dead ends: 112 [2018-07-25 08:52:37,066 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 08:52:37,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-07-25 08:52:37,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-07-25 08:52:37,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-07-25 08:52:37,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-07-25 08:52:37,177 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-07-25 08:52:37,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:37,178 INFO L472 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-07-25 08:52:37,178 INFO L473 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-25 08:52:37,178 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-07-25 08:52:37,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-07-25 08:52:37,178 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:37,178 INFO L354 BasicCegarLoop]: trace histogram [109, 1, 1] [2018-07-25 08:52:37,179 INFO L415 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:37,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178593, now seen corresponding path program 109 times [2018-07-25 08:52:37,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:38,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:38,360 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:38,360 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-25 08:52:38,361 INFO L451 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-25 08:52:38,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-25 08:52:38,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 08:52:38,362 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 112 states. [2018-07-25 08:52:39,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:39,687 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-07-25 08:52:39,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-25 08:52:39,687 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 111 [2018-07-25 08:52:39,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:39,687 INFO L225 Difference]: With dead ends: 114 [2018-07-25 08:52:39,687 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 08:52:39,688 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 08:52:39,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 08:52:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 08:52:39,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 08:52:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-25 08:52:39,799 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-07-25 08:52:39,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:39,799 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-25 08:52:39,799 INFO L473 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-25 08:52:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-25 08:52:39,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 08:52:39,800 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:39,800 INFO L354 BasicCegarLoop]: trace histogram [110, 1, 1] [2018-07-25 08:52:39,800 INFO L415 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:39,800 INFO L82 PathProgramCache]: Analyzing trace with hash 751830663, now seen corresponding path program 110 times [2018-07-25 08:52:39,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:41,015 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:41,015 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-25 08:52:41,015 INFO L451 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-25 08:52:41,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-25 08:52:41,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 08:52:41,016 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 113 states. [2018-07-25 08:52:42,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:42,365 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-25 08:52:42,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-25 08:52:42,365 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 112 [2018-07-25 08:52:42,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:42,366 INFO L225 Difference]: With dead ends: 115 [2018-07-25 08:52:42,366 INFO L226 Difference]: Without dead ends: 114 [2018-07-25 08:52:42,366 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 08:52:42,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-07-25 08:52:42,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-07-25 08:52:42,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-07-25 08:52:42,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-07-25 08:52:42,480 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-07-25 08:52:42,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:42,480 INFO L472 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-07-25 08:52:42,480 INFO L473 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-25 08:52:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-07-25 08:52:42,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-07-25 08:52:42,481 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:42,481 INFO L354 BasicCegarLoop]: trace histogram [111, 1, 1] [2018-07-25 08:52:42,481 INFO L415 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:42,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914017, now seen corresponding path program 111 times [2018-07-25 08:52:42,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:43,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:43,665 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:43,665 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-25 08:52:43,665 INFO L451 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-25 08:52:43,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-25 08:52:43,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 08:52:43,667 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 114 states. [2018-07-25 08:52:45,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:45,032 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-07-25 08:52:45,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-25 08:52:45,033 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 113 [2018-07-25 08:52:45,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:45,033 INFO L225 Difference]: With dead ends: 116 [2018-07-25 08:52:45,033 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 08:52:45,034 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 08:52:45,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 08:52:45,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 08:52:45,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 08:52:45,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-25 08:52:45,148 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-07-25 08:52:45,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:45,148 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-25 08:52:45,148 INFO L473 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-25 08:52:45,149 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-25 08:52:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 08:52:45,149 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:45,149 INFO L354 BasicCegarLoop]: trace histogram [112, 1, 1] [2018-07-25 08:52:45,149 INFO L415 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:45,150 INFO L82 PathProgramCache]: Analyzing trace with hash 954759623, now seen corresponding path program 112 times [2018-07-25 08:52:45,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:46,408 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:46,408 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-25 08:52:46,408 INFO L451 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-25 08:52:46,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-25 08:52:46,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 08:52:46,409 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 115 states. [2018-07-25 08:52:47,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:47,731 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-25 08:52:47,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-25 08:52:47,731 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 114 [2018-07-25 08:52:47,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:47,732 INFO L225 Difference]: With dead ends: 117 [2018-07-25 08:52:47,732 INFO L226 Difference]: Without dead ends: 116 [2018-07-25 08:52:47,732 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 08:52:47,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-07-25 08:52:47,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-07-25 08:52:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-07-25 08:52:47,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-07-25 08:52:47,848 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-07-25 08:52:47,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:47,848 INFO L472 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-07-25 08:52:47,848 INFO L473 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-25 08:52:47,848 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-07-25 08:52:47,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-07-25 08:52:47,849 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:47,849 INFO L354 BasicCegarLoop]: trace histogram [113, 1, 1] [2018-07-25 08:52:47,849 INFO L415 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:47,849 INFO L82 PathProgramCache]: Analyzing trace with hash -467222815, now seen corresponding path program 113 times [2018-07-25 08:52:47,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:49,090 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:49,090 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-25 08:52:49,091 INFO L451 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-25 08:52:49,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-25 08:52:49,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 08:52:49,092 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 116 states. [2018-07-25 08:52:50,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:50,538 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-07-25 08:52:50,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-25 08:52:50,539 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 115 [2018-07-25 08:52:50,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:50,539 INFO L225 Difference]: With dead ends: 118 [2018-07-25 08:52:50,539 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 08:52:50,541 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 08:52:50,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 08:52:50,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 08:52:50,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 08:52:50,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-25 08:52:50,661 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2018-07-25 08:52:50,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:50,662 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-25 08:52:50,662 INFO L473 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-25 08:52:50,662 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-25 08:52:50,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 08:52:50,662 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:50,662 INFO L354 BasicCegarLoop]: trace histogram [114, 1, 1] [2018-07-25 08:52:50,662 INFO L415 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:50,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1599005433, now seen corresponding path program 114 times [2018-07-25 08:52:50,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:51,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:51,789 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:51,789 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-25 08:52:51,790 INFO L451 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-25 08:52:51,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-25 08:52:51,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 08:52:51,791 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 117 states. [2018-07-25 08:52:53,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:53,071 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-25 08:52:53,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-25 08:52:53,071 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 116 [2018-07-25 08:52:53,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:53,072 INFO L225 Difference]: With dead ends: 119 [2018-07-25 08:52:53,072 INFO L226 Difference]: Without dead ends: 118 [2018-07-25 08:52:53,073 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 08:52:53,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-07-25 08:52:53,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-07-25 08:52:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-07-25 08:52:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-07-25 08:52:53,181 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2018-07-25 08:52:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:53,182 INFO L472 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-07-25 08:52:53,182 INFO L473 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-25 08:52:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-07-25 08:52:53,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-07-25 08:52:53,182 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:53,182 INFO L354 BasicCegarLoop]: trace histogram [115, 1, 1] [2018-07-25 08:52:53,182 INFO L415 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:53,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1970439073, now seen corresponding path program 115 times [2018-07-25 08:52:53,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:54,322 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:54,322 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-25 08:52:54,322 INFO L451 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-25 08:52:54,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-25 08:52:54,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 08:52:54,323 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 118 states. [2018-07-25 08:52:55,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:55,639 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-07-25 08:52:55,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 08:52:55,639 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 117 [2018-07-25 08:52:55,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:55,640 INFO L225 Difference]: With dead ends: 120 [2018-07-25 08:52:55,640 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 08:52:55,640 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 08:52:55,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 08:52:55,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 08:52:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 08:52:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-25 08:52:55,750 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2018-07-25 08:52:55,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:55,750 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-25 08:52:55,750 INFO L473 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-25 08:52:55,750 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-25 08:52:55,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 08:52:55,751 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:55,751 INFO L354 BasicCegarLoop]: trace histogram [116, 1, 1] [2018-07-25 08:52:55,751 INFO L415 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:55,751 INFO L82 PathProgramCache]: Analyzing trace with hash 954069063, now seen corresponding path program 116 times [2018-07-25 08:52:55,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:56,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:56,899 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:56,899 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-25 08:52:56,899 INFO L451 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-25 08:52:56,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-25 08:52:56,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 08:52:56,900 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 119 states. [2018-07-25 08:52:58,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:58,266 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-25 08:52:58,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-25 08:52:58,266 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 118 [2018-07-25 08:52:58,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:58,266 INFO L225 Difference]: With dead ends: 121 [2018-07-25 08:52:58,267 INFO L226 Difference]: Without dead ends: 120 [2018-07-25 08:52:58,268 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 08:52:58,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-07-25 08:52:58,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-07-25 08:52:58,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-07-25 08:52:58,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-07-25 08:52:58,414 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2018-07-25 08:52:58,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:58,415 INFO L472 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-07-25 08:52:58,415 INFO L473 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-25 08:52:58,415 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-07-25 08:52:58,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-07-25 08:52:58,416 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:58,416 INFO L354 BasicCegarLoop]: trace histogram [117, 1, 1] [2018-07-25 08:52:58,416 INFO L415 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:58,416 INFO L82 PathProgramCache]: Analyzing trace with hash -488630175, now seen corresponding path program 117 times [2018-07-25 08:52:58,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:59,606 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:59,606 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-25 08:52:59,606 INFO L451 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-25 08:52:59,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-25 08:52:59,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 08:52:59,607 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 120 states. [2018-07-25 08:53:00,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:00,975 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-07-25 08:53:00,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-25 08:53:00,975 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 119 [2018-07-25 08:53:00,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:00,976 INFO L225 Difference]: With dead ends: 122 [2018-07-25 08:53:00,976 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 08:53:00,977 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 08:53:00,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 08:53:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 08:53:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 08:53:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-25 08:53:01,101 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2018-07-25 08:53:01,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:01,101 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-25 08:53:01,101 INFO L473 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-25 08:53:01,101 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-25 08:53:01,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 08:53:01,102 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:01,102 INFO L354 BasicCegarLoop]: trace histogram [118, 1, 1] [2018-07-25 08:53:01,103 INFO L415 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:01,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2032333703, now seen corresponding path program 118 times [2018-07-25 08:53:01,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:02,366 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:02,366 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-25 08:53:02,367 INFO L451 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-07-25 08:53:02,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-07-25 08:53:02,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 08:53:02,368 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 121 states. [2018-07-25 08:53:03,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:03,723 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-25 08:53:03,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-25 08:53:03,723 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 120 [2018-07-25 08:53:03,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:03,723 INFO L225 Difference]: With dead ends: 123 [2018-07-25 08:53:03,723 INFO L226 Difference]: Without dead ends: 122 [2018-07-25 08:53:03,724 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 08:53:03,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-25 08:53:03,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-07-25 08:53:03,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-07-25 08:53:03,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-07-25 08:53:03,839 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2018-07-25 08:53:03,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:03,839 INFO L472 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-07-25 08:53:03,839 INFO L473 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-07-25 08:53:03,839 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-07-25 08:53:03,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-07-25 08:53:03,839 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:03,839 INFO L354 BasicCegarLoop]: trace histogram [119, 1, 1] [2018-07-25 08:53:03,840 INFO L415 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:03,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1422164703, now seen corresponding path program 119 times [2018-07-25 08:53:03,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:05,057 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:05,057 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-07-25 08:53:05,057 INFO L451 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-25 08:53:05,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-25 08:53:05,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 08:53:05,058 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 122 states. [2018-07-25 08:53:06,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:06,505 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-07-25 08:53:06,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 08:53:06,505 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 121 [2018-07-25 08:53:06,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:06,506 INFO L225 Difference]: With dead ends: 124 [2018-07-25 08:53:06,506 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 08:53:06,507 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 08:53:06,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 08:53:06,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 08:53:06,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 08:53:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-25 08:53:06,624 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 121 [2018-07-25 08:53:06,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:06,624 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-25 08:53:06,624 INFO L473 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-25 08:53:06,625 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-25 08:53:06,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 08:53:06,625 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:06,625 INFO L354 BasicCegarLoop]: trace histogram [120, 1, 1] [2018-07-25 08:53:06,625 INFO L415 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:06,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1137432889, now seen corresponding path program 120 times [2018-07-25 08:53:06,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:07,860 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:07,861 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-25 08:53:07,861 INFO L451 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-07-25 08:53:07,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-07-25 08:53:07,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 08:53:07,862 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 123 states. [2018-07-25 08:53:09,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:09,283 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-25 08:53:09,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-25 08:53:09,283 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 122 [2018-07-25 08:53:09,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:09,284 INFO L225 Difference]: With dead ends: 125 [2018-07-25 08:53:09,284 INFO L226 Difference]: Without dead ends: 124 [2018-07-25 08:53:09,285 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 08:53:09,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-07-25 08:53:09,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-07-25 08:53:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-07-25 08:53:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-07-25 08:53:09,406 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 122 [2018-07-25 08:53:09,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:09,406 INFO L472 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-07-25 08:53:09,406 INFO L473 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-07-25 08:53:09,406 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-07-25 08:53:09,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-07-25 08:53:09,406 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:09,406 INFO L354 BasicCegarLoop]: trace histogram [121, 1, 1] [2018-07-25 08:53:09,407 INFO L415 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:09,407 INFO L82 PathProgramCache]: Analyzing trace with hash -900681247, now seen corresponding path program 121 times [2018-07-25 08:53:09,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:10,685 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:10,685 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-07-25 08:53:10,685 INFO L451 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-25 08:53:10,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-25 08:53:10,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 08:53:10,686 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 124 states. [2018-07-25 08:53:12,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:12,132 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-07-25 08:53:12,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-25 08:53:12,132 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 123 [2018-07-25 08:53:12,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:12,132 INFO L225 Difference]: With dead ends: 126 [2018-07-25 08:53:12,132 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 08:53:12,133 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 08:53:12,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 08:53:12,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 08:53:12,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 08:53:12,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-25 08:53:12,253 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 123 [2018-07-25 08:53:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:12,253 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-25 08:53:12,253 INFO L473 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-25 08:53:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-25 08:53:12,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 08:53:12,254 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:12,254 INFO L354 BasicCegarLoop]: trace histogram [122, 1, 1] [2018-07-25 08:53:12,254 INFO L415 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:12,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2143652359, now seen corresponding path program 122 times [2018-07-25 08:53:12,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:13,541 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:13,541 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-25 08:53:13,541 INFO L451 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-07-25 08:53:13,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-07-25 08:53:13,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 08:53:13,542 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 125 states. [2018-07-25 08:53:14,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:14,987 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-25 08:53:14,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-25 08:53:14,988 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 124 [2018-07-25 08:53:14,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:14,988 INFO L225 Difference]: With dead ends: 127 [2018-07-25 08:53:14,988 INFO L226 Difference]: Without dead ends: 126 [2018-07-25 08:53:14,989 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 08:53:14,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-07-25 08:53:15,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-07-25 08:53:15,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-07-25 08:53:15,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-07-25 08:53:15,110 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 124 [2018-07-25 08:53:15,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:15,110 INFO L472 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-07-25 08:53:15,110 INFO L473 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-07-25 08:53:15,110 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-07-25 08:53:15,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-07-25 08:53:15,111 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:15,111 INFO L354 BasicCegarLoop]: trace histogram [123, 1, 1] [2018-07-25 08:53:15,111 INFO L415 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:15,111 INFO L82 PathProgramCache]: Analyzing trace with hash 2028713633, now seen corresponding path program 123 times [2018-07-25 08:53:15,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:16,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:16,406 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:16,406 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-07-25 08:53:16,407 INFO L451 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-25 08:53:16,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-25 08:53:16,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 08:53:16,408 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 126 states. [2018-07-25 08:53:17,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:17,955 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-07-25 08:53:17,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-25 08:53:17,955 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 125 [2018-07-25 08:53:17,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:17,956 INFO L225 Difference]: With dead ends: 128 [2018-07-25 08:53:17,956 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 08:53:17,957 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 08:53:17,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 08:53:18,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 08:53:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 08:53:18,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-25 08:53:18,112 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 125 [2018-07-25 08:53:18,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:18,112 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-25 08:53:18,112 INFO L473 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-25 08:53:18,112 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-25 08:53:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 08:53:18,112 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:18,112 INFO L354 BasicCegarLoop]: trace histogram [124, 1, 1] [2018-07-25 08:53:18,113 INFO L415 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:18,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1534386873, now seen corresponding path program 124 times [2018-07-25 08:53:18,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:19,386 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:19,386 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-25 08:53:19,386 INFO L451 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-07-25 08:53:19,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-07-25 08:53:19,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 08:53:19,387 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 127 states. [2018-07-25 08:53:20,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:20,921 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-25 08:53:20,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-25 08:53:20,921 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 126 [2018-07-25 08:53:20,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:20,922 INFO L225 Difference]: With dead ends: 129 [2018-07-25 08:53:20,922 INFO L226 Difference]: Without dead ends: 128 [2018-07-25 08:53:20,923 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 08:53:20,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-07-25 08:53:21,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-07-25 08:53:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-07-25 08:53:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-07-25 08:53:21,077 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 126 [2018-07-25 08:53:21,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:21,077 INFO L472 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-07-25 08:53:21,077 INFO L473 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-07-25 08:53:21,077 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-07-25 08:53:21,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-07-25 08:53:21,078 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:21,078 INFO L354 BasicCegarLoop]: trace histogram [125, 1, 1] [2018-07-25 08:53:21,078 INFO L415 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:21,079 INFO L82 PathProgramCache]: Analyzing trace with hash -321352863, now seen corresponding path program 125 times [2018-07-25 08:53:21,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:22,534 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:22,535 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:22,535 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-07-25 08:53:22,535 INFO L451 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-25 08:53:22,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-25 08:53:22,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 08:53:22,536 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 128 states. [2018-07-25 08:53:24,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:24,104 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-07-25 08:53:24,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-25 08:53:24,104 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 127 [2018-07-25 08:53:24,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:24,104 INFO L225 Difference]: With dead ends: 130 [2018-07-25 08:53:24,105 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 08:53:24,105 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 08:53:24,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 08:53:24,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 08:53:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 08:53:24,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-25 08:53:24,254 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 127 [2018-07-25 08:53:24,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:24,254 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-25 08:53:24,254 INFO L473 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-25 08:53:24,254 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-25 08:53:24,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 08:53:24,255 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:24,255 INFO L354 BasicCegarLoop]: trace histogram [126, 1, 1] [2018-07-25 08:53:24,255 INFO L415 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:24,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1372004217, now seen corresponding path program 126 times [2018-07-25 08:53:24,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:25,660 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:25,660 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:25,660 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-25 08:53:25,660 INFO L451 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-07-25 08:53:25,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-07-25 08:53:25,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 08:53:25,662 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 129 states. [2018-07-25 08:53:27,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:27,229 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-25 08:53:27,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-25 08:53:27,230 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 128 [2018-07-25 08:53:27,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:27,230 INFO L225 Difference]: With dead ends: 131 [2018-07-25 08:53:27,230 INFO L226 Difference]: Without dead ends: 130 [2018-07-25 08:53:27,231 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 08:53:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-07-25 08:53:27,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-07-25 08:53:27,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-07-25 08:53:27,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-07-25 08:53:27,359 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 128 [2018-07-25 08:53:27,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:27,359 INFO L472 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-07-25 08:53:27,359 INFO L473 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-07-25 08:53:27,360 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-07-25 08:53:27,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-07-25 08:53:27,360 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:27,360 INFO L354 BasicCegarLoop]: trace histogram [127, 1, 1] [2018-07-25 08:53:27,361 INFO L415 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:27,361 INFO L82 PathProgramCache]: Analyzing trace with hash 417542177, now seen corresponding path program 127 times [2018-07-25 08:53:27,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:28,829 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:28,829 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:28,829 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-07-25 08:53:28,830 INFO L451 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-25 08:53:28,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-25 08:53:28,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 08:53:28,831 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 130 states. [2018-07-25 08:53:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:30,486 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-07-25 08:53:30,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-25 08:53:30,486 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 129 [2018-07-25 08:53:30,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:30,487 INFO L225 Difference]: With dead ends: 132 [2018-07-25 08:53:30,487 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 08:53:30,488 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 08:53:30,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 08:53:30,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 08:53:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 08:53:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-25 08:53:30,619 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 129 [2018-07-25 08:53:30,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:30,620 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-25 08:53:30,620 INFO L473 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-25 08:53:30,620 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-25 08:53:30,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 08:53:30,620 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:30,620 INFO L354 BasicCegarLoop]: trace histogram [128, 1, 1] [2018-07-25 08:53:30,620 INFO L415 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:30,621 INFO L82 PathProgramCache]: Analyzing trace with hash 58905543, now seen corresponding path program 128 times [2018-07-25 08:53:30,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:31,995 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:31,996 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:31,996 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-25 08:53:31,996 INFO L451 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-07-25 08:53:31,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-07-25 08:53:31,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 08:53:31,998 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 131 states. [2018-07-25 08:53:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:33,650 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-25 08:53:33,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-25 08:53:33,650 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 130 [2018-07-25 08:53:33,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:33,651 INFO L225 Difference]: With dead ends: 133 [2018-07-25 08:53:33,651 INFO L226 Difference]: Without dead ends: 132 [2018-07-25 08:53:33,652 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 08:53:33,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-07-25 08:53:33,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-07-25 08:53:33,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-07-25 08:53:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-07-25 08:53:33,786 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 130 [2018-07-25 08:53:33,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:33,786 INFO L472 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-07-25 08:53:33,786 INFO L473 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-07-25 08:53:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-07-25 08:53:33,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-07-25 08:53:33,787 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:33,787 INFO L354 BasicCegarLoop]: trace histogram [129, 1, 1] [2018-07-25 08:53:33,787 INFO L415 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:33,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1826071777, now seen corresponding path program 129 times [2018-07-25 08:53:33,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:35,197 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:35,197 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:35,197 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-07-25 08:53:35,198 INFO L451 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-25 08:53:35,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-25 08:53:35,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 08:53:35,199 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 132 states. [2018-07-25 08:53:36,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:36,834 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-07-25 08:53:36,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-25 08:53:36,835 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 131 [2018-07-25 08:53:36,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:36,835 INFO L225 Difference]: With dead ends: 134 [2018-07-25 08:53:36,835 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 08:53:36,836 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 08:53:36,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 08:53:36,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 08:53:36,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 08:53:36,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-25 08:53:36,973 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 131 [2018-07-25 08:53:36,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:36,973 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-25 08:53:36,973 INFO L473 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-25 08:53:36,973 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-25 08:53:36,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 08:53:36,973 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:36,974 INFO L354 BasicCegarLoop]: trace histogram [130, 1, 1] [2018-07-25 08:53:36,974 INFO L415 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:36,974 INFO L82 PathProgramCache]: Analyzing trace with hash 773650183, now seen corresponding path program 130 times [2018-07-25 08:53:36,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:38,605 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:38,605 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:38,606 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-25 08:53:38,606 INFO L451 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-07-25 08:53:38,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-07-25 08:53:38,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 08:53:38,607 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 133 states. [2018-07-25 08:53:40,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:40,390 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-25 08:53:40,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-25 08:53:40,390 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 132 [2018-07-25 08:53:40,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:40,390 INFO L225 Difference]: With dead ends: 135 [2018-07-25 08:53:40,391 INFO L226 Difference]: Without dead ends: 134 [2018-07-25 08:53:40,391 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 08:53:40,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-07-25 08:53:40,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-07-25 08:53:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-07-25 08:53:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-07-25 08:53:40,548 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 132 [2018-07-25 08:53:40,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:40,548 INFO L472 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-07-25 08:53:40,548 INFO L473 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-07-25 08:53:40,548 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-07-25 08:53:40,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-07-25 08:53:40,549 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:40,549 INFO L354 BasicCegarLoop]: trace histogram [131, 1, 1] [2018-07-25 08:53:40,549 INFO L415 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:40,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1786648159, now seen corresponding path program 131 times [2018-07-25 08:53:40,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:42,218 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:42,218 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:42,218 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-07-25 08:53:42,219 INFO L451 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-25 08:53:42,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-25 08:53:42,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 08:53:42,220 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 134 states. [2018-07-25 08:53:44,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:44,066 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-07-25 08:53:44,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-25 08:53:44,066 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 133 [2018-07-25 08:53:44,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:44,067 INFO L225 Difference]: With dead ends: 136 [2018-07-25 08:53:44,067 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 08:53:44,067 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 08:53:44,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 08:53:44,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 08:53:44,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 08:53:44,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-25 08:53:44,226 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 133 [2018-07-25 08:53:44,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:44,227 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-25 08:53:44,227 INFO L473 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-25 08:53:44,227 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-25 08:53:44,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 08:53:44,227 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:44,227 INFO L354 BasicCegarLoop]: trace histogram [132, 1, 1] [2018-07-25 08:53:44,227 INFO L415 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:44,228 INFO L82 PathProgramCache]: Analyzing trace with hash 448481863, now seen corresponding path program 132 times [2018-07-25 08:53:44,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:45,897 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:45,897 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-25 08:53:45,897 INFO L451 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-07-25 08:53:45,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-07-25 08:53:45,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 08:53:45,898 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 135 states. [2018-07-25 08:53:47,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:47,703 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-25 08:53:47,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-07-25 08:53:47,703 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 134 [2018-07-25 08:53:47,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:47,704 INFO L225 Difference]: With dead ends: 137 [2018-07-25 08:53:47,704 INFO L226 Difference]: Without dead ends: 136 [2018-07-25 08:53:47,704 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 08:53:47,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-07-25 08:53:47,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-07-25 08:53:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-07-25 08:53:47,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-07-25 08:53:47,877 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 134 [2018-07-25 08:53:47,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:47,877 INFO L472 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-07-25 08:53:47,877 INFO L473 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-07-25 08:53:47,877 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-07-25 08:53:47,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-07-25 08:53:47,878 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:47,878 INFO L354 BasicCegarLoop]: trace histogram [133, 1, 1] [2018-07-25 08:53:47,878 INFO L415 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:47,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1018035809, now seen corresponding path program 133 times [2018-07-25 08:53:47,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:49,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:49,372 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:49,372 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-07-25 08:53:49,372 INFO L451 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-07-25 08:53:49,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-07-25 08:53:49,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 08:53:49,373 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 136 states. [2018-07-25 08:53:51,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:51,300 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-07-25 08:53:51,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-25 08:53:51,301 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 135 [2018-07-25 08:53:51,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:51,301 INFO L225 Difference]: With dead ends: 138 [2018-07-25 08:53:51,301 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 08:53:51,303 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 08:53:51,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 08:53:51,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 08:53:51,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 08:53:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-25 08:53:51,468 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 135 [2018-07-25 08:53:51,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:51,468 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-25 08:53:51,468 INFO L473 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-07-25 08:53:51,468 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-25 08:53:51,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 08:53:51,469 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:51,469 INFO L354 BasicCegarLoop]: trace histogram [134, 1, 1] [2018-07-25 08:53:51,469 INFO L415 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:51,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1494338951, now seen corresponding path program 134 times [2018-07-25 08:53:51,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:53,184 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:53,184 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-07-25 08:53:53,185 INFO L451 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-07-25 08:53:53,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-07-25 08:53:53,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 08:53:53,186 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 137 states. [2018-07-25 08:53:55,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:55,145 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-25 08:53:55,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-25 08:53:55,145 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 136 [2018-07-25 08:53:55,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:55,146 INFO L225 Difference]: With dead ends: 139 [2018-07-25 08:53:55,146 INFO L226 Difference]: Without dead ends: 138 [2018-07-25 08:53:55,147 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 08:53:55,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-07-25 08:53:55,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-07-25 08:53:55,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-07-25 08:53:55,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-07-25 08:53:55,313 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 136 [2018-07-25 08:53:55,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:55,314 INFO L472 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-07-25 08:53:55,314 INFO L473 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-07-25 08:53:55,314 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-07-25 08:53:55,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-07-25 08:53:55,314 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:55,314 INFO L354 BasicCegarLoop]: trace histogram [135, 1, 1] [2018-07-25 08:53:55,314 INFO L415 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:55,315 INFO L82 PathProgramCache]: Analyzing trace with hash -920132831, now seen corresponding path program 135 times [2018-07-25 08:53:55,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:57,104 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:57,104 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-07-25 08:53:57,104 INFO L451 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-07-25 08:53:57,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-07-25 08:53:57,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 08:53:57,105 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 138 states. [2018-07-25 08:53:59,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:59,092 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-07-25 08:53:59,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-25 08:53:59,093 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 137 [2018-07-25 08:53:59,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:59,093 INFO L225 Difference]: With dead ends: 140 [2018-07-25 08:53:59,093 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 08:53:59,094 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 08:53:59,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 08:53:59,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 08:53:59,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 08:53:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-25 08:53:59,262 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 137 [2018-07-25 08:53:59,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:59,263 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-25 08:53:59,263 INFO L473 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-07-25 08:53:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-25 08:53:59,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 08:53:59,263 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:59,263 INFO L354 BasicCegarLoop]: trace histogram [136, 1, 1] [2018-07-25 08:53:59,263 INFO L415 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:59,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1540653255, now seen corresponding path program 136 times [2018-07-25 08:53:59,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:00,899 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:00,899 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:00,900 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-07-25 08:54:00,900 INFO L451 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-07-25 08:54:00,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-07-25 08:54:00,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 08:54:00,901 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 139 states. [2018-07-25 08:54:02,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:02,723 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-25 08:54:02,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-07-25 08:54:02,723 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 138 [2018-07-25 08:54:02,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:02,724 INFO L225 Difference]: With dead ends: 141 [2018-07-25 08:54:02,724 INFO L226 Difference]: Without dead ends: 140 [2018-07-25 08:54:02,724 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 08:54:02,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-07-25 08:54:02,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-07-25 08:54:02,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-07-25 08:54:02,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-07-25 08:54:02,875 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 138 [2018-07-25 08:54:02,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:02,875 INFO L472 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-07-25 08:54:02,875 INFO L473 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-07-25 08:54:02,875 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-07-25 08:54:02,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-07-25 08:54:02,875 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:02,876 INFO L354 BasicCegarLoop]: trace histogram [137, 1, 1] [2018-07-25 08:54:02,876 INFO L415 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:02,876 INFO L82 PathProgramCache]: Analyzing trace with hash 515610593, now seen corresponding path program 137 times [2018-07-25 08:54:02,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:04,541 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:04,541 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-07-25 08:54:04,541 INFO L451 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-07-25 08:54:04,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-07-25 08:54:04,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 08:54:04,542 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 140 states. [2018-07-25 08:54:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:06,442 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-07-25 08:54:06,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-07-25 08:54:06,442 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 139 [2018-07-25 08:54:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:06,443 INFO L225 Difference]: With dead ends: 142 [2018-07-25 08:54:06,443 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 08:54:06,444 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 08:54:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 08:54:06,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 08:54:06,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 08:54:06,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-25 08:54:06,617 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 139 [2018-07-25 08:54:06,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:06,618 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-25 08:54:06,618 INFO L473 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-07-25 08:54:06,618 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-25 08:54:06,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 08:54:06,618 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:06,618 INFO L354 BasicCegarLoop]: trace histogram [138, 1, 1] [2018-07-25 08:54:06,618 INFO L415 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:06,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1195940857, now seen corresponding path program 138 times [2018-07-25 08:54:06,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:08,509 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:08,509 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-07-25 08:54:08,509 INFO L451 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-07-25 08:54:08,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-07-25 08:54:08,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 08:54:08,510 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 141 states. [2018-07-25 08:54:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:10,538 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-25 08:54:10,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-07-25 08:54:10,538 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 140 [2018-07-25 08:54:10,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:10,539 INFO L225 Difference]: With dead ends: 143 [2018-07-25 08:54:10,539 INFO L226 Difference]: Without dead ends: 142 [2018-07-25 08:54:10,539 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 08:54:10,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-07-25 08:54:10,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-07-25 08:54:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-07-25 08:54:10,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-07-25 08:54:10,714 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 140 [2018-07-25 08:54:10,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:10,714 INFO L472 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-07-25 08:54:10,714 INFO L473 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-07-25 08:54:10,715 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-07-25 08:54:10,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-07-25 08:54:10,715 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:10,715 INFO L354 BasicCegarLoop]: trace histogram [139, 1, 1] [2018-07-25 08:54:10,715 INFO L415 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:10,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1580539041, now seen corresponding path program 139 times [2018-07-25 08:54:10,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:12,545 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:12,546 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:12,546 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-07-25 08:54:12,546 INFO L451 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-07-25 08:54:12,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-07-25 08:54:12,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 08:54:12,547 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 142 states. [2018-07-25 08:54:14,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:14,634 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-07-25 08:54:14,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-07-25 08:54:14,634 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 141 [2018-07-25 08:54:14,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:14,634 INFO L225 Difference]: With dead ends: 144 [2018-07-25 08:54:14,634 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 08:54:14,635 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 08:54:14,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 08:54:14,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 08:54:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 08:54:14,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-25 08:54:14,833 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 141 [2018-07-25 08:54:14,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:14,833 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-25 08:54:14,833 INFO L473 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-07-25 08:54:14,833 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-25 08:54:14,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 08:54:14,833 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:14,833 INFO L354 BasicCegarLoop]: trace histogram [140, 1, 1] [2018-07-25 08:54:14,834 INFO L415 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:14,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1752069959, now seen corresponding path program 140 times [2018-07-25 08:54:14,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:16,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:16,707 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:16,707 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-07-25 08:54:16,707 INFO L451 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-07-25 08:54:16,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-07-25 08:54:16,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 08:54:16,709 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 143 states. [2018-07-25 08:54:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:18,799 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-25 08:54:18,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-07-25 08:54:18,799 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 142 [2018-07-25 08:54:18,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:18,800 INFO L225 Difference]: With dead ends: 145 [2018-07-25 08:54:18,800 INFO L226 Difference]: Without dead ends: 144 [2018-07-25 08:54:18,800 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 08:54:18,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-07-25 08:54:18,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-07-25 08:54:18,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-07-25 08:54:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-07-25 08:54:18,979 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 142 [2018-07-25 08:54:18,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:18,979 INFO L472 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-07-25 08:54:18,979 INFO L473 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-07-25 08:54:18,979 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-07-25 08:54:18,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-07-25 08:54:18,980 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:18,980 INFO L354 BasicCegarLoop]: trace histogram [141, 1, 1] [2018-07-25 08:54:18,980 INFO L415 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:18,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1520406175, now seen corresponding path program 141 times [2018-07-25 08:54:18,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:20,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:20,914 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:20,914 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-07-25 08:54:20,914 INFO L451 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-07-25 08:54:20,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-07-25 08:54:20,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 08:54:20,915 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 144 states. [2018-07-25 08:54:23,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:23,051 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-07-25 08:54:23,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-07-25 08:54:23,052 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 143 [2018-07-25 08:54:23,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:23,052 INFO L225 Difference]: With dead ends: 146 [2018-07-25 08:54:23,052 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 08:54:23,053 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 08:54:23,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 08:54:23,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 08:54:23,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 08:54:23,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-25 08:54:23,236 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 143 [2018-07-25 08:54:23,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:23,236 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-25 08:54:23,236 INFO L473 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-07-25 08:54:23,236 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-25 08:54:23,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 08:54:23,236 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:23,236 INFO L354 BasicCegarLoop]: trace histogram [142, 1, 1] [2018-07-25 08:54:23,237 INFO L415 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:23,237 INFO L82 PathProgramCache]: Analyzing trace with hash 112048775, now seen corresponding path program 142 times [2018-07-25 08:54:23,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:25,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:25,049 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:25,049 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-07-25 08:54:25,049 INFO L451 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-07-25 08:54:25,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-07-25 08:54:25,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 08:54:25,051 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 145 states. [2018-07-25 08:54:27,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:27,078 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-25 08:54:27,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-07-25 08:54:27,079 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 144 [2018-07-25 08:54:27,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:27,079 INFO L225 Difference]: With dead ends: 147 [2018-07-25 08:54:27,079 INFO L226 Difference]: Without dead ends: 146 [2018-07-25 08:54:27,080 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 08:54:27,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-07-25 08:54:27,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-07-25 08:54:27,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-07-25 08:54:27,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-07-25 08:54:27,264 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 144 [2018-07-25 08:54:27,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:27,264 INFO L472 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-07-25 08:54:27,264 INFO L473 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-07-25 08:54:27,264 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-07-25 08:54:27,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-07-25 08:54:27,265 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:27,265 INFO L354 BasicCegarLoop]: trace histogram [143, 1, 1] [2018-07-25 08:54:27,265 INFO L415 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:27,265 INFO L82 PathProgramCache]: Analyzing trace with hash -821455327, now seen corresponding path program 143 times [2018-07-25 08:54:27,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:29,148 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:29,148 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:29,148 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-07-25 08:54:29,148 INFO L451 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-07-25 08:54:29,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-07-25 08:54:29,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 08:54:29,150 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 146 states. [2018-07-25 08:54:31,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:31,122 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-07-25 08:54:31,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-07-25 08:54:31,122 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 145 [2018-07-25 08:54:31,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:31,123 INFO L225 Difference]: With dead ends: 148 [2018-07-25 08:54:31,123 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 08:54:31,123 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 08:54:31,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 08:54:31,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 08:54:31,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 08:54:31,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-25 08:54:31,290 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 145 [2018-07-25 08:54:31,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:31,290 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-25 08:54:31,290 INFO L473 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-07-25 08:54:31,290 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-25 08:54:31,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 08:54:31,291 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:31,291 INFO L354 BasicCegarLoop]: trace histogram [144, 1, 1] [2018-07-25 08:54:31,291 INFO L415 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:31,292 INFO L82 PathProgramCache]: Analyzing trace with hash 304688583, now seen corresponding path program 144 times [2018-07-25 08:54:31,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:33,075 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:33,076 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-07-25 08:54:33,076 INFO L451 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-07-25 08:54:33,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-07-25 08:54:33,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 08:54:33,077 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 147 states. [2018-07-25 08:54:35,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:35,278 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-25 08:54:35,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-07-25 08:54:35,278 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 146 [2018-07-25 08:54:35,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:35,278 INFO L225 Difference]: With dead ends: 149 [2018-07-25 08:54:35,279 INFO L226 Difference]: Without dead ends: 148 [2018-07-25 08:54:35,279 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 08:54:35,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-07-25 08:54:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-07-25 08:54:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-07-25 08:54:35,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-07-25 08:54:35,469 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 146 [2018-07-25 08:54:35,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:35,469 INFO L472 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-07-25 08:54:35,469 INFO L473 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-07-25 08:54:35,469 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-07-25 08:54:35,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-07-25 08:54:35,469 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:35,469 INFO L354 BasicCegarLoop]: trace histogram [145, 1, 1] [2018-07-25 08:54:35,470 INFO L415 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:35,470 INFO L82 PathProgramCache]: Analyzing trace with hash 855411425, now seen corresponding path program 145 times [2018-07-25 08:54:35,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:37,443 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:37,443 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-07-25 08:54:37,444 INFO L451 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-07-25 08:54:37,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-07-25 08:54:37,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 08:54:37,445 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 148 states. [2018-07-25 08:54:39,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:39,732 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-07-25 08:54:39,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-07-25 08:54:39,733 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 147 [2018-07-25 08:54:39,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:39,733 INFO L225 Difference]: With dead ends: 150 [2018-07-25 08:54:39,733 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 08:54:39,734 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 08:54:39,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 08:54:39,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 08:54:39,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 08:54:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-25 08:54:39,928 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 147 [2018-07-25 08:54:39,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:39,928 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-25 08:54:39,928 INFO L473 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-07-25 08:54:39,928 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-25 08:54:39,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 08:54:39,929 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:39,929 INFO L354 BasicCegarLoop]: trace histogram [146, 1, 1] [2018-07-25 08:54:39,929 INFO L415 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:39,929 INFO L82 PathProgramCache]: Analyzing trace with hash 747950343, now seen corresponding path program 146 times [2018-07-25 08:54:39,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:41,962 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:41,963 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-07-25 08:54:41,963 INFO L451 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-07-25 08:54:41,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-07-25 08:54:41,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 08:54:41,964 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 149 states. [2018-07-25 08:54:44,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:44,315 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-25 08:54:44,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-07-25 08:54:44,315 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 148 [2018-07-25 08:54:44,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:44,316 INFO L225 Difference]: With dead ends: 151 [2018-07-25 08:54:44,316 INFO L226 Difference]: Without dead ends: 150 [2018-07-25 08:54:44,317 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 08:54:44,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-25 08:54:44,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-07-25 08:54:44,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-07-25 08:54:44,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-07-25 08:54:44,520 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 148 [2018-07-25 08:54:44,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:44,520 INFO L472 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-07-25 08:54:44,520 INFO L473 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-07-25 08:54:44,520 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-07-25 08:54:44,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-07-25 08:54:44,520 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:44,520 INFO L354 BasicCegarLoop]: trace histogram [147, 1, 1] [2018-07-25 08:54:44,521 INFO L415 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:44,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1711624097, now seen corresponding path program 147 times [2018-07-25 08:54:44,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:46,618 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:46,618 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:46,618 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-07-25 08:54:46,618 INFO L451 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-07-25 08:54:46,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-07-25 08:54:46,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 08:54:46,619 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 150 states. [2018-07-25 08:54:48,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:48,907 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-07-25 08:54:48,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-07-25 08:54:48,908 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 149 [2018-07-25 08:54:48,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:48,908 INFO L225 Difference]: With dead ends: 152 [2018-07-25 08:54:48,908 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 08:54:48,909 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 08:54:48,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 08:54:49,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 08:54:49,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 08:54:49,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-25 08:54:49,107 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 149 [2018-07-25 08:54:49,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:49,107 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-25 08:54:49,107 INFO L473 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-07-25 08:54:49,107 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-25 08:54:49,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 08:54:49,108 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:49,108 INFO L354 BasicCegarLoop]: trace histogram [148, 1, 1] [2018-07-25 08:54:49,108 INFO L415 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:49,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1520739399, now seen corresponding path program 148 times [2018-07-25 08:54:49,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:51,135 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:51,136 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:51,136 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-07-25 08:54:51,136 INFO L451 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-07-25 08:54:51,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-07-25 08:54:51,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 08:54:51,138 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 151 states. [2018-07-25 08:54:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:53,305 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-25 08:54:53,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-07-25 08:54:53,305 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 150 [2018-07-25 08:54:53,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:53,306 INFO L225 Difference]: With dead ends: 153 [2018-07-25 08:54:53,306 INFO L226 Difference]: Without dead ends: 152 [2018-07-25 08:54:53,306 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 08:54:53,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-07-25 08:54:53,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-07-25 08:54:53,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-07-25 08:54:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-07-25 08:54:53,486 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 150 [2018-07-25 08:54:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:53,486 INFO L472 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-07-25 08:54:53,486 INFO L473 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-07-25 08:54:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-07-25 08:54:53,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-07-25 08:54:53,487 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:53,487 INFO L354 BasicCegarLoop]: trace histogram [149, 1, 1] [2018-07-25 08:54:53,487 INFO L415 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:53,487 INFO L82 PathProgramCache]: Analyzing trace with hash -101718943, now seen corresponding path program 149 times [2018-07-25 08:54:53,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:55,416 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:55,417 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:55,417 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-07-25 08:54:55,417 INFO L451 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-07-25 08:54:55,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-07-25 08:54:55,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 08:54:55,418 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 152 states. [2018-07-25 08:54:57,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:57,634 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-07-25 08:54:57,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-07-25 08:54:57,635 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 151 [2018-07-25 08:54:57,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:57,635 INFO L225 Difference]: With dead ends: 154 [2018-07-25 08:54:57,635 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 08:54:57,636 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 08:54:57,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 08:54:57,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 08:54:57,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 08:54:57,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-25 08:54:57,840 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 151 [2018-07-25 08:54:57,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:57,841 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-25 08:54:57,841 INFO L473 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-07-25 08:54:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-25 08:54:57,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 08:54:57,841 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:57,841 INFO L354 BasicCegarLoop]: trace histogram [150, 1, 1] [2018-07-25 08:54:57,841 INFO L415 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:57,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1141680007, now seen corresponding path program 150 times [2018-07-25 08:54:57,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:00,037 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:00,038 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-07-25 08:55:00,038 INFO L451 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-07-25 08:55:00,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-07-25 08:55:00,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 08:55:00,040 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 153 states. [2018-07-25 08:55:02,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:02,445 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-25 08:55:02,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-07-25 08:55:02,445 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 152 [2018-07-25 08:55:02,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:02,445 INFO L225 Difference]: With dead ends: 155 [2018-07-25 08:55:02,445 INFO L226 Difference]: Without dead ends: 154 [2018-07-25 08:55:02,446 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 08:55:02,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-07-25 08:55:02,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-07-25 08:55:02,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-07-25 08:55:02,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-07-25 08:55:02,652 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 152 [2018-07-25 08:55:02,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:02,652 INFO L472 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-07-25 08:55:02,652 INFO L473 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-07-25 08:55:02,652 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-07-25 08:55:02,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-07-25 08:55:02,652 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:02,652 INFO L354 BasicCegarLoop]: trace histogram [151, 1, 1] [2018-07-25 08:55:02,653 INFO L415 AbstractCegarLoop]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:02,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1032341793, now seen corresponding path program 151 times [2018-07-25 08:55:02,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:04,635 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:04,636 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:04,636 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-07-25 08:55:04,636 INFO L451 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-07-25 08:55:04,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-07-25 08:55:04,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 08:55:04,637 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 154 states. [2018-07-25 08:55:07,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:07,069 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-07-25 08:55:07,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-07-25 08:55:07,070 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 153 [2018-07-25 08:55:07,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:07,070 INFO L225 Difference]: With dead ends: 156 [2018-07-25 08:55:07,070 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 08:55:07,071 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 08:55:07,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 08:55:07,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-25 08:55:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-25 08:55:07,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-25 08:55:07,280 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 153 [2018-07-25 08:55:07,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:07,280 INFO L472 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-25 08:55:07,280 INFO L473 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-07-25 08:55:07,280 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-25 08:55:07,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-25 08:55:07,281 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:07,281 INFO L354 BasicCegarLoop]: trace histogram [152, 1, 1] [2018-07-25 08:55:07,281 INFO L415 AbstractCegarLoop]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:07,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1937824455, now seen corresponding path program 152 times [2018-07-25 08:55:07,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-07-25 08:55:07,938 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 08:55:07,945 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 08:55:07,946 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:55:07 BoogieIcfgContainer [2018-07-25 08:55:07,946 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:55:07,947 INFO L168 Benchmark]: Toolchain (without parser) took 257876.81 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 893.4 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 405.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-07-25 08:55:07,949 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:55:07,949 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:55:07,949 INFO L168 Benchmark]: Boogie Preprocessor took 19.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:55:07,950 INFO L168 Benchmark]: RCFGBuilder took 213.78 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-07-25 08:55:07,950 INFO L168 Benchmark]: TraceAbstraction took 257594.56 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 893.4 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 395.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-07-25 08:55:07,953 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.62 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 19.31 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 213.78 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 257594.56 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 893.4 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 395.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 155 with TraceHistMax 152, 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, 5 locations, 1 error locations. TIMEOUT Result, 257.5s OverallTime, 153 OverallIterations, 152 TraceHistogramMax, 127.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 304 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 1205438 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 88.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11628 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11628 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 100.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=152, 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: 11.6s AutomataMinimizationTime, 152 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 107.3s InterpolantComputationTime, 11780 NumberOfCodeBlocks, 11780 NumberOfCodeBlocksAsserted, 152 NumberOfCheckSat, 11628 ConstructedInterpolants, 0 QuantifiedInterpolants, 20745834 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 152 InterpolantComputations, 1 PerfectInterpolantSequences, 0/585276 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/DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_08-55-07-964.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-55-07-964.csv Completed graceful shutdown