java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:06:07,782 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:06:07,787 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:06:07,803 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:06:07,804 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:06:07,805 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:06:07,807 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:06:07,810 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:06:07,812 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:06:07,813 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:06:07,816 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:06:07,816 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:06:07,817 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:06:07,820 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:06:07,824 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:06:07,825 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:06:07,826 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:06:07,837 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:06:07,843 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:06:07,844 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:06:07,848 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:06:07,850 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:06:07,855 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:06:07,856 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:06:07,856 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:06:07,857 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:06:07,859 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:06:07,860 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:06:07,861 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:06:07,862 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:06:07,867 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:06:07,868 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:06:07,868 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:06:07,868 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:06:07,871 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:06:07,872 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:06:07,873 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:06:07,887 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:06:07,887 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:06:07,888 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:06:07,888 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:06:07,889 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:06:07,889 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:06:07,889 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:06:07,890 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:06:07,963 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:06:07,978 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:06:07,986 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:06:07,988 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:06:07,988 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:06:07,989 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl [2018-09-26 08:06:07,990 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2018-09-26 08:06:08,052 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:06:08,055 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:06:08,056 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:08,056 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:06:08,058 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:06:08,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:08" (1/1) ... [2018-09-26 08:06:08,096 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:08" (1/1) ... [2018-09-26 08:06:08,101 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:06:08,101 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:06:08,101 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:06:08,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:08,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:06:08,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:06:08,105 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:06:08,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:08" (1/1) ... [2018-09-26 08:06:08,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:08" (1/1) ... [2018-09-26 08:06:08,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:08" (1/1) ... [2018-09-26 08:06:08,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:08" (1/1) ... [2018-09-26 08:06:08,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:08" (1/1) ... [2018-09-26 08:06:08,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:08" (1/1) ... [2018-09-26 08:06:08,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:08" (1/1) ... [2018-09-26 08:06:08,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:06:08,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:06:08,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:06:08,130 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:06:08,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:08" (1/1) ... [2018-09-26 08:06:08,214 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-09-26 08:06:08,214 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-26 08:06:08,214 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-26 08:06:08,336 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:06:08,337 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:08 BoogieIcfgContainer [2018-09-26 08:06:08,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:06:08,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:06:08,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:06:08,342 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:06:08,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:08" (1/2) ... [2018-09-26 08:06:08,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfa01a0 and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:06:08, skipping insertion in model container [2018-09-26 08:06:08,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:08" (2/2) ... [2018-09-26 08:06:08,347 INFO L112 eAbstractionObserver]: Analyzing ICFG divisibilityWithArray.bpl [2018-09-26 08:06:08,357 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:06:08,366 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:06:08,415 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:06:08,416 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:06:08,416 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:06:08,416 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:06:08,416 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:06:08,417 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:06:08,417 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:06:08,417 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:06:08,417 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:06:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-09-26 08:06:08,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 08:06:08,443 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:08,444 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 08:06:08,445 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:08,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:08,452 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2018-09-26 08:06:08,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:08,723 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2018-09-26 08:06:08,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:08,764 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:08,765 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:06:08,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:06:08,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:06:08,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:06:08,786 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 4 states. [2018-09-26 08:06:08,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:08,834 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:06:08,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:06:08,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-09-26 08:06:08,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:08,846 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:06:08,847 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:06:08,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:06:08,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:06:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-09-26 08:06:08,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 08:06:08,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-26 08:06:08,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2018-09-26 08:06:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:08,890 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-26 08:06:08,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:06:08,890 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-26 08:06:08,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:06:08,891 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:08,891 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-26 08:06:08,891 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:08,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:08,892 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2018-09-26 08:06:08,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:09,171 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:09,173 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:06:09,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:09,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:09,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:09,176 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-09-26 08:06:09,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:09,249 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-26 08:06:09,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:06:09,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-09-26 08:06:09,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:09,250 INFO L225 Difference]: With dead ends: 10 [2018-09-26 08:06:09,252 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:06:09,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:09,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:06:09,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-09-26 08:06:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:06:09,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 08:06:09,259 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-09-26 08:06:09,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:09,259 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 08:06:09,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:09,259 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 08:06:09,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:06:09,260 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:09,260 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2018-09-26 08:06:09,260 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:09,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:09,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2018-09-26 08:06:09,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:09,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:09,411 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:09,411 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:06:09,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:09,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:09,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:09,412 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-09-26 08:06:09,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:09,481 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-26 08:06:09,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:06:09,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-09-26 08:06:09,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:09,486 INFO L225 Difference]: With dead ends: 12 [2018-09-26 08:06:09,486 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:06:09,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:09,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:06:09,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-09-26 08:06:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 08:06:09,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-26 08:06:09,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-09-26 08:06:09,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:09,501 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-26 08:06:09,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:09,501 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-26 08:06:09,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:06:09,502 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:09,502 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2018-09-26 08:06:09,502 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:09,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:09,503 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2018-09-26 08:06:09,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:09,732 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:09,732 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:09,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:09,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:09,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:09,734 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2018-09-26 08:06:09,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:09,776 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-26 08:06:09,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:06:09,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-26 08:06:09,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:09,778 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:06:09,778 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:06:09,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:09,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:06:09,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-09-26 08:06:09,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:06:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-26 08:06:09,787 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-09-26 08:06:09,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:09,788 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-26 08:06:09,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:09,788 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-26 08:06:09,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:06:09,789 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:09,789 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2018-09-26 08:06:09,789 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:09,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:09,790 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2018-09-26 08:06:09,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:09,915 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:09,915 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:09,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:09,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:09,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:09,917 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-09-26 08:06:09,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:09,970 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-26 08:06:09,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:06:09,971 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-09-26 08:06:09,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:09,972 INFO L225 Difference]: With dead ends: 16 [2018-09-26 08:06:09,972 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:06:09,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:09,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:06:09,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-09-26 08:06:09,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:06:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-26 08:06:09,981 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-09-26 08:06:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:09,981 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-26 08:06:09,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-26 08:06:09,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:09,982 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:09,983 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2018-09-26 08:06:09,983 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:09,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:09,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2018-09-26 08:06:09,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:10,110 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:10,111 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:10,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:10,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:06:10,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:06:10,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:10,114 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 10 states. [2018-09-26 08:06:10,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:10,201 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-26 08:06:10,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:10,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-09-26 08:06:10,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:10,202 INFO L225 Difference]: With dead ends: 18 [2018-09-26 08:06:10,203 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:06:10,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:10,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:06:10,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-09-26 08:06:10,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:06:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-26 08:06:10,220 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-09-26 08:06:10,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:10,221 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-26 08:06:10,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:06:10,221 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-26 08:06:10,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:10,222 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:10,222 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2018-09-26 08:06:10,224 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:10,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:10,225 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2018-09-26 08:06:10,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:10,413 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:10,414 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:10,414 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:06:10,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:06:10,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:06:10,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:10,416 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 11 states. [2018-09-26 08:06:10,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:10,515 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-26 08:06:10,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:10,516 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-09-26 08:06:10,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:10,517 INFO L225 Difference]: With dead ends: 20 [2018-09-26 08:06:10,517 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:06:10,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:10,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:06:10,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-09-26 08:06:10,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-26 08:06:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-26 08:06:10,529 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-09-26 08:06:10,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:10,530 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-26 08:06:10,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:06:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-26 08:06:10,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:06:10,531 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:10,532 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2018-09-26 08:06:10,532 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:10,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:10,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2018-09-26 08:06:10,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:10,708 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:10,708 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:06:10,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:06:10,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:06:10,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:06:10,710 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 12 states. [2018-09-26 08:06:10,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:10,800 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-26 08:06:10,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:10,801 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-09-26 08:06:10,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:10,802 INFO L225 Difference]: With dead ends: 22 [2018-09-26 08:06:10,803 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:06:10,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:06:10,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:06:10,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-09-26 08:06:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 08:06:10,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-26 08:06:10,815 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-09-26 08:06:10,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:10,815 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-26 08:06:10,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:06:10,819 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-26 08:06:10,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:06:10,820 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:10,820 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2018-09-26 08:06:10,820 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:10,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:10,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2018-09-26 08:06:10,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:11,016 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:11,017 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:06:11,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:06:11,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:06:11,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:06:11,018 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2018-09-26 08:06:11,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:11,127 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-26 08:06:11,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:11,127 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-09-26 08:06:11,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:11,129 INFO L225 Difference]: With dead ends: 24 [2018-09-26 08:06:11,130 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:06:11,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:06:11,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:06:11,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-09-26 08:06:11,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:06:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-26 08:06:11,159 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-09-26 08:06:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:11,160 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-26 08:06:11,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:06:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-26 08:06:11,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:06:11,161 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:11,161 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2018-09-26 08:06:11,163 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:11,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:11,163 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2018-09-26 08:06:11,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:11,371 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:11,371 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:06:11,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:06:11,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:06:11,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:11,374 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 14 states. [2018-09-26 08:06:11,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:11,491 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-26 08:06:11,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:06:11,492 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-09-26 08:06:11,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:11,493 INFO L225 Difference]: With dead ends: 26 [2018-09-26 08:06:11,493 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:06:11,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:11,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:06:11,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-09-26 08:06:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 08:06:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-26 08:06:11,509 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-09-26 08:06:11,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:11,510 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-26 08:06:11,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:06:11,510 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-26 08:06:11,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:06:11,511 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:11,511 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2018-09-26 08:06:11,512 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:11,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:11,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2018-09-26 08:06:11,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:11,748 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:11,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:06:11,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:06:11,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:06:11,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:11,750 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 15 states. [2018-09-26 08:06:11,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:11,892 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-26 08:06:11,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:11,893 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-09-26 08:06:11,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:11,894 INFO L225 Difference]: With dead ends: 28 [2018-09-26 08:06:11,894 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:06:11,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:11,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:06:11,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-09-26 08:06:11,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 08:06:11,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-26 08:06:11,915 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-09-26 08:06:11,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:11,915 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-26 08:06:11,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:06:11,916 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-26 08:06:11,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:06:11,917 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:11,917 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2018-09-26 08:06:11,918 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:11,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:11,918 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2018-09-26 08:06:11,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:12,143 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:12,143 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:12,144 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:06:12,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:06:12,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:06:12,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:12,145 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 16 states. [2018-09-26 08:06:12,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:12,309 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-26 08:06:12,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:06:12,310 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-09-26 08:06:12,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:12,311 INFO L225 Difference]: With dead ends: 30 [2018-09-26 08:06:12,311 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:06:12,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:12,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:06:12,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-09-26 08:06:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-26 08:06:12,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-09-26 08:06:12,338 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-09-26 08:06:12,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:12,340 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-09-26 08:06:12,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:06:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-09-26 08:06:12,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-26 08:06:12,341 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:12,341 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2018-09-26 08:06:12,342 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:12,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:12,343 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2018-09-26 08:06:12,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:12,576 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:12,576 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:12,576 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:06:12,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:06:12,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:06:12,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:12,578 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 17 states. [2018-09-26 08:06:12,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:12,752 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-26 08:06:12,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:06:12,752 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-09-26 08:06:12,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:12,753 INFO L225 Difference]: With dead ends: 32 [2018-09-26 08:06:12,753 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:06:12,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:12,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:06:12,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-09-26 08:06:12,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 08:06:12,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-26 08:06:12,775 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-09-26 08:06:12,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:12,775 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-26 08:06:12,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:06:12,776 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-26 08:06:12,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:06:12,777 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:12,777 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2018-09-26 08:06:12,777 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:12,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:12,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2018-09-26 08:06:12,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:13,149 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:13,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:06:13,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:06:13,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:06:13,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:06:13,151 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 18 states. [2018-09-26 08:06:13,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:13,368 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-26 08:06:13,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:06:13,369 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2018-09-26 08:06:13,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:13,370 INFO L225 Difference]: With dead ends: 34 [2018-09-26 08:06:13,370 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:06:13,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:06:13,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:06:13,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-09-26 08:06:13,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-26 08:06:13,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-26 08:06:13,399 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-09-26 08:06:13,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:13,399 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-26 08:06:13,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:06:13,399 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-26 08:06:13,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 08:06:13,400 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:13,401 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2018-09-26 08:06:13,402 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:13,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:13,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2018-09-26 08:06:13,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:13,666 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:13,667 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:13,667 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:06:13,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:06:13,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:06:13,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:13,668 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 19 states. [2018-09-26 08:06:13,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:13,877 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-26 08:06:13,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:06:13,878 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2018-09-26 08:06:13,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:13,878 INFO L225 Difference]: With dead ends: 36 [2018-09-26 08:06:13,879 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:06:13,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:13,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:06:13,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-09-26 08:06:13,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 08:06:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-09-26 08:06:13,903 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-09-26 08:06:13,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:13,904 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-09-26 08:06:13,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:06:13,904 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-09-26 08:06:13,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-26 08:06:13,905 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:13,905 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2018-09-26 08:06:13,906 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:13,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:13,906 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2018-09-26 08:06:13,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:14,144 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:14,144 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:06:14,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:06:14,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:06:14,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:06:14,146 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 20 states. [2018-09-26 08:06:14,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:14,367 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-26 08:06:14,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:06:14,368 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-09-26 08:06:14,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:14,368 INFO L225 Difference]: With dead ends: 38 [2018-09-26 08:06:14,368 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:06:14,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:06:14,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:06:14,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-09-26 08:06:14,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 08:06:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-26 08:06:14,393 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-09-26 08:06:14,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:14,394 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-26 08:06:14,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:06:14,394 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-26 08:06:14,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 08:06:14,395 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:14,395 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2018-09-26 08:06:14,395 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:14,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:14,395 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2018-09-26 08:06:14,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:14,630 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:14,631 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:06:14,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:06:14,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:06:14,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:06:14,632 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 21 states. [2018-09-26 08:06:14,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:14,888 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-26 08:06:14,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:06:14,888 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 35 [2018-09-26 08:06:14,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:14,889 INFO L225 Difference]: With dead ends: 40 [2018-09-26 08:06:14,889 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:06:14,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:06:14,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:06:14,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-09-26 08:06:14,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 08:06:14,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-26 08:06:14,925 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-09-26 08:06:14,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:14,926 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-26 08:06:14,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:06:14,926 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-26 08:06:14,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 08:06:14,930 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:14,930 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2018-09-26 08:06:14,930 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:14,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:14,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2018-09-26 08:06:14,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:15,212 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:15,213 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:15,213 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:06:15,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:06:15,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:06:15,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:06:15,215 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 22 states. [2018-09-26 08:06:15,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:15,500 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-26 08:06:15,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:06:15,500 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-09-26 08:06:15,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:15,501 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:06:15,501 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:06:15,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:06:15,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:06:15,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-09-26 08:06:15,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 08:06:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-09-26 08:06:15,536 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-09-26 08:06:15,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:15,536 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-09-26 08:06:15,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:06:15,536 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-09-26 08:06:15,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 08:06:15,537 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:15,539 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2018-09-26 08:06:15,539 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:15,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:15,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2018-09-26 08:06:15,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:15,877 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:15,878 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:06:15,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:06:15,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:06:15,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:06:15,879 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 23 states. [2018-09-26 08:06:16,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:16,177 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-26 08:06:16,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:06:16,177 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2018-09-26 08:06:16,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:16,178 INFO L225 Difference]: With dead ends: 44 [2018-09-26 08:06:16,178 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:06:16,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:06:16,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:06:16,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-09-26 08:06:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-26 08:06:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-26 08:06:16,212 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-09-26 08:06:16,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:16,213 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-26 08:06:16,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:06:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-26 08:06:16,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 08:06:16,214 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:16,214 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2018-09-26 08:06:16,215 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:16,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:16,216 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2018-09-26 08:06:16,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:16,568 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:16,568 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:06:16,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:06:16,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:06:16,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:06:16,570 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 24 states. [2018-09-26 08:06:16,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:16,876 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-26 08:06:16,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:06:16,876 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 41 [2018-09-26 08:06:16,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:16,877 INFO L225 Difference]: With dead ends: 46 [2018-09-26 08:06:16,877 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:06:16,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:06:16,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:06:16,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-09-26 08:06:16,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-26 08:06:16,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-26 08:06:16,919 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-09-26 08:06:16,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:16,920 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-26 08:06:16,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:06:16,920 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-26 08:06:16,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 08:06:16,921 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:16,921 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2018-09-26 08:06:16,921 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:16,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:16,921 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2018-09-26 08:06:16,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:17,222 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:17,222 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:17,222 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:06:17,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:06:17,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:06:17,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:06:17,225 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 25 states. [2018-09-26 08:06:17,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:17,552 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-26 08:06:17,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:06:17,553 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 43 [2018-09-26 08:06:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:17,553 INFO L225 Difference]: With dead ends: 48 [2018-09-26 08:06:17,554 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:06:17,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:06:17,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:06:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-09-26 08:06:17,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-26 08:06:17,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-26 08:06:17,606 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-09-26 08:06:17,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:17,606 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-26 08:06:17,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:06:17,606 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-26 08:06:17,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-26 08:06:17,607 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:17,607 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2018-09-26 08:06:17,607 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:17,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:17,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2018-09-26 08:06:17,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:17,943 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:17,943 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:17,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:06:17,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:06:17,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:06:17,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:06:17,945 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 26 states. [2018-09-26 08:06:18,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:18,268 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-26 08:06:18,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:06:18,268 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2018-09-26 08:06:18,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:18,270 INFO L225 Difference]: With dead ends: 50 [2018-09-26 08:06:18,270 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:06:18,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:06:18,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:06:18,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-09-26 08:06:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-26 08:06:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-09-26 08:06:18,312 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-09-26 08:06:18,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:18,313 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-09-26 08:06:18,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:06:18,313 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-09-26 08:06:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-26 08:06:18,314 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:18,314 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2018-09-26 08:06:18,314 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:18,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:18,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2018-09-26 08:06:18,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:18,667 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:18,667 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:18,667 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:06:18,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:06:18,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:06:18,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:06:18,669 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 27 states. [2018-09-26 08:06:19,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:19,037 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-26 08:06:19,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:06:19,037 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 47 [2018-09-26 08:06:19,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:19,038 INFO L225 Difference]: With dead ends: 52 [2018-09-26 08:06:19,038 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:06:19,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:06:19,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:06:19,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-09-26 08:06:19,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-26 08:06:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-09-26 08:06:19,085 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-09-26 08:06:19,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:19,086 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-09-26 08:06:19,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:06:19,086 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-09-26 08:06:19,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-26 08:06:19,091 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:19,091 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2018-09-26 08:06:19,091 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:19,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:19,092 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2018-09-26 08:06:19,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:19,431 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:19,432 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:19,432 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:06:19,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:06:19,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:06:19,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:06:19,435 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 28 states. [2018-09-26 08:06:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:19,842 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-26 08:06:19,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:06:19,843 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 49 [2018-09-26 08:06:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:19,844 INFO L225 Difference]: With dead ends: 54 [2018-09-26 08:06:19,844 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:06:19,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:06:19,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:06:19,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-09-26 08:06:19,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 08:06:19,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-26 08:06:19,904 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-09-26 08:06:19,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:19,905 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-26 08:06:19,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:06:19,905 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-26 08:06:19,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-26 08:06:19,906 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:19,906 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2018-09-26 08:06:19,910 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:19,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:19,911 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2018-09-26 08:06:19,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:20,356 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:20,357 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:06:20,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:06:20,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:06:20,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:06:20,358 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 29 states. [2018-09-26 08:06:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:20,736 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-26 08:06:20,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:06:20,736 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2018-09-26 08:06:20,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:20,737 INFO L225 Difference]: With dead ends: 56 [2018-09-26 08:06:20,737 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:06:20,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:06:20,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:06:20,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-09-26 08:06:20,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-26 08:06:20,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-09-26 08:06:20,780 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-09-26 08:06:20,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:20,780 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-09-26 08:06:20,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:06:20,780 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-09-26 08:06:20,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-26 08:06:20,781 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:20,781 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2018-09-26 08:06:20,781 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:20,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:20,782 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2018-09-26 08:06:20,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:21,152 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:21,152 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:06:21,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:06:21,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:06:21,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:06:21,154 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 30 states. [2018-09-26 08:06:21,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:21,593 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-09-26 08:06:21,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:06:21,594 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 53 [2018-09-26 08:06:21,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:21,596 INFO L225 Difference]: With dead ends: 58 [2018-09-26 08:06:21,596 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:06:21,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:06:21,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:06:21,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-09-26 08:06:21,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-26 08:06:21,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-26 08:06:21,655 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-09-26 08:06:21,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:21,655 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-26 08:06:21,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:06:21,655 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-26 08:06:21,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-26 08:06:21,656 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:21,656 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2018-09-26 08:06:21,656 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:21,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:21,657 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2018-09-26 08:06:21,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:22,047 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:22,047 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:06:22,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:06:22,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:06:22,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:06:22,048 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 31 states. [2018-09-26 08:06:22,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:22,493 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-26 08:06:22,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:06:22,493 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 55 [2018-09-26 08:06:22,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:22,494 INFO L225 Difference]: With dead ends: 60 [2018-09-26 08:06:22,494 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:06:22,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:06:22,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:06:22,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-09-26 08:06:22,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-26 08:06:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-09-26 08:06:22,543 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-09-26 08:06:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:22,544 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-09-26 08:06:22,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:06:22,544 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-09-26 08:06:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-26 08:06:22,544 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:22,545 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2018-09-26 08:06:22,545 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:22,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:22,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2018-09-26 08:06:22,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:22,936 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:22,937 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:06:22,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:06:22,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:06:22,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:06:22,938 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 32 states. [2018-09-26 08:06:23,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:23,409 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-09-26 08:06:23,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:06:23,409 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 57 [2018-09-26 08:06:23,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:23,410 INFO L225 Difference]: With dead ends: 62 [2018-09-26 08:06:23,410 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:06:23,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:06:23,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:06:23,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-09-26 08:06:23,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-26 08:06:23,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-09-26 08:06:23,470 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-09-26 08:06:23,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:23,470 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-09-26 08:06:23,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:06:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-09-26 08:06:23,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-26 08:06:23,471 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:23,471 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2018-09-26 08:06:23,474 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:23,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:23,474 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2018-09-26 08:06:23,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:23,922 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:23,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:06:23,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:06:23,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:06:23,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:06:23,924 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 33 states. [2018-09-26 08:06:24,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:24,447 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-09-26 08:06:24,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:06:24,447 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 59 [2018-09-26 08:06:24,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:24,448 INFO L225 Difference]: With dead ends: 64 [2018-09-26 08:06:24,448 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:06:24,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:06:24,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:06:24,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-09-26 08:06:24,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-26 08:06:24,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-26 08:06:24,503 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-09-26 08:06:24,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:24,504 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-26 08:06:24,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:06:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-26 08:06:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-26 08:06:24,504 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:24,505 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2018-09-26 08:06:24,505 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:24,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:24,505 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2018-09-26 08:06:24,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:24,905 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:24,905 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:06:24,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:06:24,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:06:24,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:06:24,907 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 34 states. [2018-09-26 08:06:25,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:25,379 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-26 08:06:25,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:06:25,379 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 61 [2018-09-26 08:06:25,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:25,380 INFO L225 Difference]: With dead ends: 66 [2018-09-26 08:06:25,380 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:06:25,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:06:25,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:06:25,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-09-26 08:06:25,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-26 08:06:25,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-09-26 08:06:25,435 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-09-26 08:06:25,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:25,437 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-09-26 08:06:25,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:06:25,438 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-09-26 08:06:25,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-26 08:06:25,438 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:25,438 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2018-09-26 08:06:25,439 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:25,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:25,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2018-09-26 08:06:25,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:25,820 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:25,821 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:25,821 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:06:25,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:06:25,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:06:25,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:06:25,823 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 35 states. [2018-09-26 08:06:26,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:26,321 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-09-26 08:06:26,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:06:26,322 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 63 [2018-09-26 08:06:26,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:26,323 INFO L225 Difference]: With dead ends: 68 [2018-09-26 08:06:26,323 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:06:26,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:06:26,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:06:26,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-09-26 08:06:26,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-26 08:06:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-26 08:06:26,381 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-09-26 08:06:26,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:26,382 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-26 08:06:26,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:06:26,382 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-26 08:06:26,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 08:06:26,383 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:26,383 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2018-09-26 08:06:26,383 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:26,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:26,384 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2018-09-26 08:06:26,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:26,758 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:26,758 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:06:26,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:06:26,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:06:26,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:06:26,760 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 36 states. [2018-09-26 08:06:27,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:27,253 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-26 08:06:27,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:06:27,254 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 65 [2018-09-26 08:06:27,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:27,255 INFO L225 Difference]: With dead ends: 70 [2018-09-26 08:06:27,255 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:06:27,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:06:27,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:06:27,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-09-26 08:06:27,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-26 08:06:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-09-26 08:06:27,318 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-09-26 08:06:27,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:27,319 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-09-26 08:06:27,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:06:27,319 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-09-26 08:06:27,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-26 08:06:27,322 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:27,322 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2018-09-26 08:06:27,322 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:27,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:27,323 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2018-09-26 08:06:27,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:27,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:27,765 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:27,765 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:06:27,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:06:27,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:06:27,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:06:27,770 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 37 states. [2018-09-26 08:06:28,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:28,317 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-09-26 08:06:28,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:06:28,317 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 67 [2018-09-26 08:06:28,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:28,318 INFO L225 Difference]: With dead ends: 72 [2018-09-26 08:06:28,318 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:06:28,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:06:28,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:06:28,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-09-26 08:06:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-26 08:06:28,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-09-26 08:06:28,385 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-09-26 08:06:28,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:28,385 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-09-26 08:06:28,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:06:28,385 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-09-26 08:06:28,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-26 08:06:28,386 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:28,386 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2018-09-26 08:06:28,386 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:28,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:28,387 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2018-09-26 08:06:28,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:28,801 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:28,801 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:06:28,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:06:28,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:06:28,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:06:28,803 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 38 states. [2018-09-26 08:06:29,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:29,329 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-09-26 08:06:29,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:06:29,330 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 69 [2018-09-26 08:06:29,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:29,331 INFO L225 Difference]: With dead ends: 74 [2018-09-26 08:06:29,331 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:06:29,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:06:29,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:06:29,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-09-26 08:06:29,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-26 08:06:29,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-09-26 08:06:29,391 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-09-26 08:06:29,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:29,391 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-09-26 08:06:29,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:06:29,391 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-09-26 08:06:29,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-26 08:06:29,392 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:29,392 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2018-09-26 08:06:29,392 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:29,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:29,393 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2018-09-26 08:06:29,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:29,803 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:29,803 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:06:29,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:06:29,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:06:29,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:06:29,805 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 39 states. [2018-09-26 08:06:30,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:30,349 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-26 08:06:30,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:06:30,349 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 71 [2018-09-26 08:06:30,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:30,350 INFO L225 Difference]: With dead ends: 76 [2018-09-26 08:06:30,350 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:06:30,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:06:30,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:06:30,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-09-26 08:06:30,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-26 08:06:30,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-09-26 08:06:30,422 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-09-26 08:06:30,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:30,423 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-09-26 08:06:30,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:06:30,423 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-09-26 08:06:30,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-26 08:06:30,424 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:30,424 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2018-09-26 08:06:30,424 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:30,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:30,424 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2018-09-26 08:06:30,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:30,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:30,870 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:30,870 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:06:30,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:06:30,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:06:30,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:06:30,872 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 40 states. [2018-09-26 08:06:31,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:31,545 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-09-26 08:06:31,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:06:31,546 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 73 [2018-09-26 08:06:31,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:31,546 INFO L225 Difference]: With dead ends: 78 [2018-09-26 08:06:31,547 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:06:31,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:06:31,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:06:31,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-09-26 08:06:31,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 08:06:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-26 08:06:31,615 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-09-26 08:06:31,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:31,616 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-26 08:06:31,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:06:31,616 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-26 08:06:31,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-26 08:06:31,617 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:31,617 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2018-09-26 08:06:31,617 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:31,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:31,617 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2018-09-26 08:06:31,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:32,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:32,015 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:32,015 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:06:32,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:06:32,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:06:32,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:06:32,017 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 41 states. [2018-09-26 08:06:32,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:32,567 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-26 08:06:32,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:06:32,567 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 75 [2018-09-26 08:06:32,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:32,568 INFO L225 Difference]: With dead ends: 80 [2018-09-26 08:06:32,568 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:06:32,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:06:32,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:06:32,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-09-26 08:06:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-26 08:06:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-09-26 08:06:32,634 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-09-26 08:06:32,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:32,634 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-09-26 08:06:32,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:06:32,634 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-09-26 08:06:32,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-26 08:06:32,635 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:32,635 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2018-09-26 08:06:32,635 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:32,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:32,636 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2018-09-26 08:06:32,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:33,044 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:33,044 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:06:33,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:06:33,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:06:33,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:06:33,046 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 42 states. [2018-09-26 08:06:33,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:33,547 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-09-26 08:06:33,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:06:33,548 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 77 [2018-09-26 08:06:33,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:33,548 INFO L225 Difference]: With dead ends: 82 [2018-09-26 08:06:33,548 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 08:06:33,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:06:33,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 08:06:33,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-09-26 08:06:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-26 08:06:33,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-09-26 08:06:33,620 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-09-26 08:06:33,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:33,620 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-09-26 08:06:33,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:06:33,620 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-09-26 08:06:33,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-26 08:06:33,621 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:33,621 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2018-09-26 08:06:33,621 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:33,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:33,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2018-09-26 08:06:33,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:33,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:33,997 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:33,998 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:06:33,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:06:33,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:06:33,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1722, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:06:33,999 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 43 states. [2018-09-26 08:06:34,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:34,476 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-09-26 08:06:34,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:06:34,477 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 79 [2018-09-26 08:06:34,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:34,477 INFO L225 Difference]: With dead ends: 84 [2018-09-26 08:06:34,478 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:06:34,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=1722, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:06:34,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:06:34,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-09-26 08:06:34,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-26 08:06:34,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-09-26 08:06:34,531 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-09-26 08:06:34,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:34,532 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-09-26 08:06:34,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:06:34,532 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-09-26 08:06:34,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-26 08:06:34,532 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:34,533 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2018-09-26 08:06:34,533 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:34,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:34,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2018-09-26 08:06:34,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:34,888 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:34,888 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:06:34,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:06:34,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:06:34,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:06:34,890 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 44 states. [2018-09-26 08:06:35,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:35,411 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-26 08:06:35,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:06:35,411 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 81 [2018-09-26 08:06:35,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:35,412 INFO L225 Difference]: With dead ends: 86 [2018-09-26 08:06:35,412 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:06:35,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:06:35,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:06:35,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-09-26 08:06:35,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-26 08:06:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-09-26 08:06:35,467 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-09-26 08:06:35,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:35,467 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-09-26 08:06:35,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:06:35,468 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-09-26 08:06:35,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-26 08:06:35,468 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:35,468 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2018-09-26 08:06:35,469 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:35,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:35,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2018-09-26 08:06:35,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:35,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:35,969 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:35,969 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:06:35,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:06:35,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:06:35,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:06:35,971 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 45 states. [2018-09-26 08:06:36,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:36,627 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-09-26 08:06:36,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:06:36,628 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 83 [2018-09-26 08:06:36,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:36,628 INFO L225 Difference]: With dead ends: 88 [2018-09-26 08:06:36,629 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:06:36,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:06:36,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:06:36,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-09-26 08:06:36,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-26 08:06:36,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-26 08:06:36,690 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-09-26 08:06:36,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:36,690 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-26 08:06:36,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:06:36,690 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-26 08:06:36,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-26 08:06:36,691 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:36,691 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2018-09-26 08:06:36,691 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:36,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:36,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2018-09-26 08:06:36,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:37,203 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:37,203 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:06:37,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:06:37,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:06:37,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1980, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:06:37,205 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 46 states. [2018-09-26 08:06:38,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:38,044 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-26 08:06:38,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:06:38,045 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 85 [2018-09-26 08:06:38,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:38,045 INFO L225 Difference]: With dead ends: 90 [2018-09-26 08:06:38,045 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:06:38,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=1980, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:06:38,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:06:38,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-09-26 08:06:38,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-26 08:06:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-09-26 08:06:38,104 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-09-26 08:06:38,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:38,104 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-09-26 08:06:38,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:06:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-09-26 08:06:38,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-26 08:06:38,105 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:38,105 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2018-09-26 08:06:38,106 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:38,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:38,106 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2018-09-26 08:06:38,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:38,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:38,578 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:38,579 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:06:38,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:06:38,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:06:38,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=2070, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:06:38,580 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 47 states. [2018-09-26 08:06:39,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:39,229 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-09-26 08:06:39,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:06:39,229 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 87 [2018-09-26 08:06:39,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:39,230 INFO L225 Difference]: With dead ends: 92 [2018-09-26 08:06:39,230 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:06:39,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=2070, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:06:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:06:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-09-26 08:06:39,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-26 08:06:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-09-26 08:06:39,318 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-09-26 08:06:39,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:39,318 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-09-26 08:06:39,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:06:39,318 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-09-26 08:06:39,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-26 08:06:39,319 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:39,319 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2018-09-26 08:06:39,320 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:39,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:39,320 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2018-09-26 08:06:39,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:39,732 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:39,732 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:06:39,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:06:39,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:06:39,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=2162, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:06:39,734 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 48 states. [2018-09-26 08:06:40,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:40,333 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-09-26 08:06:40,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:06:40,333 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 89 [2018-09-26 08:06:40,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:40,334 INFO L225 Difference]: With dead ends: 94 [2018-09-26 08:06:40,335 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 08:06:40,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=2162, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:06:40,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 08:06:40,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-09-26 08:06:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-26 08:06:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-09-26 08:06:40,420 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-09-26 08:06:40,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:40,420 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-09-26 08:06:40,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:06:40,420 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-09-26 08:06:40,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-26 08:06:40,421 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:40,421 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2018-09-26 08:06:40,421 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:40,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:40,422 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2018-09-26 08:06:40,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:40,925 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:40,925 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:06:40,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:06:40,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:06:40,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=2256, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:06:40,926 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 49 states. [2018-09-26 08:06:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:41,583 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-26 08:06:41,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:06:41,583 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 91 [2018-09-26 08:06:41,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:41,584 INFO L225 Difference]: With dead ends: 96 [2018-09-26 08:06:41,584 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:06:41,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=2256, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:06:41,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:06:41,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-09-26 08:06:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-26 08:06:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-09-26 08:06:41,673 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-09-26 08:06:41,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:41,673 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-09-26 08:06:41,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:06:41,673 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-09-26 08:06:41,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-09-26 08:06:41,674 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:41,674 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2018-09-26 08:06:41,674 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:41,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:41,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2018-09-26 08:06:41,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:42,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:42,154 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:42,154 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:06:42,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:06:42,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:06:42,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=2352, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:06:42,155 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 50 states. [2018-09-26 08:06:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:42,741 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-09-26 08:06:42,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:06:42,741 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 93 [2018-09-26 08:06:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:42,742 INFO L225 Difference]: With dead ends: 98 [2018-09-26 08:06:42,742 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:06:42,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=2352, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:06:42,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:06:42,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-09-26 08:06:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-26 08:06:42,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-26 08:06:42,830 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-09-26 08:06:42,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:42,831 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-26 08:06:42,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:06:42,831 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-26 08:06:42,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-26 08:06:42,831 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:42,832 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2018-09-26 08:06:42,832 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:42,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:42,832 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2018-09-26 08:06:42,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:43,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:43,296 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:43,296 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:06:43,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:06:43,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:06:43,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=2450, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:06:43,297 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 51 states. [2018-09-26 08:06:43,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:43,872 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-26 08:06:43,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:06:43,872 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 95 [2018-09-26 08:06:43,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:43,873 INFO L225 Difference]: With dead ends: 100 [2018-09-26 08:06:43,873 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:06:43,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=2450, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:06:43,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:06:43,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-09-26 08:06:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-26 08:06:43,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-09-26 08:06:43,938 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-09-26 08:06:43,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:43,939 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-09-26 08:06:43,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:06:43,939 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-09-26 08:06:43,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-26 08:06:43,939 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:43,939 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2018-09-26 08:06:43,939 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:43,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:43,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2018-09-26 08:06:43,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:44,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:44,552 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:44,552 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:06:44,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:06:44,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:06:44,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=2550, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:06:44,553 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 52 states. [2018-09-26 08:06:45,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:45,128 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-09-26 08:06:45,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:06:45,128 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 97 [2018-09-26 08:06:45,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:45,128 INFO L225 Difference]: With dead ends: 102 [2018-09-26 08:06:45,129 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:06:45,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=2550, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:06:45,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:06:45,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-09-26 08:06:45,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 08:06:45,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-09-26 08:06:45,200 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-09-26 08:06:45,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:45,200 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-09-26 08:06:45,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:06:45,200 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-09-26 08:06:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-26 08:06:45,201 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:45,201 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2018-09-26 08:06:45,201 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:45,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:45,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2018-09-26 08:06:45,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:45,705 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:45,706 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:06:45,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:06:45,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:06:45,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=2652, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:06:45,706 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 53 states. [2018-09-26 08:06:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:46,319 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-26 08:06:46,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:06:46,319 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 99 [2018-09-26 08:06:46,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:46,320 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:06:46,320 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:06:46,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=2652, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:06:46,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:06:46,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-09-26 08:06:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-26 08:06:46,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-09-26 08:06:46,398 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-09-26 08:06:46,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:46,399 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-09-26 08:06:46,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:06:46,399 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-09-26 08:06:46,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-26 08:06:46,399 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:46,400 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2018-09-26 08:06:46,400 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:46,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:46,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2018-09-26 08:06:46,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:47,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:47,020 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:47,020 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:06:47,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:06:47,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:06:47,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=2756, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:06:47,021 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 54 states. [2018-09-26 08:06:47,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:47,794 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-09-26 08:06:47,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:06:47,794 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 101 [2018-09-26 08:06:47,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:47,795 INFO L225 Difference]: With dead ends: 106 [2018-09-26 08:06:47,795 INFO L226 Difference]: Without dead ends: 105 [2018-09-26 08:06:47,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=2756, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:06:47,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-26 08:06:47,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-09-26 08:06:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-26 08:06:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-09-26 08:06:47,881 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2018-09-26 08:06:47,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:47,881 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-09-26 08:06:47,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:06:47,881 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-09-26 08:06:47,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-26 08:06:47,882 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:47,882 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2018-09-26 08:06:47,882 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:47,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:47,882 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2018-09-26 08:06:47,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:48,410 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:48,411 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:06:48,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:06:48,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:06:48,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:06:48,412 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 55 states. [2018-09-26 08:06:49,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:49,196 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-09-26 08:06:49,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:06:49,196 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 103 [2018-09-26 08:06:49,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:49,198 INFO L225 Difference]: With dead ends: 108 [2018-09-26 08:06:49,198 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:06:49,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:06:49,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:06:49,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-09-26 08:06:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-26 08:06:49,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-09-26 08:06:49,298 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2018-09-26 08:06:49,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:49,298 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-09-26 08:06:49,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:06:49,299 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-09-26 08:06:49,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-26 08:06:49,299 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:49,299 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2018-09-26 08:06:49,299 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:49,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:49,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2018-09-26 08:06:49,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:49,773 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:49,773 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:06:49,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:06:49,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:06:49,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=2970, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:06:49,775 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 56 states. [2018-09-26 08:06:50,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:50,507 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-09-26 08:06:50,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:06:50,507 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 105 [2018-09-26 08:06:50,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:50,508 INFO L225 Difference]: With dead ends: 110 [2018-09-26 08:06:50,508 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 08:06:50,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=2970, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:06:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 08:06:50,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-09-26 08:06:50,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-09-26 08:06:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-09-26 08:06:50,606 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2018-09-26 08:06:50,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:50,606 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-09-26 08:06:50,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:06:50,606 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-09-26 08:06:50,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-26 08:06:50,607 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:50,607 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2018-09-26 08:06:50,607 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:50,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:50,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2018-09-26 08:06:50,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:51,174 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:51,174 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:06:51,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:06:51,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:06:51,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=3080, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:06:51,175 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 57 states. [2018-09-26 08:06:51,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:51,927 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-09-26 08:06:51,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:06:51,927 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 107 [2018-09-26 08:06:51,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:51,928 INFO L225 Difference]: With dead ends: 112 [2018-09-26 08:06:51,928 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 08:06:51,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=3080, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:06:51,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 08:06:52,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-09-26 08:06:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-09-26 08:06:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-09-26 08:06:52,014 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2018-09-26 08:06:52,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:52,014 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-09-26 08:06:52,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:06:52,015 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-09-26 08:06:52,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-09-26 08:06:52,015 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:52,015 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2018-09-26 08:06:52,015 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:52,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:52,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2018-09-26 08:06:52,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:52,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:52,529 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:52,529 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:06:52,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:06:52,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:06:52,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=3192, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:06:52,530 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 58 states. [2018-09-26 08:06:53,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:53,301 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-09-26 08:06:53,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:06:53,301 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 109 [2018-09-26 08:06:53,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:53,302 INFO L225 Difference]: With dead ends: 114 [2018-09-26 08:06:53,302 INFO L226 Difference]: Without dead ends: 113 [2018-09-26 08:06:53,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=3192, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:06:53,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-26 08:06:53,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-09-26 08:06:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-26 08:06:53,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-09-26 08:06:53,408 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2018-09-26 08:06:53,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:53,408 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-09-26 08:06:53,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:06:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-09-26 08:06:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-26 08:06:53,409 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:53,409 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2018-09-26 08:06:53,410 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:53,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:53,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2018-09-26 08:06:53,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:53,883 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:53,884 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:06:53,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:06:53,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:06:53,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=3306, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:06:53,884 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 59 states. [2018-09-26 08:06:54,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:54,658 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-09-26 08:06:54,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:06:54,658 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 111 [2018-09-26 08:06:54,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:54,659 INFO L225 Difference]: With dead ends: 116 [2018-09-26 08:06:54,660 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:06:54,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=3306, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:06:54,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:06:54,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-09-26 08:06:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-09-26 08:06:54,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-09-26 08:06:54,763 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2018-09-26 08:06:54,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:54,763 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-09-26 08:06:54,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:06:54,764 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-09-26 08:06:54,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-09-26 08:06:54,764 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:54,764 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2018-09-26 08:06:54,765 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:54,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:54,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2018-09-26 08:06:54,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:55,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:55,267 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:55,267 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:06:55,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:06:55,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:06:55,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=3422, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:06:55,268 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 60 states. [2018-09-26 08:06:56,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:56,078 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-09-26 08:06:56,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:06:56,078 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 113 [2018-09-26 08:06:56,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:56,079 INFO L225 Difference]: With dead ends: 118 [2018-09-26 08:06:56,079 INFO L226 Difference]: Without dead ends: 117 [2018-09-26 08:06:56,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=3422, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:06:56,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-26 08:06:56,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-09-26 08:06:56,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-26 08:06:56,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-09-26 08:06:56,185 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2018-09-26 08:06:56,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:56,186 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-09-26 08:06:56,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:06:56,186 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-09-26 08:06:56,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-26 08:06:56,186 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:56,186 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2018-09-26 08:06:56,186 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:56,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:56,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2018-09-26 08:06:56,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:57,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:57,018 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:57,018 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:06:57,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:06:57,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:06:57,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=3540, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:06:57,023 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 61 states. [2018-09-26 08:06:57,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:57,969 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-09-26 08:06:57,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:06:57,969 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 115 [2018-09-26 08:06:57,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:57,970 INFO L225 Difference]: With dead ends: 120 [2018-09-26 08:06:57,970 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 08:06:57,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=3540, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:06:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 08:06:58,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-09-26 08:06:58,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-26 08:06:58,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-09-26 08:06:58,062 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2018-09-26 08:06:58,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:58,062 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-09-26 08:06:58,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:06:58,062 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-09-26 08:06:58,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-09-26 08:06:58,063 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:58,063 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2018-09-26 08:06:58,063 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:58,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:58,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2018-09-26 08:06:58,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:58,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:58,574 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:58,574 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:06:58,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:06:58,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:06:58,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=3660, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:06:58,575 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 62 states. [2018-09-26 08:06:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:59,423 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-09-26 08:06:59,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:06:59,423 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 117 [2018-09-26 08:06:59,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:59,424 INFO L225 Difference]: With dead ends: 122 [2018-09-26 08:06:59,424 INFO L226 Difference]: Without dead ends: 121 [2018-09-26 08:06:59,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=3660, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:06:59,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-26 08:06:59,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-09-26 08:06:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-09-26 08:06:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-09-26 08:06:59,519 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2018-09-26 08:06:59,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:59,519 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-09-26 08:06:59,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:06:59,519 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-09-26 08:06:59,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-09-26 08:06:59,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:59,520 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2018-09-26 08:06:59,520 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:59,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:59,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2018-09-26 08:06:59,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:00,131 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:00,131 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:07:00,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:07:00,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:07:00,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=3782, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:07:00,132 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 63 states. [2018-09-26 08:07:01,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:01,070 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-09-26 08:07:01,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:07:01,070 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 119 [2018-09-26 08:07:01,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:01,071 INFO L225 Difference]: With dead ends: 124 [2018-09-26 08:07:01,071 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:07:01,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=3782, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:07:01,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:07:01,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-09-26 08:07:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-09-26 08:07:01,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-09-26 08:07:01,178 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2018-09-26 08:07:01,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:01,178 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-09-26 08:07:01,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:07:01,178 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-09-26 08:07:01,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-26 08:07:01,179 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:01,179 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2018-09-26 08:07:01,179 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:01,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:01,179 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2018-09-26 08:07:01,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:01,780 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:01,780 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:07:01,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:07:01,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:07:01,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=3906, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:07:01,781 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 64 states. [2018-09-26 08:07:02,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:02,724 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-09-26 08:07:02,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:07:02,724 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 121 [2018-09-26 08:07:02,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:02,725 INFO L225 Difference]: With dead ends: 126 [2018-09-26 08:07:02,725 INFO L226 Difference]: Without dead ends: 125 [2018-09-26 08:07:02,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=3906, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:07:02,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-26 08:07:02,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-09-26 08:07:02,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-09-26 08:07:02,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-09-26 08:07:02,830 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2018-09-26 08:07:02,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:02,830 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-09-26 08:07:02,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:07:02,830 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-09-26 08:07:02,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-26 08:07:02,831 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:02,831 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2018-09-26 08:07:02,831 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:02,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:02,832 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2018-09-26 08:07:02,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:03,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:03,514 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:03,514 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:07:03,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:07:03,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:07:03,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=4032, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:07:03,515 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 65 states. [2018-09-26 08:07:04,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:04,610 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-09-26 08:07:04,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:07:04,610 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 123 [2018-09-26 08:07:04,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:04,611 INFO L225 Difference]: With dead ends: 128 [2018-09-26 08:07:04,611 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 08:07:04,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=4032, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:07:04,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 08:07:04,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2018-09-26 08:07:04,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-09-26 08:07:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-09-26 08:07:04,753 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2018-09-26 08:07:04,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:04,754 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-09-26 08:07:04,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:07:04,754 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-09-26 08:07:04,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-26 08:07:04,755 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:04,755 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2018-09-26 08:07:04,755 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:04,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:04,756 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2018-09-26 08:07:04,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:05,512 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:05,512 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:07:05,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:07:05,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:07:05,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=4160, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:07:05,513 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 66 states. [2018-09-26 08:07:06,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:06,605 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-09-26 08:07:06,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:07:06,606 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 125 [2018-09-26 08:07:06,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:06,606 INFO L225 Difference]: With dead ends: 130 [2018-09-26 08:07:06,607 INFO L226 Difference]: Without dead ends: 129 [2018-09-26 08:07:06,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=4160, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:07:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-26 08:07:06,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-09-26 08:07:06,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-09-26 08:07:06,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-09-26 08:07:06,744 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2018-09-26 08:07:06,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:06,745 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-09-26 08:07:06,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:07:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-09-26 08:07:06,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-09-26 08:07:06,745 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:06,746 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2018-09-26 08:07:06,746 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:06,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:06,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2018-09-26 08:07:06,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:07,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:07,391 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:07,391 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:07:07,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:07:07,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:07:07,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=4290, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:07:07,393 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 67 states. [2018-09-26 08:07:08,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:08,442 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-09-26 08:07:08,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:07:08,443 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 127 [2018-09-26 08:07:08,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:08,444 INFO L225 Difference]: With dead ends: 132 [2018-09-26 08:07:08,444 INFO L226 Difference]: Without dead ends: 131 [2018-09-26 08:07:08,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=4290, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:07:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-26 08:07:08,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2018-09-26 08:07:08,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-09-26 08:07:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-09-26 08:07:08,556 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2018-09-26 08:07:08,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:08,556 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-09-26 08:07:08,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:07:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-09-26 08:07:08,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-09-26 08:07:08,557 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:08,557 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2018-09-26 08:07:08,557 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:08,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:08,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2018-09-26 08:07:08,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:09,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:09,304 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:09,304 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:07:09,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:07:09,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:07:09,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=4422, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:07:09,305 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 68 states. [2018-09-26 08:07:10,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:10,308 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-09-26 08:07:10,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:07:10,308 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 129 [2018-09-26 08:07:10,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:10,309 INFO L225 Difference]: With dead ends: 134 [2018-09-26 08:07:10,309 INFO L226 Difference]: Without dead ends: 133 [2018-09-26 08:07:10,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=4422, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:07:10,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-26 08:07:10,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-09-26 08:07:10,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-09-26 08:07:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-09-26 08:07:10,441 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2018-09-26 08:07:10,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:10,441 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-09-26 08:07:10,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:07:10,441 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-09-26 08:07:10,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-09-26 08:07:10,442 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:10,442 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2018-09-26 08:07:10,442 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:10,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:10,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2018-09-26 08:07:10,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:11,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:11,109 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:11,109 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:07:11,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:07:11,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:07:11,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=4556, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:07:11,110 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 69 states. [2018-09-26 08:07:12,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:12,178 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-09-26 08:07:12,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:07:12,178 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 131 [2018-09-26 08:07:12,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:12,179 INFO L225 Difference]: With dead ends: 136 [2018-09-26 08:07:12,179 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 08:07:12,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=4556, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:07:12,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 08:07:12,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-09-26 08:07:12,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-09-26 08:07:12,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-09-26 08:07:12,308 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2018-09-26 08:07:12,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:12,308 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-09-26 08:07:12,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:07:12,309 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-09-26 08:07:12,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-09-26 08:07:12,309 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:12,309 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2018-09-26 08:07:12,310 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:12,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:12,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2018-09-26 08:07:12,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:13,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:13,202 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:13,202 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:07:13,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:07:13,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:07:13,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=4692, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:07:13,203 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 70 states. [2018-09-26 08:07:14,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:14,233 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-09-26 08:07:14,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:07:14,233 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 133 [2018-09-26 08:07:14,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:14,234 INFO L225 Difference]: With dead ends: 138 [2018-09-26 08:07:14,235 INFO L226 Difference]: Without dead ends: 137 [2018-09-26 08:07:14,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=4692, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:07:14,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-26 08:07:14,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-09-26 08:07:14,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-09-26 08:07:14,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-09-26 08:07:14,442 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2018-09-26 08:07:14,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:14,442 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-09-26 08:07:14,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:07:14,442 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-09-26 08:07:14,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-09-26 08:07:14,443 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:14,443 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2018-09-26 08:07:14,444 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:14,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:14,444 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2018-09-26 08:07:14,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:15,286 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:15,287 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:07:15,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:07:15,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:07:15,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=4830, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:07:15,288 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 71 states. [2018-09-26 08:07:16,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:16,450 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-09-26 08:07:16,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:07:16,450 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 135 [2018-09-26 08:07:16,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:16,451 INFO L225 Difference]: With dead ends: 140 [2018-09-26 08:07:16,451 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 08:07:16,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=4830, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:07:16,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 08:07:16,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2018-09-26 08:07:16,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-09-26 08:07:16,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-09-26 08:07:16,585 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2018-09-26 08:07:16,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:16,585 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-09-26 08:07:16,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:07:16,585 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-09-26 08:07:16,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-26 08:07:16,585 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:16,585 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 1, 1] [2018-09-26 08:07:16,586 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:16,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:16,586 INFO L82 PathProgramCache]: Analyzing trace with hash 323690662, now seen corresponding path program 67 times [2018-09-26 08:07:16,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:17,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:17,345 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:17,345 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:07:17,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:07:17,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:07:17,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=4970, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:07:17,346 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 72 states. [2018-09-26 08:07:18,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:18,535 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-09-26 08:07:18,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:07:18,536 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 137 [2018-09-26 08:07:18,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:18,537 INFO L225 Difference]: With dead ends: 142 [2018-09-26 08:07:18,537 INFO L226 Difference]: Without dead ends: 141 [2018-09-26 08:07:18,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=4970, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:07:18,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-26 08:07:18,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2018-09-26 08:07:18,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-09-26 08:07:18,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-09-26 08:07:18,744 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 137 [2018-09-26 08:07:18,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:18,744 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-09-26 08:07:18,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:07:18,744 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-09-26 08:07:18,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-26 08:07:18,744 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:18,745 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 1, 1] [2018-09-26 08:07:18,745 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:18,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:18,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1829081960, now seen corresponding path program 68 times [2018-09-26 08:07:18,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:19,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:19,501 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:19,501 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:07:19,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:07:19,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:07:19,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=5112, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:07:19,502 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 73 states. [2018-09-26 08:07:20,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:20,917 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-09-26 08:07:20,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:07:20,917 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 139 [2018-09-26 08:07:20,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:20,919 INFO L225 Difference]: With dead ends: 144 [2018-09-26 08:07:20,919 INFO L226 Difference]: Without dead ends: 143 [2018-09-26 08:07:20,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=5112, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:07:20,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-26 08:07:21,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-09-26 08:07:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-09-26 08:07:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-09-26 08:07:21,083 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2018-09-26 08:07:21,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:21,084 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-09-26 08:07:21,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:07:21,084 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-09-26 08:07:21,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-09-26 08:07:21,085 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:21,085 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 1, 1] [2018-09-26 08:07:21,086 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:21,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:21,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1106140586, now seen corresponding path program 69 times [2018-09-26 08:07:21,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:22,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:22,015 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:22,015 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:07:22,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:07:22,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:07:22,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=5256, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:07:22,016 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 74 states. [2018-09-26 08:07:23,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:23,354 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-09-26 08:07:23,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:07:23,354 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 141 [2018-09-26 08:07:23,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:23,355 INFO L225 Difference]: With dead ends: 146 [2018-09-26 08:07:23,355 INFO L226 Difference]: Without dead ends: 145 [2018-09-26 08:07:23,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=146, Invalid=5256, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:07:23,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-26 08:07:23,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2018-09-26 08:07:23,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-09-26 08:07:23,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-09-26 08:07:23,518 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 141 [2018-09-26 08:07:23,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:23,518 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-09-26 08:07:23,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:07:23,518 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-09-26 08:07:23,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-09-26 08:07:23,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:23,519 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 1, 1] [2018-09-26 08:07:23,519 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:23,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:23,520 INFO L82 PathProgramCache]: Analyzing trace with hash 2144182124, now seen corresponding path program 70 times [2018-09-26 08:07:23,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:24,344 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:24,344 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:07:24,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:07:24,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:07:24,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=5402, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:07:24,345 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 75 states. [2018-09-26 08:07:25,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:25,678 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-09-26 08:07:25,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:07:25,678 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 143 [2018-09-26 08:07:25,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:25,679 INFO L225 Difference]: With dead ends: 148 [2018-09-26 08:07:25,679 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:07:25,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=5402, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:07:25,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:07:25,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-09-26 08:07:25,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-09-26 08:07:25,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-09-26 08:07:25,862 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2018-09-26 08:07:25,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:25,863 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-09-26 08:07:25,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:07:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-09-26 08:07:25,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-26 08:07:25,863 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:25,863 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 1, 1] [2018-09-26 08:07:25,863 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:25,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:25,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1025279826, now seen corresponding path program 71 times [2018-09-26 08:07:25,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:26,675 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:26,675 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:07:26,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:07:26,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:07:26,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=5550, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:07:26,676 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 76 states. [2018-09-26 08:07:28,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:28,065 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-09-26 08:07:28,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:07:28,065 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 145 [2018-09-26 08:07:28,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:28,066 INFO L225 Difference]: With dead ends: 150 [2018-09-26 08:07:28,066 INFO L226 Difference]: Without dead ends: 149 [2018-09-26 08:07:28,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=5550, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:07:28,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-26 08:07:28,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2018-09-26 08:07:28,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-09-26 08:07:28,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-09-26 08:07:28,234 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2018-09-26 08:07:28,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:28,234 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-09-26 08:07:28,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:07:28,234 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-09-26 08:07:28,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-26 08:07:28,235 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:28,235 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 1, 1] [2018-09-26 08:07:28,236 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:28,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:28,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1746400912, now seen corresponding path program 72 times [2018-09-26 08:07:28,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:29,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:29,106 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:29,106 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:07:29,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:07:29,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:07:29,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=5700, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:07:29,107 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 77 states. [2018-09-26 08:07:30,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:30,670 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-09-26 08:07:30,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:07:30,670 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 147 [2018-09-26 08:07:30,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:30,671 INFO L225 Difference]: With dead ends: 152 [2018-09-26 08:07:30,671 INFO L226 Difference]: Without dead ends: 151 [2018-09-26 08:07:30,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=5700, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:07:30,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-09-26 08:07:30,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2018-09-26 08:07:30,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-09-26 08:07:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-09-26 08:07:30,917 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2018-09-26 08:07:30,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:30,918 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-09-26 08:07:30,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:07:30,918 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-09-26 08:07:30,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-09-26 08:07:30,919 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:30,919 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 1, 1] [2018-09-26 08:07:30,919 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:30,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:30,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1040937394, now seen corresponding path program 73 times [2018-09-26 08:07:30,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:31,826 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:31,826 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:07:31,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:07:31,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:07:31,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=5852, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:07:31,827 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 78 states. [2018-09-26 08:07:33,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:33,185 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-09-26 08:07:33,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:07:33,185 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 149 [2018-09-26 08:07:33,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:33,186 INFO L225 Difference]: With dead ends: 154 [2018-09-26 08:07:33,186 INFO L226 Difference]: Without dead ends: 153 [2018-09-26 08:07:33,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=5852, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:07:33,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-09-26 08:07:33,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2018-09-26 08:07:33,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-09-26 08:07:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-09-26 08:07:33,338 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2018-09-26 08:07:33,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:33,338 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-09-26 08:07:33,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:07:33,338 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-09-26 08:07:33,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-09-26 08:07:33,339 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:33,339 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 1, 1] [2018-09-26 08:07:33,339 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:33,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:33,340 INFO L82 PathProgramCache]: Analyzing trace with hash -386543244, now seen corresponding path program 74 times [2018-09-26 08:07:33,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:34,179 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:34,179 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:07:34,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:07:34,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:07:34,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=6006, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:07:34,180 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 79 states. [2018-09-26 08:07:35,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:35,590 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-09-26 08:07:35,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:07:35,591 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 151 [2018-09-26 08:07:35,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:35,592 INFO L225 Difference]: With dead ends: 156 [2018-09-26 08:07:35,592 INFO L226 Difference]: Without dead ends: 155 [2018-09-26 08:07:35,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=6006, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:07:35,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-26 08:07:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2018-09-26 08:07:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-09-26 08:07:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-09-26 08:07:35,741 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2018-09-26 08:07:35,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:35,741 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-09-26 08:07:35,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:07:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-09-26 08:07:35,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-09-26 08:07:35,742 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:35,742 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 1, 1] [2018-09-26 08:07:35,742 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:35,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:35,743 INFO L82 PathProgramCache]: Analyzing trace with hash -2100868938, now seen corresponding path program 75 times [2018-09-26 08:07:35,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:36,631 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:36,631 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:36,631 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:07:36,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:07:36,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:07:36,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=6162, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:07:36,632 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 80 states. [2018-09-26 08:07:38,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:38,113 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-09-26 08:07:38,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:07:38,113 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 153 [2018-09-26 08:07:38,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:38,114 INFO L225 Difference]: With dead ends: 158 [2018-09-26 08:07:38,114 INFO L226 Difference]: Without dead ends: 157 [2018-09-26 08:07:38,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=6162, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:07:38,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-09-26 08:07:38,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2018-09-26 08:07:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-09-26 08:07:38,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-09-26 08:07:38,268 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2018-09-26 08:07:38,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:38,268 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-09-26 08:07:38,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:07:38,268 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-09-26 08:07:38,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-09-26 08:07:38,269 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:38,269 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 1, 1] [2018-09-26 08:07:38,269 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:38,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:38,269 INFO L82 PathProgramCache]: Analyzing trace with hash -300419208, now seen corresponding path program 76 times [2018-09-26 08:07:38,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:39,217 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:39,217 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:07:39,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:07:39,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:07:39,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=6320, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:07:39,218 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 81 states. [2018-09-26 08:07:40,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:40,710 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-09-26 08:07:40,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:07:40,710 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 155 [2018-09-26 08:07:40,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:40,711 INFO L225 Difference]: With dead ends: 160 [2018-09-26 08:07:40,711 INFO L226 Difference]: Without dead ends: 159 [2018-09-26 08:07:40,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=6320, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:07:40,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-26 08:07:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2018-09-26 08:07:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-09-26 08:07:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-09-26 08:07:40,886 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2018-09-26 08:07:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:40,887 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-09-26 08:07:40,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:07:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-09-26 08:07:40,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-09-26 08:07:40,887 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:40,888 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 1, 1] [2018-09-26 08:07:40,888 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:40,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:40,888 INFO L82 PathProgramCache]: Analyzing trace with hash -940048966, now seen corresponding path program 77 times [2018-09-26 08:07:40,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:41,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:41,862 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:41,862 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:07:41,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:07:41,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:07:41,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=6480, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:07:41,863 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 82 states. [2018-09-26 08:07:43,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:43,495 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-09-26 08:07:43,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:07:43,496 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 157 [2018-09-26 08:07:43,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:43,496 INFO L225 Difference]: With dead ends: 162 [2018-09-26 08:07:43,496 INFO L226 Difference]: Without dead ends: 161 [2018-09-26 08:07:43,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=6480, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:07:43,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-09-26 08:07:43,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-09-26 08:07:43,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-09-26 08:07:43,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-09-26 08:07:43,679 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2018-09-26 08:07:43,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:43,680 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-09-26 08:07:43,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:07:43,680 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-09-26 08:07:43,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-09-26 08:07:43,680 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:43,681 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 1, 1] [2018-09-26 08:07:43,681 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:43,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:43,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1443923076, now seen corresponding path program 78 times [2018-09-26 08:07:43,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:44,697 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:44,697 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:07:44,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:07:44,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:07:44,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=6642, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:07:44,698 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 83 states. [2018-09-26 08:07:46,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:46,160 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-09-26 08:07:46,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:07:46,161 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 159 [2018-09-26 08:07:46,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:46,161 INFO L225 Difference]: With dead ends: 164 [2018-09-26 08:07:46,161 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 08:07:46,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=6642, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:07:46,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 08:07:46,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2018-09-26 08:07:46,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-26 08:07:46,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-09-26 08:07:46,325 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2018-09-26 08:07:46,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:46,326 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-09-26 08:07:46,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:07:46,326 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-09-26 08:07:46,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-09-26 08:07:46,326 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:46,326 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 1, 1] [2018-09-26 08:07:46,327 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:46,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:46,327 INFO L82 PathProgramCache]: Analyzing trace with hash -335638338, now seen corresponding path program 79 times [2018-09-26 08:07:46,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:47,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:47,227 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:47,227 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:07:47,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:07:47,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:07:47,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=6806, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:07:47,228 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 84 states. [2018-09-26 08:07:48,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:48,795 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-09-26 08:07:48,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:07:48,795 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 161 [2018-09-26 08:07:48,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:48,796 INFO L225 Difference]: With dead ends: 166 [2018-09-26 08:07:48,796 INFO L226 Difference]: Without dead ends: 165 [2018-09-26 08:07:48,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=6806, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:07:48,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-26 08:07:48,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2018-09-26 08:07:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-09-26 08:07:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-09-26 08:07:48,976 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2018-09-26 08:07:48,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:48,976 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-09-26 08:07:48,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:07:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-09-26 08:07:48,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-09-26 08:07:48,977 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:48,977 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 1, 1] [2018-09-26 08:07:48,977 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:48,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:48,978 INFO L82 PathProgramCache]: Analyzing trace with hash -425894528, now seen corresponding path program 80 times [2018-09-26 08:07:48,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:50,005 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:50,005 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:07:50,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:07:50,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:07:50,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=6972, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:07:50,006 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 85 states. [2018-09-26 08:07:51,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:51,697 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-09-26 08:07:51,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:07:51,698 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 163 [2018-09-26 08:07:51,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:51,698 INFO L225 Difference]: With dead ends: 168 [2018-09-26 08:07:51,698 INFO L226 Difference]: Without dead ends: 167 [2018-09-26 08:07:51,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=6972, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:07:51,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-26 08:07:51,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-09-26 08:07:51,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-26 08:07:51,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-09-26 08:07:51,893 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2018-09-26 08:07:51,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:51,893 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-09-26 08:07:51,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:07:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-09-26 08:07:51,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-26 08:07:51,894 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:51,894 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 1, 1] [2018-09-26 08:07:51,894 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:51,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:51,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1262747198, now seen corresponding path program 81 times [2018-09-26 08:07:51,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:52,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:52,943 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:52,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:07:52,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:07:52,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:07:52,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=7140, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:07:52,944 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 86 states. [2018-09-26 08:07:54,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:54,716 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-09-26 08:07:54,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:07:54,716 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 165 [2018-09-26 08:07:54,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:54,717 INFO L225 Difference]: With dead ends: 170 [2018-09-26 08:07:54,717 INFO L226 Difference]: Without dead ends: 169 [2018-09-26 08:07:54,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=7140, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:07:54,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-26 08:07:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2018-09-26 08:07:54,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-09-26 08:07:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-09-26 08:07:54,943 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2018-09-26 08:07:54,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:54,943 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-09-26 08:07:54,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:07:54,943 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-09-26 08:07:54,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-09-26 08:07:54,944 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:54,944 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 1, 1] [2018-09-26 08:07:54,944 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:54,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:54,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1975688580, now seen corresponding path program 82 times [2018-09-26 08:07:54,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:56,053 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:56,053 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:07:56,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:07:56,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:07:56,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=7310, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:07:56,054 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 87 states. [2018-09-26 08:07:57,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:57,893 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-09-26 08:07:57,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:07:57,894 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 167 [2018-09-26 08:07:57,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:57,894 INFO L225 Difference]: With dead ends: 172 [2018-09-26 08:07:57,895 INFO L226 Difference]: Without dead ends: 171 [2018-09-26 08:07:57,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=7310, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:07:57,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-26 08:07:58,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2018-09-26 08:07:58,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-09-26 08:07:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-09-26 08:07:58,107 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2018-09-26 08:07:58,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:58,107 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-09-26 08:07:58,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:07:58,107 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-09-26 08:07:58,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-09-26 08:07:58,108 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:58,108 INFO L375 BasicCegarLoop]: trace histogram [84, 83, 1, 1] [2018-09-26 08:07:58,108 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:58,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:58,109 INFO L82 PathProgramCache]: Analyzing trace with hash 261181638, now seen corresponding path program 83 times [2018-09-26 08:07:58,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:59,363 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:59,363 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:07:59,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:07:59,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:07:59,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=7482, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:07:59,364 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 88 states. [2018-09-26 08:08:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:01,052 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-09-26 08:08:01,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:08:01,052 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 169 [2018-09-26 08:08:01,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:01,053 INFO L225 Difference]: With dead ends: 174 [2018-09-26 08:08:01,053 INFO L226 Difference]: Without dead ends: 173 [2018-09-26 08:08:01,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=174, Invalid=7482, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:08:01,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-09-26 08:08:01,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-09-26 08:08:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-09-26 08:08:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-09-26 08:08:01,248 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2018-09-26 08:08:01,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:01,249 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-09-26 08:08:01,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:08:01,249 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-09-26 08:08:01,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-09-26 08:08:01,249 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:01,250 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 1, 1] [2018-09-26 08:08:01,250 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:01,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:01,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1887452040, now seen corresponding path program 84 times [2018-09-26 08:08:01,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:02,302 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:02,302 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:08:02,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:08:02,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:08:02,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=7656, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:08:02,306 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 89 states. [2018-09-26 08:08:04,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:04,192 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-09-26 08:08:04,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:08:04,192 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 171 [2018-09-26 08:08:04,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:04,193 INFO L225 Difference]: With dead ends: 176 [2018-09-26 08:08:04,193 INFO L226 Difference]: Without dead ends: 175 [2018-09-26 08:08:04,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=7656, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:08:04,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-09-26 08:08:04,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2018-09-26 08:08:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-09-26 08:08:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-09-26 08:08:04,421 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2018-09-26 08:08:04,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:04,422 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-09-26 08:08:04,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:08:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-09-26 08:08:04,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-09-26 08:08:04,423 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:04,423 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 1, 1] [2018-09-26 08:08:04,423 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:04,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:04,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1365212618, now seen corresponding path program 85 times [2018-09-26 08:08:04,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:05,597 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:05,598 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:05,598 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:08:05,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:08:05,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:08:05,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=7832, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:08:05,599 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 90 states. [2018-09-26 08:08:07,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:07,355 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-09-26 08:08:07,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:08:07,355 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 173 [2018-09-26 08:08:07,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:07,356 INFO L225 Difference]: With dead ends: 178 [2018-09-26 08:08:07,356 INFO L226 Difference]: Without dead ends: 177 [2018-09-26 08:08:07,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=178, Invalid=7832, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:08:07,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-09-26 08:08:07,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2018-09-26 08:08:07,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-09-26 08:08:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-09-26 08:08:07,548 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2018-09-26 08:08:07,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:07,548 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-09-26 08:08:07,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:08:07,548 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-09-26 08:08:07,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-26 08:08:07,549 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:07,549 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 1, 1] [2018-09-26 08:08:07,549 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:07,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:07,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2004301708, now seen corresponding path program 86 times [2018-09-26 08:08:07,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:08,700 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:08,701 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:08:08,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:08:08,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:08:08,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=8010, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:08:08,702 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 91 states. [2018-09-26 08:08:10,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:10,521 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-09-26 08:08:10,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:08:10,521 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 175 [2018-09-26 08:08:10,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:10,522 INFO L225 Difference]: With dead ends: 180 [2018-09-26 08:08:10,522 INFO L226 Difference]: Without dead ends: 179 [2018-09-26 08:08:10,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=180, Invalid=8010, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:08:10,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-26 08:08:10,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2018-09-26 08:08:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-09-26 08:08:10,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-09-26 08:08:10,716 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2018-09-26 08:08:10,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:10,716 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-09-26 08:08:10,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:08:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-09-26 08:08:10,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-09-26 08:08:10,717 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:10,717 INFO L375 BasicCegarLoop]: trace histogram [88, 87, 1, 1] [2018-09-26 08:08:10,717 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:10,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:10,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1988593870, now seen corresponding path program 87 times [2018-09-26 08:08:10,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:11,780 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:11,780 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:08:11,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:08:11,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:08:11,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=8190, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:08:11,781 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 92 states. [2018-09-26 08:08:13,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:13,635 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-09-26 08:08:13,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:08:13,635 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 177 [2018-09-26 08:08:13,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:13,636 INFO L225 Difference]: With dead ends: 182 [2018-09-26 08:08:13,636 INFO L226 Difference]: Without dead ends: 181 [2018-09-26 08:08:13,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=8190, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:08:13,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-09-26 08:08:13,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2018-09-26 08:08:13,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-09-26 08:08:13,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-09-26 08:08:13,882 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2018-09-26 08:08:13,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:13,883 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-09-26 08:08:13,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:08:13,883 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-09-26 08:08:13,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-09-26 08:08:13,883 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:13,884 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 1, 1] [2018-09-26 08:08:13,884 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:13,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:13,884 INFO L82 PathProgramCache]: Analyzing trace with hash -221736560, now seen corresponding path program 88 times [2018-09-26 08:08:13,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:14,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:14,997 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:14,997 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:08:14,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:08:14,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:08:14,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=8372, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:08:14,998 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 93 states. [2018-09-26 08:08:17,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:17,008 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-09-26 08:08:17,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:08:17,009 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 179 [2018-09-26 08:08:17,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:17,009 INFO L225 Difference]: With dead ends: 184 [2018-09-26 08:08:17,010 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 08:08:17,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=184, Invalid=8372, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:08:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 08:08:17,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-09-26 08:08:17,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-09-26 08:08:17,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-09-26 08:08:17,231 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2018-09-26 08:08:17,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:17,231 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-09-26 08:08:17,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:08:17,231 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-09-26 08:08:17,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-09-26 08:08:17,232 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:17,233 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 1, 1] [2018-09-26 08:08:17,233 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:17,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:17,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1659531730, now seen corresponding path program 89 times [2018-09-26 08:08:17,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:18,488 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:18,488 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:08:18,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:08:18,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:08:18,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=8556, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:08:18,489 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 94 states. [2018-09-26 08:08:20,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:20,426 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-09-26 08:08:20,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:08:20,426 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 181 [2018-09-26 08:08:20,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:20,427 INFO L225 Difference]: With dead ends: 186 [2018-09-26 08:08:20,427 INFO L226 Difference]: Without dead ends: 185 [2018-09-26 08:08:20,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=186, Invalid=8556, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:08:20,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-09-26 08:08:20,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2018-09-26 08:08:20,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-09-26 08:08:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-09-26 08:08:20,635 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2018-09-26 08:08:20,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:20,635 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-09-26 08:08:20,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:08:20,635 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-09-26 08:08:20,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-09-26 08:08:20,636 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:20,636 INFO L375 BasicCegarLoop]: trace histogram [91, 90, 1, 1] [2018-09-26 08:08:20,636 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:20,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:20,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1377126804, now seen corresponding path program 90 times [2018-09-26 08:08:20,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:21,766 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:21,767 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:21,767 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:08:21,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:08:21,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:08:21,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=8742, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:08:21,768 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 95 states. [2018-09-26 08:08:23,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:23,755 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-09-26 08:08:23,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:08:23,756 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 183 [2018-09-26 08:08:23,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:23,756 INFO L225 Difference]: With dead ends: 188 [2018-09-26 08:08:23,756 INFO L226 Difference]: Without dead ends: 187 [2018-09-26 08:08:23,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=188, Invalid=8742, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:08:23,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-09-26 08:08:23,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2018-09-26 08:08:23,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-09-26 08:08:23,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-09-26 08:08:23,989 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2018-09-26 08:08:23,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:23,989 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-09-26 08:08:23,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:08:23,990 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-09-26 08:08:23,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-09-26 08:08:23,990 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:23,990 INFO L375 BasicCegarLoop]: trace histogram [92, 91, 1, 1] [2018-09-26 08:08:23,990 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:23,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:23,991 INFO L82 PathProgramCache]: Analyzing trace with hash 568932566, now seen corresponding path program 91 times [2018-09-26 08:08:23,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:25,240 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:25,240 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:25,240 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:08:25,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:08:25,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:08:25,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=8930, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:08:25,242 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 96 states. [2018-09-26 08:08:27,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:27,541 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-09-26 08:08:27,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:08:27,541 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 185 [2018-09-26 08:08:27,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:27,542 INFO L225 Difference]: With dead ends: 190 [2018-09-26 08:08:27,542 INFO L226 Difference]: Without dead ends: 189 [2018-09-26 08:08:27,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=190, Invalid=8930, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:08:27,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-09-26 08:08:27,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2018-09-26 08:08:27,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-09-26 08:08:27,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-09-26 08:08:27,771 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2018-09-26 08:08:27,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:27,771 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-09-26 08:08:27,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:08:27,771 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-09-26 08:08:27,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-09-26 08:08:27,772 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:27,772 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 1, 1] [2018-09-26 08:08:27,772 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:27,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:27,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1283350424, now seen corresponding path program 92 times [2018-09-26 08:08:27,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:29,029 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:29,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:08:29,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:08:29,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:08:29,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=9120, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:08:29,030 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 97 states. [2018-09-26 08:08:31,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:31,394 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-09-26 08:08:31,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:08:31,394 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 187 [2018-09-26 08:08:31,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:31,395 INFO L225 Difference]: With dead ends: 192 [2018-09-26 08:08:31,395 INFO L226 Difference]: Without dead ends: 191 [2018-09-26 08:08:31,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=192, Invalid=9120, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:08:31,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-09-26 08:08:31,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2018-09-26 08:08:31,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-09-26 08:08:31,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-09-26 08:08:31,623 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2018-09-26 08:08:31,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:31,623 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-09-26 08:08:31,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:08:31,623 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-09-26 08:08:31,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-09-26 08:08:31,623 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:31,624 INFO L375 BasicCegarLoop]: trace histogram [94, 93, 1, 1] [2018-09-26 08:08:31,624 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:31,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:31,624 INFO L82 PathProgramCache]: Analyzing trace with hash 644144602, now seen corresponding path program 93 times [2018-09-26 08:08:31,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:32,839 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:32,839 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:32,840 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:08:32,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:08:32,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:08:32,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=9312, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:08:32,841 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 98 states. [2018-09-26 08:08:34,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:34,956 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-09-26 08:08:34,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:08:34,956 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 189 [2018-09-26 08:08:34,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:34,957 INFO L225 Difference]: With dead ends: 194 [2018-09-26 08:08:34,957 INFO L226 Difference]: Without dead ends: 193 [2018-09-26 08:08:34,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=194, Invalid=9312, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:08:34,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-09-26 08:08:35,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2018-09-26 08:08:35,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-09-26 08:08:35,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-09-26 08:08:35,199 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2018-09-26 08:08:35,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:35,199 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-09-26 08:08:35,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:08:35,200 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-09-26 08:08:35,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-09-26 08:08:35,200 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:35,201 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 1, 1] [2018-09-26 08:08:35,201 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:35,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:35,201 INFO L82 PathProgramCache]: Analyzing trace with hash 547672988, now seen corresponding path program 94 times [2018-09-26 08:08:35,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:36,448 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:36,448 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:36,448 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:08:36,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:08:36,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:08:36,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=9506, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:08:36,449 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 99 states. [2018-09-26 08:08:38,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:38,722 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-09-26 08:08:38,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:08:38,722 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 191 [2018-09-26 08:08:38,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:38,723 INFO L225 Difference]: With dead ends: 196 [2018-09-26 08:08:38,723 INFO L226 Difference]: Without dead ends: 195 [2018-09-26 08:08:38,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=196, Invalid=9506, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:08:38,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-26 08:08:38,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2018-09-26 08:08:38,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-09-26 08:08:38,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-09-26 08:08:38,983 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2018-09-26 08:08:38,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:38,983 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-09-26 08:08:38,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:08:38,983 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-09-26 08:08:38,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-09-26 08:08:38,984 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:38,984 INFO L375 BasicCegarLoop]: trace histogram [96, 95, 1, 1] [2018-09-26 08:08:38,984 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:38,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:38,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1967234850, now seen corresponding path program 95 times [2018-09-26 08:08:38,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:40,439 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:40,439 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:08:40,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:08:40,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:08:40,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=9702, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:08:40,441 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 100 states. [2018-09-26 08:08:42,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:42,797 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-09-26 08:08:42,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:08:42,797 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 193 [2018-09-26 08:08:42,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:42,798 INFO L225 Difference]: With dead ends: 198 [2018-09-26 08:08:42,798 INFO L226 Difference]: Without dead ends: 197 [2018-09-26 08:08:42,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=198, Invalid=9702, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:08:42,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-09-26 08:08:43,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2018-09-26 08:08:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-09-26 08:08:43,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-09-26 08:08:43,066 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2018-09-26 08:08:43,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:43,067 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-09-26 08:08:43,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:08:43,067 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-09-26 08:08:43,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-26 08:08:43,068 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:43,068 INFO L375 BasicCegarLoop]: trace histogram [97, 96, 1, 1] [2018-09-26 08:08:43,068 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:43,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:43,069 INFO L82 PathProgramCache]: Analyzing trace with hash -727079520, now seen corresponding path program 96 times [2018-09-26 08:08:43,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:44,637 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:44,637 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:08:44,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:08:44,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:08:44,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=9900, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:08:44,638 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 101 states. [2018-09-26 08:08:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:46,940 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-09-26 08:08:46,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:08:46,940 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 195 [2018-09-26 08:08:46,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:46,941 INFO L225 Difference]: With dead ends: 200 [2018-09-26 08:08:46,941 INFO L226 Difference]: Without dead ends: 199 [2018-09-26 08:08:46,942 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=200, Invalid=9900, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:08:46,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-26 08:08:47,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2018-09-26 08:08:47,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-09-26 08:08:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-09-26 08:08:47,186 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 195 [2018-09-26 08:08:47,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:47,186 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-09-26 08:08:47,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:08:47,186 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-09-26 08:08:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-09-26 08:08:47,187 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:47,187 INFO L375 BasicCegarLoop]: trace histogram [98, 97, 1, 1] [2018-09-26 08:08:47,187 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:47,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:47,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1356251618, now seen corresponding path program 97 times [2018-09-26 08:08:47,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:48,603 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:48,603 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:08:48,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:08:48,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:08:48,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=10100, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:08:48,605 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 102 states. [2018-09-26 08:08:51,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:51,223 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-09-26 08:08:51,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:08:51,224 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 197 [2018-09-26 08:08:51,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:51,224 INFO L225 Difference]: With dead ends: 202 [2018-09-26 08:08:51,224 INFO L226 Difference]: Without dead ends: 201 [2018-09-26 08:08:51,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=202, Invalid=10100, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:08:51,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-09-26 08:08:51,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2018-09-26 08:08:51,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-09-26 08:08:51,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-09-26 08:08:51,501 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 197 [2018-09-26 08:08:51,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:51,501 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-09-26 08:08:51,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:08:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-09-26 08:08:51,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-09-26 08:08:51,502 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:51,502 INFO L375 BasicCegarLoop]: trace histogram [99, 98, 1, 1] [2018-09-26 08:08:51,502 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:51,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:51,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1982715300, now seen corresponding path program 98 times [2018-09-26 08:08:51,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:53,254 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:53,254 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:08:53,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:08:53,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:08:53,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=10302, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:08:53,255 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 103 states. [2018-09-26 08:08:55,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:55,636 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-09-26 08:08:55,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:08:55,636 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 199 [2018-09-26 08:08:55,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:55,637 INFO L225 Difference]: With dead ends: 204 [2018-09-26 08:08:55,637 INFO L226 Difference]: Without dead ends: 203 [2018-09-26 08:08:55,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=204, Invalid=10302, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:08:55,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-09-26 08:08:55,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2018-09-26 08:08:55,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-26 08:08:55,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-09-26 08:08:55,902 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 199 [2018-09-26 08:08:55,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:55,902 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-09-26 08:08:55,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:08:55,902 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-09-26 08:08:55,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-09-26 08:08:55,903 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:55,903 INFO L375 BasicCegarLoop]: trace histogram [100, 99, 1, 1] [2018-09-26 08:08:55,903 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:55,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:55,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1576075034, now seen corresponding path program 99 times [2018-09-26 08:08:55,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:57,285 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:57,285 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:57,286 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:08:57,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:08:57,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:08:57,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=10506, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:08:57,287 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 104 states. [2018-09-26 08:08:59,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:59,632 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-09-26 08:08:59,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:08:59,632 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 201 [2018-09-26 08:08:59,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:59,633 INFO L225 Difference]: With dead ends: 206 [2018-09-26 08:08:59,633 INFO L226 Difference]: Without dead ends: 205 [2018-09-26 08:08:59,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=206, Invalid=10506, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:08:59,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-09-26 08:08:59,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2018-09-26 08:08:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-09-26 08:08:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-09-26 08:08:59,892 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 201 [2018-09-26 08:08:59,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:59,892 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-09-26 08:08:59,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:08:59,892 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-09-26 08:08:59,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-09-26 08:08:59,893 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:59,893 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 1, 1] [2018-09-26 08:08:59,893 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:59,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:59,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1515348904, now seen corresponding path program 100 times [2018-09-26 08:08:59,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:01,323 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:01,324 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:09:01,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:09:01,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:09:01,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=10712, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:09:01,325 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 105 states. [2018-09-26 08:09:03,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:03,881 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-09-26 08:09:03,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 08:09:03,882 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 203 [2018-09-26 08:09:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:03,883 INFO L225 Difference]: With dead ends: 208 [2018-09-26 08:09:03,883 INFO L226 Difference]: Without dead ends: 207 [2018-09-26 08:09:03,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=208, Invalid=10712, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:09:03,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-09-26 08:09:04,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2018-09-26 08:09:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-09-26 08:09:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-09-26 08:09:04,150 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 203 [2018-09-26 08:09:04,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:04,150 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-09-26 08:09:04,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:09:04,150 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-09-26 08:09:04,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-26 08:09:04,151 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:04,151 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 1, 1] [2018-09-26 08:09:04,151 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:04,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:04,151 INFO L82 PathProgramCache]: Analyzing trace with hash 256384490, now seen corresponding path program 101 times [2018-09-26 08:09:04,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:05,690 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:05,691 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:09:05,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:09:05,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:09:05,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=10920, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:09:05,692 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 106 states. [2018-09-26 08:09:08,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:08,528 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-09-26 08:09:08,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:09:08,528 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 205 [2018-09-26 08:09:08,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:08,529 INFO L225 Difference]: With dead ends: 210 [2018-09-26 08:09:08,529 INFO L226 Difference]: Without dead ends: 209 [2018-09-26 08:09:08,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=210, Invalid=10920, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:09:08,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-26 08:09:08,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2018-09-26 08:09:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-09-26 08:09:08,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-09-26 08:09:08,828 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 205 [2018-09-26 08:09:08,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:08,828 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-09-26 08:09:08,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:09:08,828 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-09-26 08:09:08,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-09-26 08:09:08,829 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:08,829 INFO L375 BasicCegarLoop]: trace histogram [103, 102, 1, 1] [2018-09-26 08:09:08,829 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:08,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:08,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1572360108, now seen corresponding path program 102 times [2018-09-26 08:09:08,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:10,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:10,298 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:10,298 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:09:10,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-09-26 08:09:10,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-09-26 08:09:10,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=11130, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:09:10,299 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 107 states. [2018-09-26 08:09:12,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:12,854 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-09-26 08:09:12,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 08:09:12,854 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 207 [2018-09-26 08:09:12,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:12,855 INFO L225 Difference]: With dead ends: 212 [2018-09-26 08:09:12,855 INFO L226 Difference]: Without dead ends: 211 [2018-09-26 08:09:12,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=212, Invalid=11130, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:09:12,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-26 08:09:13,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2018-09-26 08:09:13,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-09-26 08:09:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-09-26 08:09:13,157 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 207 [2018-09-26 08:09:13,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:13,157 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-09-26 08:09:13,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-09-26 08:09:13,157 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-09-26 08:09:13,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-09-26 08:09:13,158 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:13,158 INFO L375 BasicCegarLoop]: trace histogram [104, 103, 1, 1] [2018-09-26 08:09:13,158 INFO L423 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:13,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:13,158 INFO L82 PathProgramCache]: Analyzing trace with hash -790423314, now seen corresponding path program 103 times [2018-09-26 08:09:13,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:14,886 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:14,886 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-09-26 08:09:14,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:09:14,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:09:14,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=11342, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:09:14,887 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 108 states. [2018-09-26 08:09:17,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:17,740 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-09-26 08:09:17,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:09:17,740 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 209 [2018-09-26 08:09:17,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:17,741 INFO L225 Difference]: With dead ends: 214 [2018-09-26 08:09:17,741 INFO L226 Difference]: Without dead ends: 213 [2018-09-26 08:09:17,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=214, Invalid=11342, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:09:17,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-09-26 08:09:18,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2018-09-26 08:09:18,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-09-26 08:09:18,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-09-26 08:09:18,041 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 209 [2018-09-26 08:09:18,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:18,041 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-09-26 08:09:18,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:09:18,041 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-09-26 08:09:18,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-09-26 08:09:18,042 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:18,042 INFO L375 BasicCegarLoop]: trace histogram [105, 104, 1, 1] [2018-09-26 08:09:18,042 INFO L423 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:18,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:18,043 INFO L82 PathProgramCache]: Analyzing trace with hash 612407728, now seen corresponding path program 104 times [2018-09-26 08:09:18,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:19,563 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:19,563 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:19,563 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:09:19,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-26 08:09:19,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-26 08:09:19,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=11556, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:09:19,565 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 109 states. [2018-09-26 08:09:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:22,242 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-09-26 08:09:22,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:09:22,242 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 211 [2018-09-26 08:09:22,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:22,242 INFO L225 Difference]: With dead ends: 216 [2018-09-26 08:09:22,243 INFO L226 Difference]: Without dead ends: 215 [2018-09-26 08:09:22,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=216, Invalid=11556, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:09:22,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-26 08:09:22,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2018-09-26 08:09:22,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-09-26 08:09:22,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2018-09-26 08:09:22,528 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 211 [2018-09-26 08:09:22,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:22,529 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2018-09-26 08:09:22,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-26 08:09:22,529 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2018-09-26 08:09:22,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-09-26 08:09:22,529 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:22,529 INFO L375 BasicCegarLoop]: trace histogram [106, 105, 1, 1] [2018-09-26 08:09:22,530 INFO L423 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:22,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:22,530 INFO L82 PathProgramCache]: Analyzing trace with hash 113308146, now seen corresponding path program 105 times [2018-09-26 08:09:22,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:24,242 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:24,243 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-09-26 08:09:24,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:09:24,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:09:24,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=11772, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:09:24,244 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 110 states. [2018-09-26 08:09:27,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:27,257 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-09-26 08:09:27,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:09:27,257 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 213 [2018-09-26 08:09:27,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:27,258 INFO L225 Difference]: With dead ends: 218 [2018-09-26 08:09:27,258 INFO L226 Difference]: Without dead ends: 217 [2018-09-26 08:09:27,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=218, Invalid=11772, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:09:27,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-09-26 08:09:27,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2018-09-26 08:09:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-09-26 08:09:27,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-09-26 08:09:27,585 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 213 [2018-09-26 08:09:27,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:27,585 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-09-26 08:09:27,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:09:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-09-26 08:09:27,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-09-26 08:09:27,586 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:27,586 INFO L375 BasicCegarLoop]: trace histogram [107, 106, 1, 1] [2018-09-26 08:09:27,586 INFO L423 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:27,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:27,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1514946996, now seen corresponding path program 106 times [2018-09-26 08:09:27,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:29,347 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:29,348 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:09:29,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-09-26 08:09:29,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-09-26 08:09:29,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=11990, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:09:29,349 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 111 states. [2018-09-26 08:09:32,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:32,356 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-09-26 08:09:32,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 08:09:32,356 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 215 [2018-09-26 08:09:32,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:32,357 INFO L225 Difference]: With dead ends: 220 [2018-09-26 08:09:32,357 INFO L226 Difference]: Without dead ends: 219 [2018-09-26 08:09:32,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=220, Invalid=11990, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:09:32,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-26 08:09:32,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 218. [2018-09-26 08:09:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-09-26 08:09:32,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-09-26 08:09:32,654 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 215 [2018-09-26 08:09:32,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:32,654 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-09-26 08:09:32,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-09-26 08:09:32,655 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-09-26 08:09:32,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-09-26 08:09:32,655 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:32,655 INFO L375 BasicCegarLoop]: trace histogram [108, 107, 1, 1] [2018-09-26 08:09:32,655 INFO L423 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:32,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:32,656 INFO L82 PathProgramCache]: Analyzing trace with hash -129849098, now seen corresponding path program 107 times [2018-09-26 08:09:32,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:34,255 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:34,255 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-09-26 08:09:34,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:09:34,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:09:34,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=12210, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:09:34,257 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 112 states. [2018-09-26 08:09:37,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:37,085 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-09-26 08:09:37,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:09:37,085 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 217 [2018-09-26 08:09:37,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:37,085 INFO L225 Difference]: With dead ends: 222 [2018-09-26 08:09:37,085 INFO L226 Difference]: Without dead ends: 221 [2018-09-26 08:09:37,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=222, Invalid=12210, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:09:37,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-09-26 08:09:37,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2018-09-26 08:09:37,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-09-26 08:09:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-09-26 08:09:37,389 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 217 [2018-09-26 08:09:37,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:37,389 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-09-26 08:09:37,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:09:37,390 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-09-26 08:09:37,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-09-26 08:09:37,390 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:37,390 INFO L375 BasicCegarLoop]: trace histogram [109, 108, 1, 1] [2018-09-26 08:09:37,390 INFO L423 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:37,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:37,391 INFO L82 PathProgramCache]: Analyzing trace with hash -230930504, now seen corresponding path program 108 times [2018-09-26 08:09:37,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:39,145 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:39,145 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:39,146 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:09:39,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-09-26 08:09:39,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-09-26 08:09:39,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=12432, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:09:39,147 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 113 states. [2018-09-26 08:09:42,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:42,105 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-09-26 08:09:42,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:09:42,105 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 219 [2018-09-26 08:09:42,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:42,106 INFO L225 Difference]: With dead ends: 224 [2018-09-26 08:09:42,106 INFO L226 Difference]: Without dead ends: 223 [2018-09-26 08:09:42,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=224, Invalid=12432, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:09:42,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-09-26 08:09:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 222. [2018-09-26 08:09:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-09-26 08:09:42,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-09-26 08:09:42,433 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 219 [2018-09-26 08:09:42,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:42,433 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-09-26 08:09:42,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-09-26 08:09:42,433 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-09-26 08:09:42,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-09-26 08:09:42,434 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:42,434 INFO L375 BasicCegarLoop]: trace histogram [110, 109, 1, 1] [2018-09-26 08:09:42,434 INFO L423 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:42,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:42,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1414086138, now seen corresponding path program 109 times [2018-09-26 08:09:42,434 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:44,138 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:44,138 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:44,138 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-09-26 08:09:44,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:09:44,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:09:44,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=12656, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:09:44,139 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 114 states. [2018-09-26 08:09:47,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:47,216 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-09-26 08:09:47,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:09:47,216 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 221 [2018-09-26 08:09:47,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:47,217 INFO L225 Difference]: With dead ends: 226 [2018-09-26 08:09:47,217 INFO L226 Difference]: Without dead ends: 225 [2018-09-26 08:09:47,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=226, Invalid=12656, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:09:47,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-26 08:09:47,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2018-09-26 08:09:47,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-09-26 08:09:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2018-09-26 08:09:47,569 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 221 [2018-09-26 08:09:47,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:47,569 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2018-09-26 08:09:47,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:09:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2018-09-26 08:09:47,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-09-26 08:09:47,570 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:47,570 INFO L375 BasicCegarLoop]: trace histogram [111, 110, 1, 1] [2018-09-26 08:09:47,570 INFO L423 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:47,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:47,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1727114172, now seen corresponding path program 110 times [2018-09-26 08:09:47,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:49,295 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:49,296 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:49,296 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:09:49,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-09-26 08:09:49,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-09-26 08:09:49,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=12882, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:09:49,297 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 115 states. [2018-09-26 08:09:52,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:52,351 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-09-26 08:09:52,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-26 08:09:52,351 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 223 [2018-09-26 08:09:52,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:52,352 INFO L225 Difference]: With dead ends: 228 [2018-09-26 08:09:52,352 INFO L226 Difference]: Without dead ends: 227 [2018-09-26 08:09:52,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=228, Invalid=12882, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:09:52,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-09-26 08:09:52,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2018-09-26 08:09:52,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-09-26 08:09:52,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-09-26 08:09:52,669 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 223 [2018-09-26 08:09:52,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:52,669 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-09-26 08:09:52,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-09-26 08:09:52,669 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-09-26 08:09:52,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-26 08:09:52,670 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:52,670 INFO L375 BasicCegarLoop]: trace histogram [112, 111, 1, 1] [2018-09-26 08:09:52,670 INFO L423 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:52,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:52,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1899344126, now seen corresponding path program 111 times [2018-09-26 08:09:52,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:54,420 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:54,420 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:54,421 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-09-26 08:09:54,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:09:54,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:09:54,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=13110, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:09:54,422 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 116 states. [2018-09-26 08:09:57,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:57,439 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-09-26 08:09:57,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:09:57,439 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 225 [2018-09-26 08:09:57,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:57,439 INFO L225 Difference]: With dead ends: 230 [2018-09-26 08:09:57,439 INFO L226 Difference]: Without dead ends: 229 [2018-09-26 08:09:57,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=230, Invalid=13110, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:09:57,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-26 08:09:57,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 228. [2018-09-26 08:09:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-09-26 08:09:57,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-09-26 08:09:57,767 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 225 [2018-09-26 08:09:57,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:57,767 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-09-26 08:09:57,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:09:57,767 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-09-26 08:09:57,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-09-26 08:09:57,768 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:57,768 INFO L375 BasicCegarLoop]: trace histogram [113, 112, 1, 1] [2018-09-26 08:09:57,769 INFO L423 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:57,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:57,769 INFO L82 PathProgramCache]: Analyzing trace with hash -91394624, now seen corresponding path program 112 times [2018-09-26 08:09:57,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:59,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:59,574 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:59,574 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:09:59,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-09-26 08:09:59,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-09-26 08:09:59,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=13340, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:09:59,575 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 117 states. [2018-09-26 08:10:02,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:02,944 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-09-26 08:10:02,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-26 08:10:02,944 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 227 [2018-09-26 08:10:02,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:02,945 INFO L225 Difference]: With dead ends: 232 [2018-09-26 08:10:02,945 INFO L226 Difference]: Without dead ends: 231 [2018-09-26 08:10:02,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=232, Invalid=13340, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:10:02,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-09-26 08:10:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 230. [2018-09-26 08:10:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-09-26 08:10:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-09-26 08:10:03,317 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 227 [2018-09-26 08:10:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:03,317 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-09-26 08:10:03,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-09-26 08:10:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-09-26 08:10:03,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-09-26 08:10:03,318 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:03,318 INFO L375 BasicCegarLoop]: trace histogram [114, 113, 1, 1] [2018-09-26 08:10:03,318 INFO L423 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:03,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:03,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1930886654, now seen corresponding path program 113 times [2018-09-26 08:10:03,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:05,309 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:05,310 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:05,310 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-09-26 08:10:05,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 08:10:05,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 08:10:05,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=13572, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:10:05,311 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 118 states. [2018-09-26 08:10:08,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:08,709 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-09-26 08:10:08,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:10:08,709 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 229 [2018-09-26 08:10:08,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:08,709 INFO L225 Difference]: With dead ends: 234 [2018-09-26 08:10:08,710 INFO L226 Difference]: Without dead ends: 233 [2018-09-26 08:10:08,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=234, Invalid=13572, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:10:08,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-09-26 08:10:09,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2018-09-26 08:10:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-09-26 08:10:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-09-26 08:10:09,084 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 229 [2018-09-26 08:10:09,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:09,084 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-09-26 08:10:09,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 08:10:09,084 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-09-26 08:10:09,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-09-26 08:10:09,085 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:09,085 INFO L375 BasicCegarLoop]: trace histogram [115, 114, 1, 1] [2018-09-26 08:10:09,085 INFO L423 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:09,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:09,085 INFO L82 PathProgramCache]: Analyzing trace with hash -156201532, now seen corresponding path program 114 times [2018-09-26 08:10:09,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:11,270 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:11,270 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:11,270 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-09-26 08:10:11,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-09-26 08:10:11,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-09-26 08:10:11,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=13806, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:10:11,271 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 119 states. [2018-09-26 08:10:14,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:14,637 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-09-26 08:10:14,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-09-26 08:10:14,637 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 231 [2018-09-26 08:10:14,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:14,638 INFO L225 Difference]: With dead ends: 236 [2018-09-26 08:10:14,638 INFO L226 Difference]: Without dead ends: 235 [2018-09-26 08:10:14,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=236, Invalid=13806, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:10:14,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-26 08:10:15,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2018-09-26 08:10:15,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-09-26 08:10:15,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2018-09-26 08:10:15,023 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 231 [2018-09-26 08:10:15,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:15,023 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2018-09-26 08:10:15,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-09-26 08:10:15,023 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2018-09-26 08:10:15,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-09-26 08:10:15,024 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:15,024 INFO L375 BasicCegarLoop]: trace histogram [116, 115, 1, 1] [2018-09-26 08:10:15,024 INFO L423 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:15,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:15,024 INFO L82 PathProgramCache]: Analyzing trace with hash 214184198, now seen corresponding path program 115 times [2018-09-26 08:10:15,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:17,232 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:17,233 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:17,233 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-09-26 08:10:17,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 08:10:17,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 08:10:17,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=14042, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:10:17,234 INFO L87 Difference]: Start difference. First operand 234 states and 234 transitions. Second operand 120 states. [2018-09-26 08:10:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:20,804 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-09-26 08:10:20,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-09-26 08:10:20,804 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 233 [2018-09-26 08:10:20,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:20,805 INFO L225 Difference]: With dead ends: 238 [2018-09-26 08:10:20,805 INFO L226 Difference]: Without dead ends: 237 [2018-09-26 08:10:20,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=238, Invalid=14042, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:10:20,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-26 08:10:21,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 236. [2018-09-26 08:10:21,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-09-26 08:10:21,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-09-26 08:10:21,222 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 233 [2018-09-26 08:10:21,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:21,223 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-09-26 08:10:21,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 08:10:21,223 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-09-26 08:10:21,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-09-26 08:10:21,224 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:21,224 INFO L375 BasicCegarLoop]: trace histogram [117, 116, 1, 1] [2018-09-26 08:10:21,224 INFO L423 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:21,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:21,224 INFO L82 PathProgramCache]: Analyzing trace with hash -327414840, now seen corresponding path program 116 times [2018-09-26 08:10:21,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-26 08:10:22,116 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:10:22,120 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:10:22,120 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:10:22 BoogieIcfgContainer [2018-09-26 08:10:22,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:10:22,122 INFO L168 Benchmark]: Toolchain (without parser) took 254069.05 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -313.8 MB). Peak memory consumption was 834.9 MB. Max. memory is 7.1 GB. [2018-09-26 08:10:22,123 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:10:22,123 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:10:22,123 INFO L168 Benchmark]: Boogie Preprocessor took 24.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:10:22,124 INFO L168 Benchmark]: RCFGBuilder took 207.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:10:22,124 INFO L168 Benchmark]: TraceAbstraction took 253782.13 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -324.4 MB). Peak memory consumption was 824.3 MB. Max. memory is 7.1 GB. [2018-09-26 08:10:22,127 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.22 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 48.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.38 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 207.73 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 253782.13 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -324.4 MB). Peak memory consumption was 824.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 236 with TraceHistMax 117, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 253.7s OverallTime, 117 OverallIterations, 117 TraceHistogramMax, 143.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 232 SDtfs, 233 SDslu, 0 SDs, 0 SdLazy, 1088682 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 100.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7017 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7017 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 73.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=116, 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: 16.4s AutomataMinimizationTime, 116 MinimizatonAttempts, 116 StatesRemovedByMinimization, 116 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 79.7s InterpolantComputationTime, 13688 NumberOfCodeBlocks, 13688 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 13572 ConstructedInterpolants, 0 QuantifiedInterpolants, 47191842 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 116 InterpolantComputations, 1 PerfectInterpolantSequences, 0/520260 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/divisibilityWithArray.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-10-22-138.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/divisibilityWithArray.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-10-22-138.csv Completed graceful shutdown