java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:35:17,229 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:35:17,231 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:35:17,249 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:35:17,249 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:35:17,251 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:35:17,255 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:35:17,257 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:35:17,259 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:35:17,262 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:35:17,263 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:35:17,263 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:35:17,266 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:35:17,267 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:35:17,268 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:35:17,271 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:35:17,272 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:35:17,276 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:35:17,287 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:35:17,290 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:35:17,294 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:35:17,295 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:35:17,298 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:35:17,298 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:35:17,300 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:35:17,301 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:35:17,302 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:35:17,303 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:35:17,304 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:35:17,305 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:35:17,305 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:35:17,306 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:35:17,306 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:35:17,309 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:35:17,310 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:35:17,311 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:35:17,311 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 13:35:17,326 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:35:17,326 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:35:17,331 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:35:17,331 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:35:17,332 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:35:17,332 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:35:17,332 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:35:17,332 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:35:17,394 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:35:17,409 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:35:17,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:35:17,418 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:35:17,418 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:35:17,419 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl [2018-07-25 13:35:17,420 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl' [2018-07-25 13:35:17,474 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:35:17,476 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:35:17,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:35:17,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:35:17,477 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:35:17,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:17" (1/1) ... [2018-07-25 13:35:17,509 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:17" (1/1) ... [2018-07-25 13:35:17,513 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 13:35:17,513 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 13:35:17,514 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 13:35:17,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:35:17,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:35:17,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:35:17,517 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:35:17,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:17" (1/1) ... [2018-07-25 13:35:17,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:17" (1/1) ... [2018-07-25 13:35:17,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:17" (1/1) ... [2018-07-25 13:35:17,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:17" (1/1) ... [2018-07-25 13:35:17,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:17" (1/1) ... [2018-07-25 13:35:17,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:17" (1/1) ... [2018-07-25 13:35:17,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:17" (1/1) ... [2018-07-25 13:35:17,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:35:17,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:35:17,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:35:17,540 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:35:17,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:17" (1/1) ... [2018-07-25 13:35:17,625 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-07-25 13:35:17,626 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-25 13:35:17,626 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-25 13:35:17,740 INFO L270 CfgBuilder]: Using library mode [2018-07-25 13:35:17,741 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:35:17 BoogieIcfgContainer [2018-07-25 13:35:17,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:35:17,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:35:17,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:35:17,746 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:35:17,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:17" (1/2) ... [2018-07-25 13:35:17,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b7bd7b and model type GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:35:17, skipping insertion in model container [2018-07-25 13:35:17,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:35:17" (2/2) ... [2018-07-25 13:35:17,750 INFO L112 eAbstractionObserver]: Analyzing ICFG GeometricalCake.bpl [2018-07-25 13:35:17,760 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:35:17,767 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:35:17,813 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:35:17,814 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:35:17,814 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:35:17,814 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:35:17,814 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:35:17,814 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:35:17,815 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:35:17,815 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:35:17,816 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:35:17,829 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2018-07-25 13:35:17,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-07-25 13:35:17,836 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:17,837 INFO L354 BasicCegarLoop]: trace histogram [1, 1] [2018-07-25 13:35:17,838 INFO L415 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:17,843 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-07-25 13:35:17,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:17,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:17,906 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:35:17,906 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-07-25 13:35:17,910 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:35:17,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:35:17,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:35:17,926 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2018-07-25 13:35:17,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:17,955 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-07-25 13:35:17,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:35:17,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-07-25 13:35:17,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:17,967 INFO L225 Difference]: With dead ends: 7 [2018-07-25 13:35:17,967 INFO L226 Difference]: Without dead ends: 4 [2018-07-25 13:35:17,971 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:35:17,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-07-25 13:35:18,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-07-25 13:35:18,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-07-25 13:35:18,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-07-25 13:35:18,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-07-25 13:35:18,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:18,015 INFO L472 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-07-25 13:35:18,015 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:35:18,016 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-07-25 13:35:18,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-25 13:35:18,016 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:18,016 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-25 13:35:18,017 INFO L415 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:18,017 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-07-25 13:35:18,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:18,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:18,042 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:18,043 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2018-07-25 13:35:18,046 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:35:18,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:35:18,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:35:18,049 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-07-25 13:35:18,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:18,096 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-07-25 13:35:18,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:35:18,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-07-25 13:35:18,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:18,099 INFO L225 Difference]: With dead ends: 6 [2018-07-25 13:35:18,099 INFO L226 Difference]: Without dead ends: 5 [2018-07-25 13:35:18,100 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:35:18,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-25 13:35:18,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-25 13:35:18,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-25 13:35:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-25 13:35:18,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-25 13:35:18,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:18,104 INFO L472 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-25 13:35:18,104 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:35:18,104 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-25 13:35:18,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:35:18,105 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:18,105 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-07-25 13:35:18,105 INFO L415 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:18,106 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-07-25 13:35:18,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:18,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:18,146 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:18,147 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 13:35:18,147 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:35:18,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:35:18,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:35:18,150 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-07-25 13:35:18,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:18,220 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-07-25 13:35:18,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:35:18,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-25 13:35:18,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:18,221 INFO L225 Difference]: With dead ends: 7 [2018-07-25 13:35:18,221 INFO L226 Difference]: Without dead ends: 6 [2018-07-25 13:35:18,222 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:35:18,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-25 13:35:18,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-25 13:35:18,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-25 13:35:18,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-25 13:35:18,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-25 13:35:18,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:18,231 INFO L472 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-25 13:35:18,232 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:35:18,232 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-25 13:35:18,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 13:35:18,232 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:18,233 INFO L354 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-07-25 13:35:18,233 INFO L415 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:18,234 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-07-25 13:35:18,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:18,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:18,299 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:18,300 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:35:18,300 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:35:18,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:35:18,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:35:18,301 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-07-25 13:35:18,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:18,445 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-25 13:35:18,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:35:18,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-07-25 13:35:18,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:18,446 INFO L225 Difference]: With dead ends: 8 [2018-07-25 13:35:18,447 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 13:35:18,447 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:35:18,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 13:35:18,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 13:35:18,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 13:35:18,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 13:35:18,453 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-25 13:35:18,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:18,454 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 13:35:18,454 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:35:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 13:35:18,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:35:18,455 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:18,455 INFO L354 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-07-25 13:35:18,455 INFO L415 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:18,455 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-07-25 13:35:18,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:18,498 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:18,499 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:35:18,499 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:35:18,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:35:18,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:35:18,501 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-07-25 13:35:18,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:18,651 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 13:35:18,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:35:18,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:35:18,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:18,653 INFO L225 Difference]: With dead ends: 9 [2018-07-25 13:35:18,653 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 13:35:18,654 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:35:18,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 13:35:18,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-25 13:35:18,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-25 13:35:18,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-25 13:35:18,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-25 13:35:18,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:18,659 INFO L472 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-25 13:35:18,659 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:35:18,659 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-25 13:35:18,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:35:18,660 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:18,660 INFO L354 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-07-25 13:35:18,660 INFO L415 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:18,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-07-25 13:35:18,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:18,714 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:18,714 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:35:18,714 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:35:18,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:35:18,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:35:18,715 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-07-25 13:35:18,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:18,852 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-25 13:35:18,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:35:18,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:35:18,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:18,854 INFO L225 Difference]: With dead ends: 10 [2018-07-25 13:35:18,854 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:35:18,855 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:35:18,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:35:18,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 13:35:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 13:35:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 13:35:18,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-25 13:35:18,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:18,861 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 13:35:18,861 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:35:18,861 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 13:35:18,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:35:18,862 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:18,862 INFO L354 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-07-25 13:35:18,862 INFO L415 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:18,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-07-25 13:35:18,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:18,910 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:18,911 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:18,911 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:35:18,911 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:35:18,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:35:18,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:35:18,912 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-07-25 13:35:19,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:19,073 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 13:35:19,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:35:19,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-07-25 13:35:19,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:19,074 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:35:19,074 INFO L226 Difference]: Without dead ends: 10 [2018-07-25 13:35:19,075 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:35:19,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-25 13:35:19,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-25 13:35:19,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-25 13:35:19,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-25 13:35:19,085 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-25 13:35:19,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:19,085 INFO L472 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-25 13:35:19,086 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:35:19,086 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-25 13:35:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 13:35:19,087 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:19,087 INFO L354 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-07-25 13:35:19,087 INFO L415 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:19,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-07-25 13:35:19,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:19,161 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:19,161 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:35:19,162 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:35:19,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:35:19,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:35:19,163 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-07-25 13:35:19,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:19,344 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-25 13:35:19,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:35:19,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-07-25 13:35:19,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:19,346 INFO L225 Difference]: With dead ends: 12 [2018-07-25 13:35:19,346 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:35:19,347 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:35:19,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:35:19,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:35:19,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:35:19,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 13:35:19,356 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-25 13:35:19,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:19,356 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 13:35:19,357 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:35:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 13:35:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:35:19,358 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:19,358 INFO L354 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-07-25 13:35:19,358 INFO L415 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:19,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-07-25 13:35:19,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:19,431 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:19,431 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:19,433 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:35:19,434 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:35:19,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:35:19,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:35:19,435 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-07-25 13:35:19,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:19,644 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 13:35:19,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:35:19,645 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-07-25 13:35:19,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:19,646 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:35:19,646 INFO L226 Difference]: Without dead ends: 12 [2018-07-25 13:35:19,647 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:35:19,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-25 13:35:19,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-25 13:35:19,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-25 13:35:19,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-25 13:35:19,656 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-25 13:35:19,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:19,657 INFO L472 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-25 13:35:19,657 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:35:19,657 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-25 13:35:19,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:35:19,658 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:19,658 INFO L354 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-07-25 13:35:19,658 INFO L415 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:19,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-07-25 13:35:19,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:19,752 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:19,752 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:35:19,752 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:35:19,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:35:19,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:35:19,753 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-07-25 13:35:20,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:20,020 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-25 13:35:20,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:35:20,020 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-07-25 13:35:20,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:20,021 INFO L225 Difference]: With dead ends: 14 [2018-07-25 13:35:20,021 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:35:20,022 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:35:20,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:35:20,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 13:35:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:35:20,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 13:35:20,028 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-25 13:35:20,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:20,029 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 13:35:20,029 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:35:20,029 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 13:35:20,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:35:20,030 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:20,030 INFO L354 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-07-25 13:35:20,031 INFO L415 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:20,031 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-07-25 13:35:20,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:20,130 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:20,131 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:20,131 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:35:20,131 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:35:20,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:35:20,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:35:20,132 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-07-25 13:35:20,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:20,484 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 13:35:20,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:35:20,485 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-07-25 13:35:20,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:20,487 INFO L225 Difference]: With dead ends: 15 [2018-07-25 13:35:20,487 INFO L226 Difference]: Without dead ends: 14 [2018-07-25 13:35:20,488 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:35:20,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-25 13:35:20,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-25 13:35:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-25 13:35:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-25 13:35:20,497 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-25 13:35:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:20,497 INFO L472 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-25 13:35:20,497 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:35:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-25 13:35:20,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:35:20,498 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:20,498 INFO L354 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-07-25 13:35:20,500 INFO L415 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:20,500 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-07-25 13:35:20,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:20,621 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:20,621 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:35:20,622 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:35:20,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:35:20,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:35:20,623 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-07-25 13:35:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:21,032 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-25 13:35:21,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:35:21,033 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-07-25 13:35:21,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:21,038 INFO L225 Difference]: With dead ends: 16 [2018-07-25 13:35:21,038 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 13:35:21,039 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:35:21,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 13:35:21,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 13:35:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:35:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 13:35:21,047 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-25 13:35:21,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:21,050 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 13:35:21,050 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:35:21,050 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 13:35:21,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:35:21,051 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:21,052 INFO L354 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-07-25 13:35:21,052 INFO L415 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:21,052 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-07-25 13:35:21,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:21,188 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:21,188 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:21,188 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:35:21,189 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:35:21,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:35:21,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:35:21,191 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-07-25 13:35:21,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:21,729 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 13:35:21,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:35:21,729 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-07-25 13:35:21,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:21,730 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:35:21,730 INFO L226 Difference]: Without dead ends: 16 [2018-07-25 13:35:21,731 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:35:21,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-25 13:35:21,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-25 13:35:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-25 13:35:21,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-25 13:35:21,747 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-25 13:35:21,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:21,748 INFO L472 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-25 13:35:21,748 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:35:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-25 13:35:21,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:35:21,749 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:21,749 INFO L354 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-07-25 13:35:21,751 INFO L415 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:21,751 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-07-25 13:35:21,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:21,957 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:21,959 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:21,959 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:35:21,959 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:35:21,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:35:21,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:35:21,960 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-07-25 13:35:22,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:22,588 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-25 13:35:22,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:35:22,588 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-07-25 13:35:22,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:22,589 INFO L225 Difference]: With dead ends: 18 [2018-07-25 13:35:22,589 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 13:35:22,590 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=575, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:35:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 13:35:22,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 13:35:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 13:35:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 13:35:22,602 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-07-25 13:35:22,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:22,602 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 13:35:22,603 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:35:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 13:35:22,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:35:22,603 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:22,603 INFO L354 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-07-25 13:35:22,604 INFO L415 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:22,604 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-07-25 13:35:22,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:22,756 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:22,757 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:35:22,757 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:35:22,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:35:22,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:35:22,758 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-07-25 13:35:23,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:23,450 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 13:35:23,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:35:23,450 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-07-25 13:35:23,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:23,451 INFO L225 Difference]: With dead ends: 19 [2018-07-25 13:35:23,451 INFO L226 Difference]: Without dead ends: 18 [2018-07-25 13:35:23,452 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=269, Invalid=661, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:35:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-25 13:35:23,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-25 13:35:23,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-25 13:35:23,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-25 13:35:23,459 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-07-25 13:35:23,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:23,459 INFO L472 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-25 13:35:23,459 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:35:23,460 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-25 13:35:23,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:35:23,460 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:23,460 INFO L354 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-07-25 13:35:23,460 INFO L415 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:23,461 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-07-25 13:35:23,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:23,622 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:23,623 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:23,623 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:35:23,623 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:35:23,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:35:23,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:35:23,624 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-07-25 13:35:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:24,483 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-25 13:35:24,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:35:24,483 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-07-25 13:35:24,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:24,484 INFO L225 Difference]: With dead ends: 20 [2018-07-25 13:35:24,484 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:35:24,485 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=303, Invalid=753, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:35:24,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:35:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 13:35:24,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 13:35:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 13:35:24,495 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-07-25 13:35:24,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:24,495 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 13:35:24,495 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:35:24,495 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 13:35:24,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:35:24,498 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:24,498 INFO L354 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-07-25 13:35:24,499 INFO L415 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:24,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-07-25 13:35:24,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:24,686 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:24,687 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:35:24,688 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 13:35:24,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 13:35:24,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:35:24,689 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-07-25 13:35:25,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:25,968 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 13:35:25,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:35:25,968 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-07-25 13:35:25,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:25,969 INFO L225 Difference]: With dead ends: 21 [2018-07-25 13:35:25,969 INFO L226 Difference]: Without dead ends: 20 [2018-07-25 13:35:25,970 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=339, Invalid=851, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:35:25,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-25 13:35:25,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-25 13:35:25,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-25 13:35:25,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-25 13:35:25,982 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-07-25 13:35:25,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:25,982 INFO L472 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-25 13:35:25,982 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 13:35:25,982 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-25 13:35:25,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:35:25,983 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:25,983 INFO L354 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-07-25 13:35:25,983 INFO L415 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:25,984 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-07-25 13:35:25,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:26,201 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:26,201 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 13:35:26,202 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 13:35:26,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 13:35:26,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:35:26,202 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-07-25 13:35:27,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:27,538 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-25 13:35:27,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:35:27,538 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-07-25 13:35:27,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:27,539 INFO L225 Difference]: With dead ends: 22 [2018-07-25 13:35:27,539 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 13:35:27,540 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=377, Invalid=955, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:35:27,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 13:35:27,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 13:35:27,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 13:35:27,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 13:35:27,549 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-07-25 13:35:27,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:27,550 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 13:35:27,550 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 13:35:27,550 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 13:35:27,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:35:27,551 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:27,551 INFO L354 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-07-25 13:35:27,551 INFO L415 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:27,552 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-07-25 13:35:27,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:27,801 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:27,801 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 13:35:27,801 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 13:35:27,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 13:35:27,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:35:27,802 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-07-25 13:35:29,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:29,381 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 13:35:29,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:35:29,381 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-07-25 13:35:29,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:29,382 INFO L225 Difference]: With dead ends: 23 [2018-07-25 13:35:29,382 INFO L226 Difference]: Without dead ends: 22 [2018-07-25 13:35:29,383 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=417, Invalid=1065, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:35:29,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-25 13:35:29,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-25 13:35:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-25 13:35:29,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-07-25 13:35:29,392 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-07-25 13:35:29,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:29,393 INFO L472 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-07-25 13:35:29,393 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 13:35:29,393 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-07-25 13:35:29,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:35:29,394 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:29,394 INFO L354 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-07-25 13:35:29,394 INFO L415 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:29,394 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-07-25 13:35:29,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:29,663 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:29,664 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 13:35:29,664 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 13:35:29,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 13:35:29,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:35:29,665 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-07-25 13:35:31,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:31,013 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-25 13:35:31,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:35:31,013 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-07-25 13:35:31,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:31,014 INFO L225 Difference]: With dead ends: 24 [2018-07-25 13:35:31,014 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 13:35:31,015 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=459, Invalid=1181, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:35:31,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 13:35:31,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 13:35:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 13:35:31,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 13:35:31,023 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-07-25 13:35:31,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:31,024 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 13:35:31,024 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 13:35:31,024 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 13:35:31,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:35:31,025 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:31,025 INFO L354 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-07-25 13:35:31,025 INFO L415 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:31,025 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-07-25 13:35:31,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:31,239 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:31,240 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:31,240 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 13:35:31,240 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 13:35:31,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 13:35:31,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:35:31,241 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-07-25 13:35:32,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:32,852 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 13:35:32,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:35:32,853 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-07-25 13:35:32,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:32,853 INFO L225 Difference]: With dead ends: 25 [2018-07-25 13:35:32,853 INFO L226 Difference]: Without dead ends: 24 [2018-07-25 13:35:32,855 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=503, Invalid=1303, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:35:32,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-25 13:35:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-07-25 13:35:32,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-25 13:35:32,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-07-25 13:35:32,863 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-07-25 13:35:32,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:32,864 INFO L472 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-07-25 13:35:32,864 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 13:35:32,864 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-07-25 13:35:32,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:35:32,864 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:32,865 INFO L354 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-07-25 13:35:32,865 INFO L415 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:32,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-07-25 13:35:32,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:33,102 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:33,102 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:33,102 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 13:35:33,103 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 13:35:33,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 13:35:33,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:35:33,104 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-07-25 13:35:34,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:34,990 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-25 13:35:34,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:35:34,990 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-07-25 13:35:34,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:34,991 INFO L225 Difference]: With dead ends: 26 [2018-07-25 13:35:34,991 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 13:35:34,992 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=549, Invalid=1431, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:35:34,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 13:35:35,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 13:35:35,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 13:35:35,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 13:35:35,002 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-07-25 13:35:35,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:35,002 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 13:35:35,002 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 13:35:35,002 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 13:35:35,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 13:35:35,003 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:35,003 INFO L354 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-07-25 13:35:35,003 INFO L415 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:35,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-07-25 13:35:35,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:35,431 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:35,432 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:35,432 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 13:35:35,432 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 13:35:35,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 13:35:35,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:35:35,433 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-07-25 13:35:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:37,653 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 13:35:37,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 13:35:37,653 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-07-25 13:35:37,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:37,653 INFO L225 Difference]: With dead ends: 27 [2018-07-25 13:35:37,653 INFO L226 Difference]: Without dead ends: 26 [2018-07-25 13:35:37,655 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=597, Invalid=1565, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:35:37,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-25 13:35:37,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-25 13:35:37,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-25 13:35:37,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-25 13:35:37,664 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-07-25 13:35:37,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:37,667 INFO L472 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-25 13:35:37,668 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 13:35:37,668 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-25 13:35:37,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:35:37,668 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:37,668 INFO L354 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-07-25 13:35:37,669 INFO L415 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:37,669 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-07-25 13:35:37,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:37,984 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:37,985 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:37,985 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 13:35:37,985 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 13:35:37,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 13:35:37,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:35:37,986 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-07-25 13:35:40,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:40,403 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-07-25 13:35:40,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:35:40,403 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-07-25 13:35:40,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:40,403 INFO L225 Difference]: With dead ends: 28 [2018-07-25 13:35:40,404 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 13:35:40,405 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=647, Invalid=1705, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:35:40,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 13:35:40,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 13:35:40,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 13:35:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 13:35:40,414 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-07-25 13:35:40,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:40,414 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 13:35:40,414 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 13:35:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 13:35:40,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 13:35:40,415 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:40,415 INFO L354 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-07-25 13:35:40,415 INFO L415 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:40,415 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-07-25 13:35:40,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:40,781 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:40,781 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:40,782 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 13:35:40,782 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 13:35:40,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 13:35:40,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:35:40,783 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-07-25 13:35:40,911 WARN L169 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 12 [2018-07-25 13:35:43,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:43,735 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 13:35:43,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:35:43,735 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-07-25 13:35:43,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:43,736 INFO L225 Difference]: With dead ends: 29 [2018-07-25 13:35:43,736 INFO L226 Difference]: Without dead ends: 28 [2018-07-25 13:35:43,737 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=699, Invalid=1851, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:35:43,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-25 13:35:43,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-25 13:35:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-25 13:35:43,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-07-25 13:35:43,746 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-07-25 13:35:43,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:43,747 INFO L472 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-07-25 13:35:43,747 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 13:35:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-07-25 13:35:43,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-25 13:35:43,748 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:43,748 INFO L354 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-07-25 13:35:43,748 INFO L415 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:43,748 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-07-25 13:35:43,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:44,119 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:44,119 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:44,119 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 13:35:44,120 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 13:35:44,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 13:35:44,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:35:44,120 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-07-25 13:35:47,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:47,289 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-25 13:35:47,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:35:47,289 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-07-25 13:35:47,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:47,290 INFO L225 Difference]: With dead ends: 30 [2018-07-25 13:35:47,290 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 13:35:47,291 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=753, Invalid=2003, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:35:47,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 13:35:47,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 13:35:47,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 13:35:47,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 13:35:47,299 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-07-25 13:35:47,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:47,299 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 13:35:47,299 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 13:35:47,299 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 13:35:47,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 13:35:47,300 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:47,300 INFO L354 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-07-25 13:35:47,300 INFO L415 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:47,300 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-07-25 13:35:47,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:47,723 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:47,723 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:47,723 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 13:35:47,723 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 13:35:47,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 13:35:47,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:35:47,724 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-07-25 13:35:51,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:51,813 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 13:35:51,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:35:51,814 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-07-25 13:35:51,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:51,814 INFO L225 Difference]: With dead ends: 31 [2018-07-25 13:35:51,814 INFO L226 Difference]: Without dead ends: 30 [2018-07-25 13:35:51,815 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=809, Invalid=2161, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:35:51,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-25 13:35:51,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-25 13:35:51,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-25 13:35:51,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-07-25 13:35:51,823 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-07-25 13:35:51,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:51,824 INFO L472 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-07-25 13:35:51,824 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 13:35:51,824 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-07-25 13:35:51,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-25 13:35:51,825 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:51,825 INFO L354 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-07-25 13:35:51,825 INFO L415 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:51,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-07-25 13:35:51,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:52,447 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:52,447 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 13:35:52,447 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 13:35:52,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 13:35:52,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:35:52,448 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-07-25 13:35:57,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:57,315 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-07-25 13:35:57,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:35:57,315 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-07-25 13:35:57,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:57,316 INFO L225 Difference]: With dead ends: 32 [2018-07-25 13:35:57,316 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 13:35:57,317 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=867, Invalid=2325, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:35:57,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 13:35:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 13:35:57,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 13:35:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 13:35:57,337 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-07-25 13:35:57,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:57,337 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 13:35:57,337 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 13:35:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 13:35:57,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 13:35:57,338 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:57,338 INFO L354 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-07-25 13:35:57,338 INFO L415 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:57,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-07-25 13:35:57,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:57,888 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:57,888 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:57,889 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 13:35:57,889 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 13:35:57,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 13:35:57,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:35:57,890 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-07-25 13:36:03,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:03,260 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 13:36:03,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:36:03,260 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-07-25 13:36:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:03,261 INFO L225 Difference]: With dead ends: 33 [2018-07-25 13:36:03,261 INFO L226 Difference]: Without dead ends: 32 [2018-07-25 13:36:03,262 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=927, Invalid=2495, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:36:03,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-25 13:36:03,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-25 13:36:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-25 13:36:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-25 13:36:03,274 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-07-25 13:36:03,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:03,274 INFO L472 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-25 13:36:03,274 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 13:36:03,274 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-25 13:36:03,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-25 13:36:03,275 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:03,275 INFO L354 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-07-25 13:36:03,275 INFO L415 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:03,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-07-25 13:36:03,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:03,875 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:03,875 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:03,875 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 13:36:03,876 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 13:36:03,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 13:36:03,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:36:03,877 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-07-25 13:36:09,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:09,643 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-07-25 13:36:09,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 13:36:09,643 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-07-25 13:36:09,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:09,644 INFO L225 Difference]: With dead ends: 34 [2018-07-25 13:36:09,644 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 13:36:09,646 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=989, Invalid=2671, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:36:09,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 13:36:09,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 13:36:09,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 13:36:09,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 13:36:09,658 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-07-25 13:36:09,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:09,658 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 13:36:09,658 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 13:36:09,658 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 13:36:09,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 13:36:09,659 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:09,659 INFO L354 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-07-25 13:36:09,659 INFO L415 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:09,659 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-07-25 13:36:09,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:10,319 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:10,319 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 13:36:10,319 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 13:36:10,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 13:36:10,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:36:10,320 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-07-25 13:36:10,473 WARN L169 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-07-25 13:36:11,034 WARN L169 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-07-25 13:36:11,558 WARN L169 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 12 [2018-07-25 13:36:17,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:17,758 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 13:36:17,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 13:36:17,759 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-07-25 13:36:17,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:17,759 INFO L225 Difference]: With dead ends: 35 [2018-07-25 13:36:17,759 INFO L226 Difference]: Without dead ends: 34 [2018-07-25 13:36:17,761 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1053, Invalid=2853, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:36:17,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-25 13:36:17,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-25 13:36:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-25 13:36:17,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-07-25 13:36:17,783 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-07-25 13:36:17,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:17,783 INFO L472 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-07-25 13:36:17,783 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 13:36:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-07-25 13:36:17,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-25 13:36:17,784 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:17,784 INFO L354 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-07-25 13:36:17,784 INFO L415 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:17,785 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-07-25 13:36:17,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:18,454 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:18,454 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 13:36:18,454 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 13:36:18,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 13:36:18,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:36:18,455 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-07-25 13:36:27,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:27,430 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-25 13:36:27,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:36:27,430 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-07-25 13:36:27,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:27,430 INFO L225 Difference]: With dead ends: 36 [2018-07-25 13:36:27,430 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 13:36:27,432 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1119, Invalid=3041, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:36:27,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 13:36:27,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 13:36:27,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 13:36:27,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 13:36:27,442 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-07-25 13:36:27,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:27,442 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 13:36:27,443 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 13:36:27,443 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 13:36:27,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 13:36:27,443 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:27,443 INFO L354 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-07-25 13:36:27,443 INFO L415 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:27,444 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-07-25 13:36:27,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:28,181 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:28,182 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:28,182 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 13:36:28,182 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 13:36:28,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 13:36:28,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:36:28,183 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-07-25 13:36:28,320 WARN L169 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 12 [2018-07-25 13:36:28,472 WARN L169 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 12 [2018-07-25 13:36:28,678 WARN L169 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-07-25 13:36:29,142 WARN L169 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 12 [2018-07-25 13:36:29,406 WARN L169 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-07-25 13:36:30,033 WARN L169 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 12 [2018-07-25 13:36:30,407 WARN L169 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 12 [2018-07-25 13:36:37,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:37,374 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 13:36:37,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 13:36:37,374 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-07-25 13:36:37,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:37,375 INFO L225 Difference]: With dead ends: 37 [2018-07-25 13:36:37,375 INFO L226 Difference]: Without dead ends: 36 [2018-07-25 13:36:37,376 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1187, Invalid=3235, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:36:37,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-25 13:36:37,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-25 13:36:37,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-25 13:36:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-25 13:36:37,389 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-07-25 13:36:37,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:37,389 INFO L472 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-25 13:36:37,389 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 13:36:37,389 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-25 13:36:37,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-25 13:36:37,390 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:37,390 INFO L354 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-07-25 13:36:37,390 INFO L415 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:37,390 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-07-25 13:36:37,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:38,204 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:38,204 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:38,204 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 13:36:38,204 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 13:36:38,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 13:36:38,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:36:38,205 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-07-25 13:36:38,350 WARN L169 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 12 [2018-07-25 13:36:38,502 WARN L169 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 12 [2018-07-25 13:36:38,722 WARN L169 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 12 [2018-07-25 13:36:38,967 WARN L169 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-07-25 13:36:39,229 WARN L169 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 12 [2018-07-25 13:36:39,776 WARN L169 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-07-25 13:36:40,110 WARN L169 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 12 [2018-07-25 13:36:48,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:48,228 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-07-25 13:36:48,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:36:48,228 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-07-25 13:36:48,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:48,229 INFO L225 Difference]: With dead ends: 38 [2018-07-25 13:36:48,229 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 13:36:48,230 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=1257, Invalid=3435, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:36:48,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 13:36:48,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 13:36:48,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 13:36:48,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 13:36:48,242 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-07-25 13:36:48,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:48,242 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 13:36:48,242 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 13:36:48,242 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 13:36:48,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 13:36:48,243 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:48,243 INFO L354 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-07-25 13:36:48,243 INFO L415 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:48,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-07-25 13:36:48,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:49,146 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:49,146 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 13:36:49,146 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 13:36:49,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 13:36:49,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:36:49,147 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-07-25 13:36:49,325 WARN L169 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 12 [2018-07-25 13:36:49,537 WARN L169 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 12 [2018-07-25 13:36:49,807 WARN L169 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 12 [2018-07-25 13:36:50,077 WARN L169 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 12 [2018-07-25 13:36:50,380 WARN L169 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-07-25 13:36:51,130 WARN L169 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 12 [2018-07-25 13:36:51,550 WARN L169 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-07-25 13:36:52,004 WARN L169 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 12 [2018-07-25 13:36:52,474 WARN L169 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 12 [2018-07-25 13:36:52,977 WARN L169 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 12 [2018-07-25 13:36:53,963 WARN L169 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 12 [2018-07-25 13:37:01,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:01,980 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 13:37:01,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 13:37:01,980 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-07-25 13:37:01,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:01,981 INFO L225 Difference]: With dead ends: 39 [2018-07-25 13:37:01,981 INFO L226 Difference]: Without dead ends: 38 [2018-07-25 13:37:01,981 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=1329, Invalid=3641, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:37:01,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-25 13:37:01,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-25 13:37:01,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-25 13:37:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-25 13:37:01,991 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-07-25 13:37:01,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:01,991 INFO L472 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-25 13:37:01,991 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 13:37:01,991 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-25 13:37:01,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-25 13:37:01,992 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:01,992 INFO L354 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-07-25 13:37:01,992 INFO L415 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:01,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-07-25 13:37:01,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:03,052 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:03,052 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 13:37:03,052 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 13:37:03,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 13:37:03,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:37:03,053 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-07-25 13:37:03,246 WARN L169 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 12 [2018-07-25 13:37:03,427 WARN L169 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 12 [2018-07-25 13:37:03,699 WARN L169 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 12 [2018-07-25 13:37:03,997 WARN L169 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 12 [2018-07-25 13:37:04,292 WARN L169 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 12 [2018-07-25 13:37:04,731 WARN L169 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-07-25 13:37:05,207 WARN L169 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 12 [2018-07-25 13:37:05,664 WARN L169 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 12 [2018-07-25 13:37:06,124 WARN L169 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-07-25 13:37:06,613 WARN L169 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 12 [2018-07-25 13:37:07,539 WARN L169 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 12 [2018-07-25 13:37:15,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:15,906 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-25 13:37:15,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 13:37:15,906 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-07-25 13:37:15,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:15,907 INFO L225 Difference]: With dead ends: 40 [2018-07-25 13:37:15,907 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 13:37:15,908 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=1403, Invalid=3853, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:37:15,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 13:37:15,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 13:37:15,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 13:37:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 13:37:15,921 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-07-25 13:37:15,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:15,921 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 13:37:15,921 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 13:37:15,921 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 13:37:15,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 13:37:15,922 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:15,922 INFO L354 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-07-25 13:37:15,922 INFO L415 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:15,922 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-07-25 13:37:15,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:16,998 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:16,998 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 13:37:16,998 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 13:37:16,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 13:37:16,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:37:16,999 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-07-25 13:37:17,204 WARN L169 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 12 [2018-07-25 13:37:17,421 WARN L169 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 12 [2018-07-25 13:37:17,691 WARN L169 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 12 [2018-07-25 13:37:17,952 WARN L169 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 12 [2018-07-25 13:37:18,334 WARN L169 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 12 [2018-07-25 13:37:18,724 WARN L169 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 12 [2018-07-25 13:37:19,189 WARN L169 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-07-25 13:37:19,633 WARN L169 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 12 [2018-07-25 13:37:20,094 WARN L169 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 12 [2018-07-25 13:37:20,596 WARN L169 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-07-25 13:37:21,078 WARN L169 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 12 [2018-07-25 13:37:21,587 WARN L169 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 12 [2018-07-25 13:37:31,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:31,233 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 13:37:31,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 13:37:31,234 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-07-25 13:37:31,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:31,234 INFO L225 Difference]: With dead ends: 41 [2018-07-25 13:37:31,234 INFO L226 Difference]: Without dead ends: 40 [2018-07-25 13:37:31,235 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=1479, Invalid=4071, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:37:31,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-25 13:37:31,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-25 13:37:31,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-25 13:37:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-07-25 13:37:31,244 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-07-25 13:37:31,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:31,244 INFO L472 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-07-25 13:37:31,244 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 13:37:31,244 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-07-25 13:37:31,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-25 13:37:31,245 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:31,245 INFO L354 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-07-25 13:37:31,245 INFO L415 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:31,245 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-07-25 13:37:31,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:32,440 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:32,440 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:32,440 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 13:37:32,441 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 13:37:32,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 13:37:32,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:37:32,441 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-07-25 13:37:32,630 WARN L169 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 12 [2018-07-25 13:37:32,901 WARN L169 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 12 [2018-07-25 13:37:33,239 WARN L169 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 12 [2018-07-25 13:37:33,601 WARN L169 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 12 [2018-07-25 13:37:33,948 WARN L169 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 12 [2018-07-25 13:37:34,332 WARN L169 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 12 [2018-07-25 13:37:34,731 WARN L169 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 12 [2018-07-25 13:37:35,178 WARN L169 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-07-25 13:37:35,659 WARN L169 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 12 [2018-07-25 13:37:36,151 WARN L169 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 12 [2018-07-25 13:37:36,687 WARN L169 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-07-25 13:37:38,342 WARN L169 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 12 [2018-07-25 13:37:48,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:48,338 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-25 13:37:48,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 13:37:48,338 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-07-25 13:37:48,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:48,338 INFO L225 Difference]: With dead ends: 42 [2018-07-25 13:37:48,339 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 13:37:48,339 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=1557, Invalid=4295, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:37:48,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 13:37:48,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 13:37:48,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 13:37:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 13:37:48,351 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-07-25 13:37:48,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:48,351 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 13:37:48,351 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 13:37:48,351 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 13:37:48,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 13:37:48,351 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:48,351 INFO L354 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-07-25 13:37:48,352 INFO L415 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:48,352 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-07-25 13:37:48,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:49,682 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:49,682 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 13:37:49,682 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 13:37:49,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 13:37:49,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:37:49,683 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-07-25 13:37:49,983 WARN L169 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 12 [2018-07-25 13:37:50,298 WARN L169 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 12 [2018-07-25 13:37:50,673 WARN L169 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 12 [2018-07-25 13:37:51,113 WARN L169 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 12 [2018-07-25 13:37:51,591 WARN L169 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 12 [2018-07-25 13:37:52,110 WARN L169 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 12 [2018-07-25 13:37:52,633 WARN L169 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 12 [2018-07-25 13:37:53,258 WARN L169 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 12 [2018-07-25 13:37:53,896 WARN L169 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-07-25 13:37:54,529 WARN L169 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 12 [2018-07-25 13:37:55,250 WARN L169 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 12 [2018-07-25 13:37:56,029 WARN L169 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-07-25 13:37:56,782 WARN L169 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 12 [2018-07-25 13:37:57,515 WARN L169 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 12 [2018-07-25 13:37:58,255 WARN L169 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 12 [2018-07-25 13:37:58,887 WARN L169 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 12 [2018-07-25 13:37:59,532 WARN L169 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 12 [2018-07-25 13:38:00,224 WARN L169 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 12 [2018-07-25 13:38:00,869 WARN L169 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 12 [2018-07-25 13:38:09,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:09,250 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 13:38:09,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 13:38:09,250 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-07-25 13:38:09,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:09,250 INFO L225 Difference]: With dead ends: 43 [2018-07-25 13:38:09,250 INFO L226 Difference]: Without dead ends: 42 [2018-07-25 13:38:09,251 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=1637, Invalid=4525, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:38:09,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-25 13:38:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-07-25 13:38:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-25 13:38:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-07-25 13:38:09,266 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-07-25 13:38:09,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:09,266 INFO L472 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-07-25 13:38:09,266 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 13:38:09,266 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-07-25 13:38:09,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-25 13:38:09,267 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:09,267 INFO L354 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-07-25 13:38:09,267 INFO L415 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:09,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-07-25 13:38:09,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:38:10,681 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:38:10,681 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:38:10,681 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 13:38:10,682 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 13:38:10,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 13:38:10,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:38:10,682 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-07-25 13:38:10,909 WARN L169 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 12 [2018-07-25 13:38:11,258 WARN L169 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 12 [2018-07-25 13:38:11,616 WARN L169 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 12 [2018-07-25 13:38:11,994 WARN L169 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 12 [2018-07-25 13:38:12,396 WARN L169 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 12 [2018-07-25 13:38:12,867 WARN L169 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 12 [2018-07-25 13:38:13,349 WARN L169 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 12 [2018-07-25 13:38:13,856 WARN L169 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 12 [2018-07-25 13:38:14,356 WARN L169 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 12 [2018-07-25 13:38:14,879 WARN L169 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-07-25 13:38:15,543 WARN L169 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 12 [2018-07-25 13:38:16,321 WARN L169 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 12 [2018-07-25 13:38:17,133 WARN L169 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-07-25 13:38:17,933 WARN L169 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 12 [2018-07-25 13:38:18,695 WARN L169 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 12 [2018-07-25 13:38:19,617 WARN L169 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 12 [2018-07-25 13:38:20,497 WARN L169 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 12 [2018-07-25 13:38:21,346 WARN L169 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 12 [2018-07-25 13:38:22,195 WARN L169 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 12 [2018-07-25 13:38:23,003 WARN L169 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 12 [2018-07-25 13:38:32,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:32,443 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-07-25 13:38:32,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 13:38:32,443 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-07-25 13:38:32,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:32,443 INFO L225 Difference]: With dead ends: 44 [2018-07-25 13:38:32,443 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 13:38:32,444 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=1719, Invalid=4761, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:38:32,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 13:38:32,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 13:38:32,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 13:38:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 13:38:32,459 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-07-25 13:38:32,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:32,460 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 13:38:32,460 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 13:38:32,460 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 13:38:32,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 13:38:32,460 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:32,460 INFO L354 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-07-25 13:38:32,461 INFO L415 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:32,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-07-25 13:38:32,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:38:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:38:33,994 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:38:33,994 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 13:38:33,994 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 13:38:33,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 13:38:33,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:38:33,994 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-07-25 13:38:34,268 WARN L169 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 12 [2018-07-25 13:38:34,544 WARN L169 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 12 [2018-07-25 13:38:34,876 WARN L169 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 12 [2018-07-25 13:38:35,246 WARN L169 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 12 [2018-07-25 13:38:35,675 WARN L169 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 12 [2018-07-25 13:38:36,096 WARN L169 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 12 [2018-07-25 13:38:36,756 WARN L169 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 12 [2018-07-25 13:38:37,427 WARN L169 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 12 [2018-07-25 13:38:38,124 WARN L169 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 12 [2018-07-25 13:38:38,820 WARN L169 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 12 [2018-07-25 13:38:39,498 WARN L169 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-07-25 13:38:40,375 WARN L169 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 12 [2018-07-25 13:38:41,251 WARN L169 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 12 [2018-07-25 13:38:42,076 WARN L169 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-07-25 13:38:42,867 WARN L169 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 12 [2018-07-25 13:38:43,618 WARN L169 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 12 [2018-07-25 13:38:44,527 WARN L169 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 12 [2018-07-25 13:38:46,373 WARN L169 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 12 [2018-07-25 13:38:47,449 WARN L169 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 12 [2018-07-25 13:38:49,598 WARN L169 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 12 [2018-07-25 13:38:59,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:59,456 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 13:38:59,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 13:38:59,456 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-07-25 13:38:59,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:59,457 INFO L225 Difference]: With dead ends: 45 [2018-07-25 13:38:59,457 INFO L226 Difference]: Without dead ends: 44 [2018-07-25 13:38:59,457 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=1803, Invalid=5003, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:38:59,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-25 13:38:59,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-25 13:38:59,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-25 13:38:59,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-25 13:38:59,469 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-07-25 13:38:59,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:59,469 INFO L472 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-25 13:38:59,469 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 13:38:59,469 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-25 13:38:59,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-25 13:38:59,470 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:59,470 INFO L354 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-07-25 13:38:59,470 INFO L415 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:59,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-07-25 13:38:59,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:39:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:39:01,124 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:39:01,124 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 13:39:01,125 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 13:39:01,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 13:39:01,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:39:01,125 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-07-25 13:39:01,399 WARN L169 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 292 DAG size of output: 12 [2018-07-25 13:39:01,681 WARN L169 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 12 [2018-07-25 13:39:02,035 WARN L169 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 12 [2018-07-25 13:39:02,411 WARN L169 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 12 [2018-07-25 13:39:03,018 WARN L169 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 12 [2018-07-25 13:39:03,669 WARN L169 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 12 [2018-07-25 13:39:04,379 WARN L169 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 12 [2018-07-25 13:39:05,099 WARN L169 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 12 [2018-07-25 13:39:05,940 WARN L169 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 12 [2018-07-25 13:39:06,764 WARN L169 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 12 [2018-07-25 13:39:07,614 WARN L169 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 12 [2018-07-25 13:39:08,456 WARN L169 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-07-25 13:39:09,342 WARN L169 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 12 [2018-07-25 13:39:10,339 WARN L169 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 12 [2018-07-25 13:39:11,381 WARN L169 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-07-25 13:39:12,387 WARN L169 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 12 [2018-07-25 13:39:13,330 WARN L169 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 12 [2018-07-25 13:39:14,216 WARN L169 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 12 [2018-07-25 13:39:15,295 WARN L169 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 12 [2018-07-25 13:39:16,293 WARN L169 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 12 [2018-07-25 13:39:17,213 WARN L169 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 12 [2018-07-25 13:39:28,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:39:28,686 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-07-25 13:39:28,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 13:39:28,686 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-07-25 13:39:28,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:39:28,687 INFO L225 Difference]: With dead ends: 46 [2018-07-25 13:39:28,687 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 13:39:28,687 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=1889, Invalid=5251, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:39:28,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 13:39:28,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 13:39:28,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 13:39:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 13:39:28,699 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-07-25 13:39:28,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:39:28,699 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 13:39:28,699 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 13:39:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 13:39:28,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 13:39:28,700 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:39:28,700 INFO L354 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-07-25 13:39:28,700 INFO L415 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:39:28,700 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-07-25 13:39:28,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:39:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:39:30,500 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:39:30,501 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:39:30,501 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 13:39:30,501 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 13:39:30,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 13:39:30,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:39:30,502 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-07-25 13:39:30,853 WARN L169 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 12 [2018-07-25 13:39:31,282 WARN L169 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 292 DAG size of output: 12 [2018-07-25 13:39:31,651 WARN L169 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 12 [2018-07-25 13:39:32,051 WARN L169 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 12 [2018-07-25 13:39:32,523 WARN L169 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 12 [2018-07-25 13:39:32,991 WARN L169 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 12 [2018-07-25 13:39:33,616 WARN L169 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 12 [2018-07-25 13:39:34,373 WARN L169 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 12 [2018-07-25 13:39:35,201 WARN L169 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 12 [2018-07-25 13:39:35,985 WARN L169 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 12 [2018-07-25 13:39:36,760 WARN L169 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 12 [2018-07-25 13:39:37,573 WARN L169 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 12 [2018-07-25 13:39:38,341 WARN L169 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 12 [2018-07-25 13:39:39,322 WARN L169 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 12 [2018-07-25 13:39:40,270 WARN L169 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 12 [2018-07-25 13:39:41,163 WARN L169 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 12 [2018-07-25 13:39:42,005 WARN L169 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 12 [2018-07-25 13:39:42,859 WARN L169 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 12 [2018-07-25 13:39:43,630 WARN L169 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 12 Received shutdown request... [2018-07-25 13:39:55,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 13:39:55,395 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 13:39:55,400 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 13:39:55,400 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:39:55 BoogieIcfgContainer [2018-07-25 13:39:55,400 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:39:55,401 INFO L168 Benchmark]: Toolchain (without parser) took 277926.51 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -93.3 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 223.6 MB). Peak memory consumption was 130.3 MB. Max. memory is 7.1 GB. [2018-07-25 13:39:55,403 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:39:55,403 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:39:55,406 INFO L168 Benchmark]: Boogie Preprocessor took 23.14 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:39:55,406 INFO L168 Benchmark]: RCFGBuilder took 200.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 13:39:55,407 INFO L168 Benchmark]: TraceAbstraction took 277658.21 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -93.3 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 213.1 MB). Peak memory consumption was 119.7 MB. Max. memory is 7.1 GB. [2018-07-25 13:39:55,409 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.19 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 39.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.14 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 200.96 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 277658.21 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -93.3 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 213.1 MB). Peak memory consumption was 119.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 21). Cancelled while BasicCegarLoop was constructing difference of abstraction (45states) and interpolant automaton (currently 37 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 277.5s OverallTime, 43 OverallIterations, 42 TraceHistogramMax, 255.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 85 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 1886 SolverSat, 902 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1843 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1842 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12108 ImplicationChecksByTransitivity, 268.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 42 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 20.2s InterpolantComputationTime, 989 NumberOfCodeBlocks, 989 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 946 ConstructedInterpolants, 0 QuantifiedInterpolants, 241230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 1 PerfectInterpolantSequences, 0/13244 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/GeometricalCake.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-39-55-428.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GeometricalCake.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-39-55-428.csv Completed graceful shutdown