java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEquality-Safe.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:50:58,497 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:50:58,499 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:50:58,511 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:50:58,512 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:50:58,513 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:50:58,514 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:50:58,516 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:50:58,517 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:50:58,518 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:50:58,519 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:50:58,519 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:50:58,520 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:50:58,521 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:50:58,522 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:50:58,523 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:50:58,524 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:50:58,526 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:50:58,530 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:50:58,532 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:50:58,535 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:50:58,540 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:50:58,542 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:50:58,543 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:50:58,543 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:50:58,547 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:50:58,548 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:50:58,549 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:50:58,553 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:50:58,556 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:50:58,556 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:50:58,557 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:50:58,557 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:50:58,557 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:50:58,558 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:50:58,561 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:50:58,562 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 13:50:58,588 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:50:58,588 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:50:58,589 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:50:58,590 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:50:58,590 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:50:58,590 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:50:58,590 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:50:58,590 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:50:58,638 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:50:58,654 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:50:58,658 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:50:58,660 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:50:58,661 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:50:58,662 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEquality-Safe.bpl [2018-07-23 13:50:58,662 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEquality-Safe.bpl' [2018-07-23 13:50:58,713 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:50:58,714 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:50:58,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:50:58,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:50:58,716 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:50:58,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:58" (1/1) ... [2018-07-23 13:50:58,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:58" (1/1) ... [2018-07-23 13:50:58,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:58" (1/1) ... [2018-07-23 13:50:58,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:58" (1/1) ... [2018-07-23 13:50:58,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:58" (1/1) ... [2018-07-23 13:50:58,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:58" (1/1) ... [2018-07-23 13:50:58,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:58" (1/1) ... [2018-07-23 13:50:58,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:50:58,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:50:58,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:50:58,769 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:50:58,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:58" (1/1) ... [2018-07-23 13:50:58,856 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-07-23 13:50:58,856 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-23 13:50:58,857 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-23 13:50:58,993 INFO L258 CfgBuilder]: Using library mode [2018-07-23 13:50:58,994 INFO L202 PluginConnector]: Adding new model HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:50:58 BoogieIcfgContainer [2018-07-23 13:50:58,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:50:58,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:50:58,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:50:59,000 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:50:59,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:50:58" (1/2) ... [2018-07-23 13:50:59,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38185e52 and model type HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:50:59, skipping insertion in model container [2018-07-23 13:50:59,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:50:58" (2/2) ... [2018-07-23 13:50:59,004 INFO L112 eAbstractionObserver]: Analyzing ICFG HiddenEquality-Safe.bpl [2018-07-23 13:50:59,015 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:50:59,024 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:50:59,076 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:50:59,077 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:50:59,078 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:50:59,078 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:50:59,078 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:50:59,078 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:50:59,079 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:50:59,079 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:50:59,079 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:50:59,095 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2018-07-23 13:50:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-07-23 13:50:59,104 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:59,106 INFO L357 BasicCegarLoop]: trace histogram [1, 1] [2018-07-23 13:50:59,106 INFO L414 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:50:59,112 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-07-23 13:50:59,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:59,185 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-23 13:50:59,188 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:50:59,188 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-07-23 13:50:59,190 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:59,191 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-23 13:50:59,191 INFO L185 omatonBuilderFactory]: Interpolants [7#true, 8#false, 9#(<= main_x 0)] [2018-07-23 13:50:59,191 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-23 13:50:59,193 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:50:59,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:50:59,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:50:59,212 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2018-07-23 13:50:59,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:59,242 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-07-23 13:50:59,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:50:59,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-07-23 13:50:59,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:59,258 INFO L225 Difference]: With dead ends: 7 [2018-07-23 13:50:59,258 INFO L226 Difference]: Without dead ends: 4 [2018-07-23 13:50:59,265 INFO L575 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-23 13:50:59,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-07-23 13:50:59,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-07-23 13:50:59,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-07-23 13:50:59,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-07-23 13:50:59,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-07-23 13:50:59,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:59,302 INFO L471 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-07-23 13:50:59,303 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:50:59,303 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-07-23 13:50:59,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-23 13:50:59,303 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:59,304 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-23 13:50:59,304 INFO L414 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:50:59,304 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-07-23 13:50:59,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:59,330 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-23 13:50:59,330 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:59,330 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2018-07-23 13:50:59,331 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:59,331 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-23 13:50:59,331 INFO L185 omatonBuilderFactory]: Interpolants [32#true, 33#false, 34#(<= main_x 0), 35#(<= main_x 1)] [2018-07-23 13:50:59,331 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-23 13:50:59,334 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:50:59,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:50:59,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:50:59,335 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-07-23 13:50:59,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:59,359 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-07-23 13:50:59,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:50:59,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-07-23 13:50:59,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:59,364 INFO L225 Difference]: With dead ends: 6 [2018-07-23 13:50:59,365 INFO L226 Difference]: Without dead ends: 5 [2018-07-23 13:50:59,366 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:50:59,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-23 13:50:59,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-23 13:50:59,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-23 13:50:59,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-23 13:50:59,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-23 13:50:59,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:59,372 INFO L471 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-23 13:50:59,373 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:50:59,373 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-23 13:50:59,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:50:59,373 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:59,374 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-07-23 13:50:59,374 INFO L414 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:50:59,374 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-07-23 13:50:59,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:59,400 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-23 13:50:59,401 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:59,401 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:50:59,401 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:59,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:50:59,402 INFO L185 omatonBuilderFactory]: Interpolants [58#true, 59#false, 60#(<= main_x 0), 61#(<= main_x 1), 62#(<= main_x 2)] [2018-07-23 13:50:59,402 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-23 13:50:59,403 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:50:59,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:50:59,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:50:59,404 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-07-23 13:50:59,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:59,416 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-07-23 13:50:59,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:50:59,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-23 13:50:59,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:59,417 INFO L225 Difference]: With dead ends: 7 [2018-07-23 13:50:59,417 INFO L226 Difference]: Without dead ends: 6 [2018-07-23 13:50:59,418 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:50:59,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-23 13:50:59,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-23 13:50:59,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-23 13:50:59,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-23 13:50:59,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-23 13:50:59,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:59,421 INFO L471 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-23 13:50:59,421 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:50:59,422 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-23 13:50:59,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-23 13:50:59,422 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:59,422 INFO L357 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-07-23 13:50:59,423 INFO L414 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:50:59,423 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-07-23 13:50:59,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:59,480 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-23 13:50:59,481 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:59,481 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:50:59,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:59,482 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-23 13:50:59,482 INFO L185 omatonBuilderFactory]: Interpolants [89#true, 90#false, 91#(<= main_x 0), 92#(<= main_x 1), 93#(<= main_x 2), 94#(<= main_x 3)] [2018-07-23 13:50:59,482 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-23 13:50:59,483 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:50:59,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:50:59,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:50:59,484 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-07-23 13:50:59,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:59,504 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-23 13:50:59,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:50:59,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-07-23 13:50:59,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:59,506 INFO L225 Difference]: With dead ends: 8 [2018-07-23 13:50:59,506 INFO L226 Difference]: Without dead ends: 7 [2018-07-23 13:50:59,507 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:50:59,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-23 13:50:59,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-23 13:50:59,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:50:59,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 13:50:59,513 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-23 13:50:59,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:59,513 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 13:50:59,513 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:50:59,513 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 13:50:59,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:50:59,514 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:59,514 INFO L357 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-07-23 13:50:59,514 INFO L414 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:50:59,514 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-07-23 13:50:59,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:59,570 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-23 13:50:59,570 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:59,570 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:50:59,570 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:59,571 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-23 13:50:59,571 INFO L185 omatonBuilderFactory]: Interpolants [128#(<= main_x 1), 129#(<= main_x 2), 130#(<= main_x 3), 131#(<= main_x 4), 125#true, 126#false, 127#(<= main_x 0)] [2018-07-23 13:50:59,571 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-23 13:50:59,572 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:50:59,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:50:59,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:50:59,573 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-07-23 13:50:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:59,584 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-23 13:50:59,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:50:59,585 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:50:59,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:59,585 INFO L225 Difference]: With dead ends: 9 [2018-07-23 13:50:59,586 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 13:50:59,586 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:50:59,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 13:50:59,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-23 13:50:59,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-23 13:50:59,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-23 13:50:59,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-23 13:50:59,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:59,590 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-23 13:50:59,590 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:50:59,590 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-23 13:50:59,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:50:59,590 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:59,591 INFO L357 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-07-23 13:50:59,591 INFO L414 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:50:59,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-07-23 13:50:59,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:59,634 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-23 13:50:59,635 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:59,635 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:50:59,635 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:59,635 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-23 13:50:59,636 INFO L185 omatonBuilderFactory]: Interpolants [166#true, 167#false, 168#(<= main_x 0), 169#(<= main_x 1), 170#(<= main_x 2), 171#(<= main_x 3), 172#(<= main_x 4), 173#(<= main_x 5)] [2018-07-23 13:50:59,636 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-23 13:50:59,636 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:50:59,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:50:59,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:50:59,637 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-07-23 13:50:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:59,664 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-23 13:50:59,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:50:59,665 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:50:59,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:59,665 INFO L225 Difference]: With dead ends: 10 [2018-07-23 13:50:59,665 INFO L226 Difference]: Without dead ends: 9 [2018-07-23 13:50:59,669 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:50:59,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-23 13:50:59,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-23 13:50:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:50:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 13:50:59,676 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-23 13:50:59,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:59,677 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 13:50:59,677 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:50:59,677 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 13:50:59,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:50:59,678 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:59,678 INFO L357 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-07-23 13:50:59,678 INFO L414 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:50:59,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-07-23 13:50:59,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:59,725 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-23 13:50:59,726 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:59,726 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:50:59,726 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:59,727 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-23 13:50:59,727 INFO L185 omatonBuilderFactory]: Interpolants [212#true, 213#false, 214#(<= main_x 0), 215#(<= main_x 1), 216#(<= main_x 2), 217#(<= main_x 3), 218#(<= main_x 4), 219#(<= main_x 5), 220#(<= main_x 6)] [2018-07-23 13:50:59,727 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-23 13:50:59,727 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:50:59,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:50:59,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:50:59,729 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-07-23 13:50:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:59,742 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-23 13:50:59,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:50:59,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-07-23 13:50:59,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:59,743 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:50:59,743 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 13:50:59,744 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:50:59,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 13:50:59,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-23 13:50:59,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-23 13:50:59,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-23 13:50:59,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-23 13:50:59,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:59,748 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-23 13:50:59,748 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:50:59,748 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-23 13:50:59,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 13:50:59,749 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:59,749 INFO L357 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-07-23 13:50:59,749 INFO L414 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:50:59,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-07-23 13:50:59,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:59,800 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-23 13:50:59,801 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:59,801 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:50:59,801 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:59,802 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-23 13:50:59,802 INFO L185 omatonBuilderFactory]: Interpolants [272#(<= main_x 7), 263#true, 264#false, 265#(<= main_x 0), 266#(<= main_x 1), 267#(<= main_x 2), 268#(<= main_x 3), 269#(<= main_x 4), 270#(<= main_x 5), 271#(<= main_x 6)] [2018-07-23 13:50:59,802 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-23 13:50:59,803 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:50:59,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:50:59,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:50:59,804 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-07-23 13:50:59,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:59,817 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-23 13:50:59,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:50:59,817 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-07-23 13:50:59,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:59,818 INFO L225 Difference]: With dead ends: 12 [2018-07-23 13:50:59,818 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 13:50:59,819 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:50:59,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 13:50:59,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 13:50:59,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:50:59,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:50:59,823 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-23 13:50:59,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:59,823 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:50:59,823 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:50:59,824 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:50:59,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:50:59,824 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:59,824 INFO L357 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-07-23 13:50:59,825 INFO L414 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:50:59,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-07-23 13:50:59,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:59,877 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-23 13:50:59,878 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:59,878 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:50:59,878 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:59,878 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-23 13:50:59,879 INFO L185 omatonBuilderFactory]: Interpolants [320#false, 321#(<= main_x 0), 322#(<= main_x 1), 323#(<= main_x 2), 324#(<= main_x 3), 325#(<= main_x 4), 326#(<= main_x 5), 327#(<= main_x 6), 328#(<= main_x 7), 329#(<= main_x 8), 319#true] [2018-07-23 13:50:59,879 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-23 13:50:59,879 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:50:59,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:50:59,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:50:59,883 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-07-23 13:50:59,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:59,904 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 13:50:59,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:50:59,905 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-07-23 13:50:59,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:59,906 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:50:59,906 INFO L226 Difference]: Without dead ends: 12 [2018-07-23 13:50:59,906 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:50:59,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-23 13:50:59,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-23 13:50:59,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-23 13:50:59,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-23 13:50:59,910 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-23 13:50:59,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:59,911 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-23 13:50:59,911 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:50:59,913 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-23 13:50:59,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:50:59,914 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:59,914 INFO L357 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-07-23 13:50:59,914 INFO L414 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:50:59,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-07-23 13:50:59,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:50:59,959 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-23 13:50:59,959 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:50:59,959 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:50:59,960 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:50:59,960 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-23 13:50:59,960 INFO L185 omatonBuilderFactory]: Interpolants [384#(<= main_x 2), 385#(<= main_x 3), 386#(<= main_x 4), 387#(<= main_x 5), 388#(<= main_x 6), 389#(<= main_x 7), 390#(<= main_x 8), 391#(<= main_x 9), 380#true, 381#false, 382#(<= main_x 0), 383#(<= main_x 1)] [2018-07-23 13:50:59,961 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-23 13:50:59,961 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:50:59,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:50:59,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:50:59,962 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-07-23 13:50:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:50:59,976 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-23 13:50:59,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:50:59,977 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-07-23 13:50:59,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:50:59,978 INFO L225 Difference]: With dead ends: 14 [2018-07-23 13:50:59,978 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 13:50:59,978 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:50:59,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 13:50:59,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 13:50:59,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 13:50:59,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 13:50:59,982 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-23 13:50:59,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:50:59,983 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 13:50:59,983 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:50:59,983 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 13:50:59,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:50:59,984 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:50:59,984 INFO L357 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-07-23 13:50:59,984 INFO L414 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:50:59,984 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-07-23 13:50:59,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:50:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:00,070 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-23 13:51:00,071 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:00,071 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:51:00,071 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:00,071 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-23 13:51:00,072 INFO L185 omatonBuilderFactory]: Interpolants [448#(<= main_x 0), 449#(<= main_x 1), 450#(<= main_x 2), 451#(<= main_x 3), 452#(<= main_x 4), 453#(<= main_x 5), 454#(<= main_x 6), 455#(<= main_x 7), 456#(<= main_x 8), 457#(<= main_x 9), 458#(<= main_x 10), 446#true, 447#false] [2018-07-23 13:51:00,072 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-23 13:51:00,074 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:51:00,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:51:00,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:51:00,076 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-07-23 13:51:00,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:00,115 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 13:51:00,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:51:00,116 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-07-23 13:51:00,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:00,117 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:51:00,117 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 13:51:00,117 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:51:00,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 13:51:00,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-23 13:51:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-23 13:51:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-23 13:51:00,123 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-23 13:51:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:00,123 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-23 13:51:00,123 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:51:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-23 13:51:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:51:00,125 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:00,125 INFO L357 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-07-23 13:51:00,126 INFO L414 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:00,126 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-07-23 13:51:00,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:00,214 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-23 13:51:00,214 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:00,214 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:51:00,214 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:00,215 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-23 13:51:00,215 INFO L185 omatonBuilderFactory]: Interpolants [517#true, 518#false, 519#(<= main_x 0), 520#(<= main_x 1), 521#(<= main_x 2), 522#(<= main_x 3), 523#(<= main_x 4), 524#(<= main_x 5), 525#(<= main_x 6), 526#(<= main_x 7), 527#(<= main_x 8), 528#(<= main_x 9), 529#(<= main_x 10), 530#(<= main_x 11)] [2018-07-23 13:51:00,216 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-23 13:51:00,216 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:51:00,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:51:00,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:51:00,217 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-07-23 13:51:00,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:00,228 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-23 13:51:00,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:51:00,229 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-07-23 13:51:00,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:00,232 INFO L225 Difference]: With dead ends: 16 [2018-07-23 13:51:00,233 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 13:51:00,233 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:51:00,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 13:51:00,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-23 13:51:00,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:51:00,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 13:51:00,242 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-23 13:51:00,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:00,242 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 13:51:00,242 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:51:00,243 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 13:51:00,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:51:00,246 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:00,246 INFO L357 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-07-23 13:51:00,247 INFO L414 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:00,247 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-07-23 13:51:00,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:00,305 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-23 13:51:00,306 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:00,306 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:51:00,306 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:00,307 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-23 13:51:00,307 INFO L185 omatonBuilderFactory]: Interpolants [593#true, 594#false, 595#(<= main_x 0), 596#(<= main_x 1), 597#(<= main_x 2), 598#(<= main_x 3), 599#(<= main_x 4), 600#(<= main_x 5), 601#(<= main_x 6), 602#(<= main_x 7), 603#(<= main_x 8), 604#(<= main_x 9), 605#(<= main_x 10), 606#(<= main_x 11), 607#(<= main_x 12)] [2018-07-23 13:51:00,307 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-23 13:51:00,308 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:51:00,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:51:00,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:51:00,309 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-07-23 13:51:00,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:00,322 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-23 13:51:00,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:51:00,322 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-07-23 13:51:00,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:00,323 INFO L225 Difference]: With dead ends: 17 [2018-07-23 13:51:00,323 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 13:51:00,324 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:51:00,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 13:51:00,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-23 13:51:00,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-23 13:51:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-23 13:51:00,328 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-23 13:51:00,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:00,328 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-23 13:51:00,329 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:51:00,329 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-23 13:51:00,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:51:00,329 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:00,330 INFO L357 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-07-23 13:51:00,330 INFO L414 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:00,330 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-07-23 13:51:00,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:00,395 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-23 13:51:00,395 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:00,395 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:51:00,395 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:00,396 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-23 13:51:00,397 INFO L185 omatonBuilderFactory]: Interpolants [674#true, 675#false, 676#(<= main_x 0), 677#(<= main_x 1), 678#(<= main_x 2), 679#(<= main_x 3), 680#(<= main_x 4), 681#(<= main_x 5), 682#(<= main_x 6), 683#(<= main_x 7), 684#(<= main_x 8), 685#(<= main_x 9), 686#(<= main_x 10), 687#(<= main_x 11), 688#(<= main_x 12), 689#(<= main_x 13)] [2018-07-23 13:51:00,397 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-23 13:51:00,398 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:51:00,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:51:00,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:51:00,399 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-07-23 13:51:00,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:00,417 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-23 13:51:00,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:51:00,418 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-07-23 13:51:00,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:00,418 INFO L225 Difference]: With dead ends: 18 [2018-07-23 13:51:00,418 INFO L226 Difference]: Without dead ends: 17 [2018-07-23 13:51:00,419 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:51:00,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-23 13:51:00,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-23 13:51:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-23 13:51:00,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-23 13:51:00,427 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-07-23 13:51:00,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:00,428 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-23 13:51:00,428 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:51:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-23 13:51:00,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:51:00,429 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:00,429 INFO L357 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-07-23 13:51:00,429 INFO L414 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:00,429 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-07-23 13:51:00,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:00,486 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-23 13:51:00,487 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:00,487 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:51:00,487 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:00,488 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-23 13:51:00,488 INFO L185 omatonBuilderFactory]: Interpolants [768#(<= main_x 6), 769#(<= main_x 7), 770#(<= main_x 8), 771#(<= main_x 9), 772#(<= main_x 10), 773#(<= main_x 11), 774#(<= main_x 12), 775#(<= main_x 13), 776#(<= main_x 14), 760#true, 761#false, 762#(<= main_x 0), 763#(<= main_x 1), 764#(<= main_x 2), 765#(<= main_x 3), 766#(<= main_x 4), 767#(<= main_x 5)] [2018-07-23 13:51:00,488 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-23 13:51:00,489 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 13:51:00,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 13:51:00,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:51:00,490 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-07-23 13:51:00,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:00,502 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-23 13:51:00,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:51:00,503 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-07-23 13:51:00,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:00,503 INFO L225 Difference]: With dead ends: 19 [2018-07-23 13:51:00,504 INFO L226 Difference]: Without dead ends: 18 [2018-07-23 13:51:00,504 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:51:00,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-23 13:51:00,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-23 13:51:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-23 13:51:00,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-23 13:51:00,508 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-07-23 13:51:00,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:00,509 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-23 13:51:00,509 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 13:51:00,509 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-23 13:51:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:51:00,510 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:00,510 INFO L357 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-07-23 13:51:00,510 INFO L414 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:00,510 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-07-23 13:51:00,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:00,566 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-23 13:51:00,567 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:00,567 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 13:51:00,567 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:00,568 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-23 13:51:00,568 INFO L185 omatonBuilderFactory]: Interpolants [864#(<= main_x 11), 865#(<= main_x 12), 866#(<= main_x 13), 867#(<= main_x 14), 868#(<= main_x 15), 851#true, 852#false, 853#(<= main_x 0), 854#(<= main_x 1), 855#(<= main_x 2), 856#(<= main_x 3), 857#(<= main_x 4), 858#(<= main_x 5), 859#(<= main_x 6), 860#(<= main_x 7), 861#(<= main_x 8), 862#(<= main_x 9), 863#(<= main_x 10)] [2018-07-23 13:51:00,568 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-23 13:51:00,569 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 13:51:00,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 13:51:00,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:51:00,570 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-07-23 13:51:00,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:00,581 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-23 13:51:00,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:51:00,582 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-07-23 13:51:00,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:00,583 INFO L225 Difference]: With dead ends: 20 [2018-07-23 13:51:00,583 INFO L226 Difference]: Without dead ends: 19 [2018-07-23 13:51:00,584 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:51:00,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-23 13:51:00,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-23 13:51:00,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-23 13:51:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-23 13:51:00,589 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-07-23 13:51:00,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:00,589 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-23 13:51:00,590 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 13:51:00,590 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-23 13:51:00,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:51:00,590 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:00,591 INFO L357 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-07-23 13:51:00,591 INFO L414 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:00,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-07-23 13:51:00,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:00,657 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-23 13:51:00,658 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:00,658 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 13:51:00,658 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:00,658 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-23 13:51:00,659 INFO L185 omatonBuilderFactory]: Interpolants [960#(<= main_x 11), 961#(<= main_x 12), 962#(<= main_x 13), 963#(<= main_x 14), 964#(<= main_x 15), 965#(<= main_x 16), 947#true, 948#false, 949#(<= main_x 0), 950#(<= main_x 1), 951#(<= main_x 2), 952#(<= main_x 3), 953#(<= main_x 4), 954#(<= main_x 5), 955#(<= main_x 6), 956#(<= main_x 7), 957#(<= main_x 8), 958#(<= main_x 9), 959#(<= main_x 10)] [2018-07-23 13:51:00,659 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-23 13:51:00,660 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-23 13:51:00,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-23 13:51:00,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:51:00,661 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-07-23 13:51:00,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:00,672 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-23 13:51:00,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:51:00,673 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-07-23 13:51:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:00,673 INFO L225 Difference]: With dead ends: 21 [2018-07-23 13:51:00,674 INFO L226 Difference]: Without dead ends: 20 [2018-07-23 13:51:00,675 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:51:00,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-23 13:51:00,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-23 13:51:00,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-23 13:51:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-23 13:51:00,679 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-07-23 13:51:00,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:00,679 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-23 13:51:00,679 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-23 13:51:00,680 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-23 13:51:00,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:51:00,680 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:00,680 INFO L357 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-07-23 13:51:00,681 INFO L414 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:00,681 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-07-23 13:51:00,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:00,744 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-23 13:51:00,744 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:00,744 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-23 13:51:00,745 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:00,745 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-23 13:51:00,746 INFO L185 omatonBuilderFactory]: Interpolants [1056#(<= main_x 6), 1057#(<= main_x 7), 1058#(<= main_x 8), 1059#(<= main_x 9), 1060#(<= main_x 10), 1061#(<= main_x 11), 1062#(<= main_x 12), 1063#(<= main_x 13), 1064#(<= main_x 14), 1065#(<= main_x 15), 1066#(<= main_x 16), 1067#(<= main_x 17), 1048#true, 1049#false, 1050#(<= main_x 0), 1051#(<= main_x 1), 1052#(<= main_x 2), 1053#(<= main_x 3), 1054#(<= main_x 4), 1055#(<= main_x 5)] [2018-07-23 13:51:00,746 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-23 13:51:00,746 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 13:51:00,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 13:51:00,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:51:00,747 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-07-23 13:51:00,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:00,760 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-23 13:51:00,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:51:00,761 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-07-23 13:51:00,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:00,762 INFO L225 Difference]: With dead ends: 22 [2018-07-23 13:51:00,762 INFO L226 Difference]: Without dead ends: 21 [2018-07-23 13:51:00,762 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:51:00,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-23 13:51:00,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-23 13:51:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-23 13:51:00,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-23 13:51:00,766 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-07-23 13:51:00,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:00,767 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-23 13:51:00,767 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 13:51:00,767 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-23 13:51:00,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:51:00,768 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:00,768 INFO L357 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-07-23 13:51:00,768 INFO L414 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:00,768 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-07-23 13:51:00,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:00,833 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-23 13:51:00,834 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:00,834 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-23 13:51:00,834 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:00,835 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-23 13:51:00,835 INFO L185 omatonBuilderFactory]: Interpolants [1154#true, 1155#false, 1156#(<= main_x 0), 1157#(<= main_x 1), 1158#(<= main_x 2), 1159#(<= main_x 3), 1160#(<= main_x 4), 1161#(<= main_x 5), 1162#(<= main_x 6), 1163#(<= main_x 7), 1164#(<= main_x 8), 1165#(<= main_x 9), 1166#(<= main_x 10), 1167#(<= main_x 11), 1168#(<= main_x 12), 1169#(<= main_x 13), 1170#(<= main_x 14), 1171#(<= main_x 15), 1172#(<= main_x 16), 1173#(<= main_x 17), 1174#(<= main_x 18)] [2018-07-23 13:51:00,836 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-23 13:51:00,836 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 13:51:00,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 13:51:00,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:51:00,837 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-07-23 13:51:00,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:00,852 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-23 13:51:00,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:51:00,852 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-07-23 13:51:00,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:00,853 INFO L225 Difference]: With dead ends: 23 [2018-07-23 13:51:00,853 INFO L226 Difference]: Without dead ends: 22 [2018-07-23 13:51:00,854 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:51:00,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-23 13:51:00,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-23 13:51:00,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-23 13:51:00,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-07-23 13:51:00,858 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-07-23 13:51:00,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:00,858 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-07-23 13:51:00,858 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 13:51:00,859 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-07-23 13:51:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:51:00,859 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:00,860 INFO L357 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-07-23 13:51:00,860 INFO L414 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:00,860 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-07-23 13:51:00,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:00,931 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-23 13:51:00,932 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:00,932 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-23 13:51:00,932 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:00,940 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-23 13:51:00,940 INFO L185 omatonBuilderFactory]: Interpolants [1280#(<= main_x 13), 1281#(<= main_x 14), 1282#(<= main_x 15), 1283#(<= main_x 16), 1284#(<= main_x 17), 1285#(<= main_x 18), 1286#(<= main_x 19), 1265#true, 1266#false, 1267#(<= main_x 0), 1268#(<= main_x 1), 1269#(<= main_x 2), 1270#(<= main_x 3), 1271#(<= main_x 4), 1272#(<= main_x 5), 1273#(<= main_x 6), 1274#(<= main_x 7), 1275#(<= main_x 8), 1276#(<= main_x 9), 1277#(<= main_x 10), 1278#(<= main_x 11), 1279#(<= main_x 12)] [2018-07-23 13:51:00,941 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-23 13:51:00,941 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-23 13:51:00,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-23 13:51:00,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:51:00,942 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-07-23 13:51:00,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:00,965 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-23 13:51:00,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:51:00,965 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-07-23 13:51:00,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:00,966 INFO L225 Difference]: With dead ends: 24 [2018-07-23 13:51:00,966 INFO L226 Difference]: Without dead ends: 23 [2018-07-23 13:51:00,967 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:51:00,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-23 13:51:00,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-23 13:51:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-23 13:51:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-23 13:51:00,972 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-07-23 13:51:00,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:00,972 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-23 13:51:00,972 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-23 13:51:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-23 13:51:00,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:51:00,973 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:00,973 INFO L357 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-07-23 13:51:00,974 INFO L414 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:00,974 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-07-23 13:51:00,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:01,046 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-23 13:51:01,047 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:01,047 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-23 13:51:01,047 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:01,048 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-23 13:51:01,048 INFO L185 omatonBuilderFactory]: Interpolants [1381#true, 1382#false, 1383#(<= main_x 0), 1384#(<= main_x 1), 1385#(<= main_x 2), 1386#(<= main_x 3), 1387#(<= main_x 4), 1388#(<= main_x 5), 1389#(<= main_x 6), 1390#(<= main_x 7), 1391#(<= main_x 8), 1392#(<= main_x 9), 1393#(<= main_x 10), 1394#(<= main_x 11), 1395#(<= main_x 12), 1396#(<= main_x 13), 1397#(<= main_x 14), 1398#(<= main_x 15), 1399#(<= main_x 16), 1400#(<= main_x 17), 1401#(<= main_x 18), 1402#(<= main_x 19), 1403#(<= main_x 20)] [2018-07-23 13:51:01,049 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-23 13:51:01,049 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 13:51:01,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 13:51:01,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:51:01,050 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-07-23 13:51:01,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:01,066 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-23 13:51:01,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:51:01,066 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-07-23 13:51:01,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:01,067 INFO L225 Difference]: With dead ends: 25 [2018-07-23 13:51:01,067 INFO L226 Difference]: Without dead ends: 24 [2018-07-23 13:51:01,068 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:51:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-23 13:51:01,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-07-23 13:51:01,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-23 13:51:01,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-07-23 13:51:01,072 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-07-23 13:51:01,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:01,073 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-07-23 13:51:01,073 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 13:51:01,073 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-07-23 13:51:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 13:51:01,074 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:01,074 INFO L357 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-07-23 13:51:01,074 INFO L414 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:01,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-07-23 13:51:01,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:01,153 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-23 13:51:01,153 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:01,154 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-23 13:51:01,154 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:01,154 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-23 13:51:01,155 INFO L185 omatonBuilderFactory]: Interpolants [1504#(<= main_x 0), 1505#(<= main_x 1), 1506#(<= main_x 2), 1507#(<= main_x 3), 1508#(<= main_x 4), 1509#(<= main_x 5), 1510#(<= main_x 6), 1511#(<= main_x 7), 1512#(<= main_x 8), 1513#(<= main_x 9), 1514#(<= main_x 10), 1515#(<= main_x 11), 1516#(<= main_x 12), 1517#(<= main_x 13), 1518#(<= main_x 14), 1519#(<= main_x 15), 1520#(<= main_x 16), 1521#(<= main_x 17), 1522#(<= main_x 18), 1523#(<= main_x 19), 1524#(<= main_x 20), 1525#(<= main_x 21), 1502#true, 1503#false] [2018-07-23 13:51:01,155 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-23 13:51:01,158 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 13:51:01,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 13:51:01,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:51:01,160 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-07-23 13:51:01,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:01,180 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-23 13:51:01,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:51:01,181 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-07-23 13:51:01,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:01,183 INFO L225 Difference]: With dead ends: 26 [2018-07-23 13:51:01,183 INFO L226 Difference]: Without dead ends: 25 [2018-07-23 13:51:01,187 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:51:01,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-23 13:51:01,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-23 13:51:01,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-23 13:51:01,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-23 13:51:01,192 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-07-23 13:51:01,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:01,192 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-23 13:51:01,192 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 13:51:01,197 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-23 13:51:01,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-23 13:51:01,198 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:01,198 INFO L357 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-07-23 13:51:01,198 INFO L414 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:01,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-07-23 13:51:01,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:01,317 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-23 13:51:01,318 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:01,318 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-23 13:51:01,318 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:01,319 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-23 13:51:01,319 INFO L185 omatonBuilderFactory]: Interpolants [1628#true, 1629#false, 1630#(<= main_x 0), 1631#(<= main_x 1), 1632#(<= main_x 2), 1633#(<= main_x 3), 1634#(<= main_x 4), 1635#(<= main_x 5), 1636#(<= main_x 6), 1637#(<= main_x 7), 1638#(<= main_x 8), 1639#(<= main_x 9), 1640#(<= main_x 10), 1641#(<= main_x 11), 1642#(<= main_x 12), 1643#(<= main_x 13), 1644#(<= main_x 14), 1645#(<= main_x 15), 1646#(<= main_x 16), 1647#(<= main_x 17), 1648#(<= main_x 18), 1649#(<= main_x 19), 1650#(<= main_x 20), 1651#(<= main_x 21), 1652#(<= main_x 22)] [2018-07-23 13:51:01,320 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-23 13:51:01,320 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-23 13:51:01,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-23 13:51:01,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:51:01,322 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-07-23 13:51:01,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:01,345 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-23 13:51:01,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 13:51:01,345 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-07-23 13:51:01,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:01,346 INFO L225 Difference]: With dead ends: 27 [2018-07-23 13:51:01,347 INFO L226 Difference]: Without dead ends: 26 [2018-07-23 13:51:01,348 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:51:01,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-23 13:51:01,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-23 13:51:01,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-23 13:51:01,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-23 13:51:01,357 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-07-23 13:51:01,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:01,358 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-23 13:51:01,358 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-23 13:51:01,358 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-23 13:51:01,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:51:01,359 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:01,359 INFO L357 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-07-23 13:51:01,359 INFO L414 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:01,360 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-07-23 13:51:01,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:01,451 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-23 13:51:01,451 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:01,452 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-23 13:51:01,452 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:01,452 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-23 13:51:01,453 INFO L185 omatonBuilderFactory]: Interpolants [1759#true, 1760#false, 1761#(<= main_x 0), 1762#(<= main_x 1), 1763#(<= main_x 2), 1764#(<= main_x 3), 1765#(<= main_x 4), 1766#(<= main_x 5), 1767#(<= main_x 6), 1768#(<= main_x 7), 1769#(<= main_x 8), 1770#(<= main_x 9), 1771#(<= main_x 10), 1772#(<= main_x 11), 1773#(<= main_x 12), 1774#(<= main_x 13), 1775#(<= main_x 14), 1776#(<= main_x 15), 1777#(<= main_x 16), 1778#(<= main_x 17), 1779#(<= main_x 18), 1780#(<= main_x 19), 1781#(<= main_x 20), 1782#(<= main_x 21), 1783#(<= main_x 22), 1784#(<= main_x 23)] [2018-07-23 13:51:01,456 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-23 13:51:01,456 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 13:51:01,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 13:51:01,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:51:01,458 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-07-23 13:51:01,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:01,483 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-07-23 13:51:01,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 13:51:01,484 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-07-23 13:51:01,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:01,484 INFO L225 Difference]: With dead ends: 28 [2018-07-23 13:51:01,484 INFO L226 Difference]: Without dead ends: 27 [2018-07-23 13:51:01,485 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:51:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-23 13:51:01,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-23 13:51:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-23 13:51:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-23 13:51:01,492 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-07-23 13:51:01,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:01,492 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-23 13:51:01,493 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 13:51:01,494 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-23 13:51:01,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 13:51:01,494 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:01,494 INFO L357 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-07-23 13:51:01,494 INFO L414 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:01,495 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-07-23 13:51:01,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:01,597 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-23 13:51:01,598 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:01,598 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-23 13:51:01,598 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:01,599 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-23 13:51:01,599 INFO L185 omatonBuilderFactory]: Interpolants [1920#(<= main_x 23), 1921#(<= main_x 24), 1895#true, 1896#false, 1897#(<= main_x 0), 1898#(<= main_x 1), 1899#(<= main_x 2), 1900#(<= main_x 3), 1901#(<= main_x 4), 1902#(<= main_x 5), 1903#(<= main_x 6), 1904#(<= main_x 7), 1905#(<= main_x 8), 1906#(<= main_x 9), 1907#(<= main_x 10), 1908#(<= main_x 11), 1909#(<= main_x 12), 1910#(<= main_x 13), 1911#(<= main_x 14), 1912#(<= main_x 15), 1913#(<= main_x 16), 1914#(<= main_x 17), 1915#(<= main_x 18), 1916#(<= main_x 19), 1917#(<= main_x 20), 1918#(<= main_x 21), 1919#(<= main_x 22)] [2018-07-23 13:51:01,600 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-23 13:51:01,600 INFO L450 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-23 13:51:01,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-23 13:51:01,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:51:01,603 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-07-23 13:51:01,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:01,622 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-23 13:51:01,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 13:51:01,623 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-07-23 13:51:01,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:01,623 INFO L225 Difference]: With dead ends: 29 [2018-07-23 13:51:01,623 INFO L226 Difference]: Without dead ends: 28 [2018-07-23 13:51:01,624 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:51:01,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-23 13:51:01,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-23 13:51:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-23 13:51:01,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-07-23 13:51:01,632 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-07-23 13:51:01,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:01,632 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-07-23 13:51:01,632 INFO L472 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-23 13:51:01,633 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-07-23 13:51:01,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-23 13:51:01,635 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:01,635 INFO L357 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-07-23 13:51:01,635 INFO L414 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:01,635 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-07-23 13:51:01,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:01,737 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-23 13:51:01,738 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:01,738 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-23 13:51:01,738 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:01,738 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-23 13:51:01,739 INFO L185 omatonBuilderFactory]: Interpolants [2048#(<= main_x 10), 2049#(<= main_x 11), 2050#(<= main_x 12), 2051#(<= main_x 13), 2052#(<= main_x 14), 2053#(<= main_x 15), 2054#(<= main_x 16), 2055#(<= main_x 17), 2056#(<= main_x 18), 2057#(<= main_x 19), 2058#(<= main_x 20), 2059#(<= main_x 21), 2060#(<= main_x 22), 2061#(<= main_x 23), 2062#(<= main_x 24), 2063#(<= main_x 25), 2036#true, 2037#false, 2038#(<= main_x 0), 2039#(<= main_x 1), 2040#(<= main_x 2), 2041#(<= main_x 3), 2042#(<= main_x 4), 2043#(<= main_x 5), 2044#(<= main_x 6), 2045#(<= main_x 7), 2046#(<= main_x 8), 2047#(<= main_x 9)] [2018-07-23 13:51:01,739 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-23 13:51:01,739 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-23 13:51:01,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-23 13:51:01,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:51:01,743 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-07-23 13:51:01,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:01,762 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-23 13:51:01,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:51:01,762 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-07-23 13:51:01,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:01,763 INFO L225 Difference]: With dead ends: 30 [2018-07-23 13:51:01,763 INFO L226 Difference]: Without dead ends: 29 [2018-07-23 13:51:01,764 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:51:01,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-23 13:51:01,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-23 13:51:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-23 13:51:01,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-23 13:51:01,771 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-07-23 13:51:01,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:01,772 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-23 13:51:01,772 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-23 13:51:01,772 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-23 13:51:01,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 13:51:01,772 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:01,773 INFO L357 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-07-23 13:51:01,773 INFO L414 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:01,773 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-07-23 13:51:01,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:01,888 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-23 13:51:01,888 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:01,888 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-23 13:51:01,889 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:01,889 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-23 13:51:01,889 INFO L185 omatonBuilderFactory]: Interpolants [2182#true, 2183#false, 2184#(<= main_x 0), 2185#(<= main_x 1), 2186#(<= main_x 2), 2187#(<= main_x 3), 2188#(<= main_x 4), 2189#(<= main_x 5), 2190#(<= main_x 6), 2191#(<= main_x 7), 2192#(<= main_x 8), 2193#(<= main_x 9), 2194#(<= main_x 10), 2195#(<= main_x 11), 2196#(<= main_x 12), 2197#(<= main_x 13), 2198#(<= main_x 14), 2199#(<= main_x 15), 2200#(<= main_x 16), 2201#(<= main_x 17), 2202#(<= main_x 18), 2203#(<= main_x 19), 2204#(<= main_x 20), 2205#(<= main_x 21), 2206#(<= main_x 22), 2207#(<= main_x 23), 2208#(<= main_x 24), 2209#(<= main_x 25), 2210#(<= main_x 26)] [2018-07-23 13:51:01,890 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-23 13:51:01,890 INFO L450 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-23 13:51:01,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-23 13:51:01,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:51:01,891 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-07-23 13:51:01,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:01,910 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-23 13:51:01,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 13:51:01,911 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-07-23 13:51:01,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:01,911 INFO L225 Difference]: With dead ends: 31 [2018-07-23 13:51:01,911 INFO L226 Difference]: Without dead ends: 30 [2018-07-23 13:51:01,912 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:51:01,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-23 13:51:01,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-23 13:51:01,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-23 13:51:01,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-07-23 13:51:01,916 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-07-23 13:51:01,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:01,916 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-07-23 13:51:01,917 INFO L472 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-23 13:51:01,917 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-07-23 13:51:01,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:51:01,917 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:01,918 INFO L357 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-07-23 13:51:01,918 INFO L414 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:01,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-07-23 13:51:01,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:02,035 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-23 13:51:02,035 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:02,035 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-23 13:51:02,035 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:02,036 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-23 13:51:02,036 INFO L185 omatonBuilderFactory]: Interpolants [2333#true, 2334#false, 2335#(<= main_x 0), 2336#(<= main_x 1), 2337#(<= main_x 2), 2338#(<= main_x 3), 2339#(<= main_x 4), 2340#(<= main_x 5), 2341#(<= main_x 6), 2342#(<= main_x 7), 2343#(<= main_x 8), 2344#(<= main_x 9), 2345#(<= main_x 10), 2346#(<= main_x 11), 2347#(<= main_x 12), 2348#(<= main_x 13), 2349#(<= main_x 14), 2350#(<= main_x 15), 2351#(<= main_x 16), 2352#(<= main_x 17), 2353#(<= main_x 18), 2354#(<= main_x 19), 2355#(<= main_x 20), 2356#(<= main_x 21), 2357#(<= main_x 22), 2358#(<= main_x 23), 2359#(<= main_x 24), 2360#(<= main_x 25), 2361#(<= main_x 26), 2362#(<= main_x 27)] [2018-07-23 13:51:02,037 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-23 13:51:02,037 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 13:51:02,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 13:51:02,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:51:02,041 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-07-23 13:51:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:02,062 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-07-23 13:51:02,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 13:51:02,063 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-07-23 13:51:02,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:02,063 INFO L225 Difference]: With dead ends: 32 [2018-07-23 13:51:02,063 INFO L226 Difference]: Without dead ends: 31 [2018-07-23 13:51:02,064 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:51:02,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-23 13:51:02,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-23 13:51:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-23 13:51:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-23 13:51:02,068 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-07-23 13:51:02,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:02,068 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-23 13:51:02,069 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 13:51:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-23 13:51:02,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-23 13:51:02,069 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:02,069 INFO L357 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-07-23 13:51:02,070 INFO L414 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:02,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-07-23 13:51:02,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:02,188 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-23 13:51:02,188 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:02,188 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-23 13:51:02,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:02,189 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-23 13:51:02,189 INFO L185 omatonBuilderFactory]: Interpolants [2496#(<= main_x 5), 2497#(<= main_x 6), 2498#(<= main_x 7), 2499#(<= main_x 8), 2500#(<= main_x 9), 2501#(<= main_x 10), 2502#(<= main_x 11), 2503#(<= main_x 12), 2504#(<= main_x 13), 2505#(<= main_x 14), 2506#(<= main_x 15), 2507#(<= main_x 16), 2508#(<= main_x 17), 2509#(<= main_x 18), 2510#(<= main_x 19), 2511#(<= main_x 20), 2512#(<= main_x 21), 2513#(<= main_x 22), 2514#(<= main_x 23), 2515#(<= main_x 24), 2516#(<= main_x 25), 2517#(<= main_x 26), 2518#(<= main_x 27), 2519#(<= main_x 28), 2489#true, 2490#false, 2491#(<= main_x 0), 2492#(<= main_x 1), 2493#(<= main_x 2), 2494#(<= main_x 3), 2495#(<= main_x 4)] [2018-07-23 13:51:02,190 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-23 13:51:02,190 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 13:51:02,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 13:51:02,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:51:02,191 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-07-23 13:51:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:02,211 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-23 13:51:02,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 13:51:02,211 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-07-23 13:51:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:02,212 INFO L225 Difference]: With dead ends: 33 [2018-07-23 13:51:02,212 INFO L226 Difference]: Without dead ends: 32 [2018-07-23 13:51:02,213 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:51:02,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-23 13:51:02,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-23 13:51:02,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-23 13:51:02,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-23 13:51:02,220 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-07-23 13:51:02,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:02,223 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-23 13:51:02,224 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 13:51:02,224 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-23 13:51:02,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-23 13:51:02,224 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:02,224 INFO L357 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-07-23 13:51:02,225 INFO L414 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:02,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-07-23 13:51:02,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:02,353 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-23 13:51:02,354 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:02,354 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-23 13:51:02,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:02,355 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-23 13:51:02,355 INFO L185 omatonBuilderFactory]: Interpolants [2650#true, 2651#false, 2652#(<= main_x 0), 2653#(<= main_x 1), 2654#(<= main_x 2), 2655#(<= main_x 3), 2656#(<= main_x 4), 2657#(<= main_x 5), 2658#(<= main_x 6), 2659#(<= main_x 7), 2660#(<= main_x 8), 2661#(<= main_x 9), 2662#(<= main_x 10), 2663#(<= main_x 11), 2664#(<= main_x 12), 2665#(<= main_x 13), 2666#(<= main_x 14), 2667#(<= main_x 15), 2668#(<= main_x 16), 2669#(<= main_x 17), 2670#(<= main_x 18), 2671#(<= main_x 19), 2672#(<= main_x 20), 2673#(<= main_x 21), 2674#(<= main_x 22), 2675#(<= main_x 23), 2676#(<= main_x 24), 2677#(<= main_x 25), 2678#(<= main_x 26), 2679#(<= main_x 27), 2680#(<= main_x 28), 2681#(<= main_x 29)] [2018-07-23 13:51:02,356 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-23 13:51:02,356 INFO L450 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-23 13:51:02,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-23 13:51:02,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:51:02,357 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-07-23 13:51:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:02,375 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-07-23 13:51:02,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-23 13:51:02,375 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-07-23 13:51:02,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:02,376 INFO L225 Difference]: With dead ends: 34 [2018-07-23 13:51:02,376 INFO L226 Difference]: Without dead ends: 33 [2018-07-23 13:51:02,377 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:51:02,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-23 13:51:02,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-23 13:51:02,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-23 13:51:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-23 13:51:02,383 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-07-23 13:51:02,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:02,384 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-23 13:51:02,385 INFO L472 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-23 13:51:02,385 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-23 13:51:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-23 13:51:02,385 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:02,385 INFO L357 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-07-23 13:51:02,386 INFO L414 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:02,386 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-07-23 13:51:02,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:02,519 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-23 13:51:02,519 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:02,519 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-23 13:51:02,519 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:02,520 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-23 13:51:02,520 INFO L185 omatonBuilderFactory]: Interpolants [2816#true, 2817#false, 2818#(<= main_x 0), 2819#(<= main_x 1), 2820#(<= main_x 2), 2821#(<= main_x 3), 2822#(<= main_x 4), 2823#(<= main_x 5), 2824#(<= main_x 6), 2825#(<= main_x 7), 2826#(<= main_x 8), 2827#(<= main_x 9), 2828#(<= main_x 10), 2829#(<= main_x 11), 2830#(<= main_x 12), 2831#(<= main_x 13), 2832#(<= main_x 14), 2833#(<= main_x 15), 2834#(<= main_x 16), 2835#(<= main_x 17), 2836#(<= main_x 18), 2837#(<= main_x 19), 2838#(<= main_x 20), 2839#(<= main_x 21), 2840#(<= main_x 22), 2841#(<= main_x 23), 2842#(<= main_x 24), 2843#(<= main_x 25), 2844#(<= main_x 26), 2845#(<= main_x 27), 2846#(<= main_x 28), 2847#(<= main_x 29), 2848#(<= main_x 30)] [2018-07-23 13:51:02,521 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-23 13:51:02,521 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-23 13:51:02,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-23 13:51:02,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:51:02,522 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-07-23 13:51:02,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:02,540 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-23 13:51:02,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 13:51:02,540 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-07-23 13:51:02,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:02,541 INFO L225 Difference]: With dead ends: 35 [2018-07-23 13:51:02,541 INFO L226 Difference]: Without dead ends: 34 [2018-07-23 13:51:02,542 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:51:02,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-23 13:51:02,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-23 13:51:02,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-23 13:51:02,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-07-23 13:51:02,547 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-07-23 13:51:02,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:02,547 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-07-23 13:51:02,547 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-23 13:51:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-07-23 13:51:02,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-23 13:51:02,548 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:02,548 INFO L357 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-07-23 13:51:02,548 INFO L414 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:02,549 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-07-23 13:51:02,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:02,690 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-23 13:51:02,690 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:02,690 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-23 13:51:02,691 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:02,691 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-23 13:51:02,691 INFO L185 omatonBuilderFactory]: Interpolants [3008#(<= main_x 19), 3009#(<= main_x 20), 3010#(<= main_x 21), 3011#(<= main_x 22), 3012#(<= main_x 23), 3013#(<= main_x 24), 3014#(<= main_x 25), 3015#(<= main_x 26), 3016#(<= main_x 27), 3017#(<= main_x 28), 3018#(<= main_x 29), 3019#(<= main_x 30), 3020#(<= main_x 31), 2987#true, 2988#false, 2989#(<= main_x 0), 2990#(<= main_x 1), 2991#(<= main_x 2), 2992#(<= main_x 3), 2993#(<= main_x 4), 2994#(<= main_x 5), 2995#(<= main_x 6), 2996#(<= main_x 7), 2997#(<= main_x 8), 2998#(<= main_x 9), 2999#(<= main_x 10), 3000#(<= main_x 11), 3001#(<= main_x 12), 3002#(<= main_x 13), 3003#(<= main_x 14), 3004#(<= main_x 15), 3005#(<= main_x 16), 3006#(<= main_x 17), 3007#(<= main_x 18)] [2018-07-23 13:51:02,692 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-23 13:51:02,692 INFO L450 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-23 13:51:02,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-23 13:51:02,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:51:02,694 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-07-23 13:51:02,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:02,713 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-23 13:51:02,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 13:51:02,713 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-07-23 13:51:02,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:02,714 INFO L225 Difference]: With dead ends: 36 [2018-07-23 13:51:02,714 INFO L226 Difference]: Without dead ends: 35 [2018-07-23 13:51:02,715 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:51:02,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-23 13:51:02,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-23 13:51:02,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-23 13:51:02,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-23 13:51:02,723 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-07-23 13:51:02,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:02,723 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-23 13:51:02,723 INFO L472 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-23 13:51:02,723 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-23 13:51:02,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-23 13:51:02,724 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:02,724 INFO L357 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-07-23 13:51:02,724 INFO L414 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:02,725 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-07-23 13:51:02,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:02,932 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-23 13:51:02,932 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:02,933 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-23 13:51:02,933 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:02,933 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-23 13:51:02,933 INFO L185 omatonBuilderFactory]: Interpolants [3163#true, 3164#false, 3165#(<= main_x 0), 3166#(<= main_x 1), 3167#(<= main_x 2), 3168#(<= main_x 3), 3169#(<= main_x 4), 3170#(<= main_x 5), 3171#(<= main_x 6), 3172#(<= main_x 7), 3173#(<= main_x 8), 3174#(<= main_x 9), 3175#(<= main_x 10), 3176#(<= main_x 11), 3177#(<= main_x 12), 3178#(<= main_x 13), 3179#(<= main_x 14), 3180#(<= main_x 15), 3181#(<= main_x 16), 3182#(<= main_x 17), 3183#(<= main_x 18), 3184#(<= main_x 19), 3185#(<= main_x 20), 3186#(<= main_x 21), 3187#(<= main_x 22), 3188#(<= main_x 23), 3189#(<= main_x 24), 3190#(<= main_x 25), 3191#(<= main_x 26), 3192#(<= main_x 27), 3193#(<= main_x 28), 3194#(<= main_x 29), 3195#(<= main_x 30), 3196#(<= main_x 31), 3197#(<= main_x 32)] [2018-07-23 13:51:02,934 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-23 13:51:02,934 INFO L450 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-23 13:51:02,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-23 13:51:02,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:51:02,938 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-07-23 13:51:02,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:02,958 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-23 13:51:02,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 13:51:02,959 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-07-23 13:51:02,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:02,959 INFO L225 Difference]: With dead ends: 37 [2018-07-23 13:51:02,959 INFO L226 Difference]: Without dead ends: 36 [2018-07-23 13:51:02,961 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:51:02,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-23 13:51:02,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-23 13:51:02,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-23 13:51:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-23 13:51:02,969 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-07-23 13:51:02,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:02,969 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-23 13:51:02,969 INFO L472 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-23 13:51:02,970 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-23 13:51:02,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-23 13:51:02,970 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:02,970 INFO L357 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-07-23 13:51:02,974 INFO L414 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:02,974 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-07-23 13:51:02,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:03,114 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-23 13:51:03,114 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:03,114 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-23 13:51:03,114 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:03,115 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-23 13:51:03,115 INFO L185 omatonBuilderFactory]: Interpolants [3344#true, 3345#false, 3346#(<= main_x 0), 3347#(<= main_x 1), 3348#(<= main_x 2), 3349#(<= main_x 3), 3350#(<= main_x 4), 3351#(<= main_x 5), 3352#(<= main_x 6), 3353#(<= main_x 7), 3354#(<= main_x 8), 3355#(<= main_x 9), 3356#(<= main_x 10), 3357#(<= main_x 11), 3358#(<= main_x 12), 3359#(<= main_x 13), 3360#(<= main_x 14), 3361#(<= main_x 15), 3362#(<= main_x 16), 3363#(<= main_x 17), 3364#(<= main_x 18), 3365#(<= main_x 19), 3366#(<= main_x 20), 3367#(<= main_x 21), 3368#(<= main_x 22), 3369#(<= main_x 23), 3370#(<= main_x 24), 3371#(<= main_x 25), 3372#(<= main_x 26), 3373#(<= main_x 27), 3374#(<= main_x 28), 3375#(<= main_x 29), 3376#(<= main_x 30), 3377#(<= main_x 31), 3378#(<= main_x 32), 3379#(<= main_x 33)] [2018-07-23 13:51:03,116 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-23 13:51:03,116 INFO L450 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-23 13:51:03,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-23 13:51:03,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 13:51:03,117 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-07-23 13:51:03,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:03,137 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-07-23 13:51:03,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 13:51:03,137 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-07-23 13:51:03,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:03,137 INFO L225 Difference]: With dead ends: 38 [2018-07-23 13:51:03,138 INFO L226 Difference]: Without dead ends: 37 [2018-07-23 13:51:03,139 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 13:51:03,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-23 13:51:03,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-23 13:51:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-23 13:51:03,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-23 13:51:03,141 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-07-23 13:51:03,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:03,142 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-23 13:51:03,142 INFO L472 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-23 13:51:03,142 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-23 13:51:03,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-23 13:51:03,142 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:03,143 INFO L357 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-07-23 13:51:03,143 INFO L414 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:03,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-07-23 13:51:03,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:03,280 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-23 13:51:03,280 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:03,280 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-23 13:51:03,281 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:03,281 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-23 13:51:03,281 INFO L185 omatonBuilderFactory]: Interpolants [3530#true, 3531#false, 3532#(<= main_x 0), 3533#(<= main_x 1), 3534#(<= main_x 2), 3535#(<= main_x 3), 3536#(<= main_x 4), 3537#(<= main_x 5), 3538#(<= main_x 6), 3539#(<= main_x 7), 3540#(<= main_x 8), 3541#(<= main_x 9), 3542#(<= main_x 10), 3543#(<= main_x 11), 3544#(<= main_x 12), 3545#(<= main_x 13), 3546#(<= main_x 14), 3547#(<= main_x 15), 3548#(<= main_x 16), 3549#(<= main_x 17), 3550#(<= main_x 18), 3551#(<= main_x 19), 3552#(<= main_x 20), 3553#(<= main_x 21), 3554#(<= main_x 22), 3555#(<= main_x 23), 3556#(<= main_x 24), 3557#(<= main_x 25), 3558#(<= main_x 26), 3559#(<= main_x 27), 3560#(<= main_x 28), 3561#(<= main_x 29), 3562#(<= main_x 30), 3563#(<= main_x 31), 3564#(<= main_x 32), 3565#(<= main_x 33), 3566#(<= main_x 34)] [2018-07-23 13:51:03,282 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-23 13:51:03,282 INFO L450 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-23 13:51:03,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-23 13:51:03,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:51:03,285 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-07-23 13:51:03,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:03,307 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-23 13:51:03,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-23 13:51:03,307 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-07-23 13:51:03,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:03,308 INFO L225 Difference]: With dead ends: 39 [2018-07-23 13:51:03,308 INFO L226 Difference]: Without dead ends: 38 [2018-07-23 13:51:03,309 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:51:03,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-23 13:51:03,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-23 13:51:03,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-23 13:51:03,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-23 13:51:03,311 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-07-23 13:51:03,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:03,312 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-23 13:51:03,312 INFO L472 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-23 13:51:03,312 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-23 13:51:03,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-23 13:51:03,312 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:03,312 INFO L357 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-07-23 13:51:03,312 INFO L414 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:03,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-07-23 13:51:03,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:03,474 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-23 13:51:03,474 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:03,474 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-23 13:51:03,475 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:03,475 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-23 13:51:03,475 INFO L185 omatonBuilderFactory]: Interpolants [3721#true, 3722#false, 3723#(<= main_x 0), 3724#(<= main_x 1), 3725#(<= main_x 2), 3726#(<= main_x 3), 3727#(<= main_x 4), 3728#(<= main_x 5), 3729#(<= main_x 6), 3730#(<= main_x 7), 3731#(<= main_x 8), 3732#(<= main_x 9), 3733#(<= main_x 10), 3734#(<= main_x 11), 3735#(<= main_x 12), 3736#(<= main_x 13), 3737#(<= main_x 14), 3738#(<= main_x 15), 3739#(<= main_x 16), 3740#(<= main_x 17), 3741#(<= main_x 18), 3742#(<= main_x 19), 3743#(<= main_x 20), 3744#(<= main_x 21), 3745#(<= main_x 22), 3746#(<= main_x 23), 3747#(<= main_x 24), 3748#(<= main_x 25), 3749#(<= main_x 26), 3750#(<= main_x 27), 3751#(<= main_x 28), 3752#(<= main_x 29), 3753#(<= main_x 30), 3754#(<= main_x 31), 3755#(<= main_x 32), 3756#(<= main_x 33), 3757#(<= main_x 34), 3758#(<= main_x 35)] [2018-07-23 13:51:03,479 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-23 13:51:03,479 INFO L450 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-23 13:51:03,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-23 13:51:03,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 13:51:03,481 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-07-23 13:51:03,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:03,500 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-23 13:51:03,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-23 13:51:03,500 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-07-23 13:51:03,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:03,500 INFO L225 Difference]: With dead ends: 40 [2018-07-23 13:51:03,501 INFO L226 Difference]: Without dead ends: 39 [2018-07-23 13:51:03,502 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 13:51:03,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-23 13:51:03,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-23 13:51:03,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-23 13:51:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-23 13:51:03,512 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-07-23 13:51:03,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:03,513 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-23 13:51:03,513 INFO L472 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-23 13:51:03,513 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-23 13:51:03,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-23 13:51:03,513 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:03,513 INFO L357 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-07-23 13:51:03,513 INFO L414 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:03,514 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-07-23 13:51:03,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:03,651 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-23 13:51:03,652 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:03,652 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-23 13:51:03,652 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:03,652 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-23 13:51:03,653 INFO L185 omatonBuilderFactory]: Interpolants [3917#true, 3918#false, 3919#(<= main_x 0), 3920#(<= main_x 1), 3921#(<= main_x 2), 3922#(<= main_x 3), 3923#(<= main_x 4), 3924#(<= main_x 5), 3925#(<= main_x 6), 3926#(<= main_x 7), 3927#(<= main_x 8), 3928#(<= main_x 9), 3929#(<= main_x 10), 3930#(<= main_x 11), 3931#(<= main_x 12), 3932#(<= main_x 13), 3933#(<= main_x 14), 3934#(<= main_x 15), 3935#(<= main_x 16), 3936#(<= main_x 17), 3937#(<= main_x 18), 3938#(<= main_x 19), 3939#(<= main_x 20), 3940#(<= main_x 21), 3941#(<= main_x 22), 3942#(<= main_x 23), 3943#(<= main_x 24), 3944#(<= main_x 25), 3945#(<= main_x 26), 3946#(<= main_x 27), 3947#(<= main_x 28), 3948#(<= main_x 29), 3949#(<= main_x 30), 3950#(<= main_x 31), 3951#(<= main_x 32), 3952#(<= main_x 33), 3953#(<= main_x 34), 3954#(<= main_x 35), 3955#(<= main_x 36)] [2018-07-23 13:51:03,653 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-23 13:51:03,653 INFO L450 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-23 13:51:03,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-23 13:51:03,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:51:03,656 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-07-23 13:51:03,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:03,677 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-23 13:51:03,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 13:51:03,677 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-07-23 13:51:03,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:03,678 INFO L225 Difference]: With dead ends: 41 [2018-07-23 13:51:03,678 INFO L226 Difference]: Without dead ends: 40 [2018-07-23 13:51:03,679 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:51:03,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-23 13:51:03,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-23 13:51:03,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-23 13:51:03,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-07-23 13:51:03,681 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-07-23 13:51:03,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:03,681 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-07-23 13:51:03,682 INFO L472 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-23 13:51:03,682 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-07-23 13:51:03,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-23 13:51:03,682 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:03,682 INFO L357 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-07-23 13:51:03,682 INFO L414 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:03,683 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-07-23 13:51:03,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:03,817 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-23 13:51:03,817 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:03,817 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-23 13:51:03,817 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:03,818 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-23 13:51:03,818 INFO L185 omatonBuilderFactory]: Interpolants [4118#true, 4119#false, 4120#(<= main_x 0), 4121#(<= main_x 1), 4122#(<= main_x 2), 4123#(<= main_x 3), 4124#(<= main_x 4), 4125#(<= main_x 5), 4126#(<= main_x 6), 4127#(<= main_x 7), 4128#(<= main_x 8), 4129#(<= main_x 9), 4130#(<= main_x 10), 4131#(<= main_x 11), 4132#(<= main_x 12), 4133#(<= main_x 13), 4134#(<= main_x 14), 4135#(<= main_x 15), 4136#(<= main_x 16), 4137#(<= main_x 17), 4138#(<= main_x 18), 4139#(<= main_x 19), 4140#(<= main_x 20), 4141#(<= main_x 21), 4142#(<= main_x 22), 4143#(<= main_x 23), 4144#(<= main_x 24), 4145#(<= main_x 25), 4146#(<= main_x 26), 4147#(<= main_x 27), 4148#(<= main_x 28), 4149#(<= main_x 29), 4150#(<= main_x 30), 4151#(<= main_x 31), 4152#(<= main_x 32), 4153#(<= main_x 33), 4154#(<= main_x 34), 4155#(<= main_x 35), 4156#(<= main_x 36), 4157#(<= main_x 37)] [2018-07-23 13:51:03,818 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-23 13:51:03,818 INFO L450 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-23 13:51:03,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-23 13:51:03,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 13:51:03,820 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-07-23 13:51:03,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:03,841 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-23 13:51:03,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-23 13:51:03,842 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-07-23 13:51:03,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:03,842 INFO L225 Difference]: With dead ends: 42 [2018-07-23 13:51:03,842 INFO L226 Difference]: Without dead ends: 41 [2018-07-23 13:51:03,844 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 13:51:03,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-23 13:51:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-23 13:51:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-23 13:51:03,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-23 13:51:03,847 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-07-23 13:51:03,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:03,848 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-23 13:51:03,848 INFO L472 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-23 13:51:03,848 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-23 13:51:03,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 13:51:03,848 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:03,848 INFO L357 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-07-23 13:51:03,849 INFO L414 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:03,849 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-07-23 13:51:03,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:03,998 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-23 13:51:03,998 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:03,998 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-23 13:51:03,999 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:03,999 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-23 13:51:03,999 INFO L185 omatonBuilderFactory]: Interpolants [4352#(<= main_x 26), 4353#(<= main_x 27), 4354#(<= main_x 28), 4355#(<= main_x 29), 4356#(<= main_x 30), 4357#(<= main_x 31), 4358#(<= main_x 32), 4359#(<= main_x 33), 4360#(<= main_x 34), 4361#(<= main_x 35), 4362#(<= main_x 36), 4363#(<= main_x 37), 4364#(<= main_x 38), 4324#true, 4325#false, 4326#(<= main_x 0), 4327#(<= main_x 1), 4328#(<= main_x 2), 4329#(<= main_x 3), 4330#(<= main_x 4), 4331#(<= main_x 5), 4332#(<= main_x 6), 4333#(<= main_x 7), 4334#(<= main_x 8), 4335#(<= main_x 9), 4336#(<= main_x 10), 4337#(<= main_x 11), 4338#(<= main_x 12), 4339#(<= main_x 13), 4340#(<= main_x 14), 4341#(<= main_x 15), 4342#(<= main_x 16), 4343#(<= main_x 17), 4344#(<= main_x 18), 4345#(<= main_x 19), 4346#(<= main_x 20), 4347#(<= main_x 21), 4348#(<= main_x 22), 4349#(<= main_x 23), 4350#(<= main_x 24), 4351#(<= main_x 25)] [2018-07-23 13:51:04,000 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-23 13:51:04,000 INFO L450 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-23 13:51:04,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-23 13:51:04,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 13:51:04,002 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-07-23 13:51:04,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:04,020 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-23 13:51:04,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-23 13:51:04,021 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-07-23 13:51:04,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:04,021 INFO L225 Difference]: With dead ends: 43 [2018-07-23 13:51:04,021 INFO L226 Difference]: Without dead ends: 42 [2018-07-23 13:51:04,022 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 13:51:04,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-23 13:51:04,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-07-23 13:51:04,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-23 13:51:04,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-07-23 13:51:04,025 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-07-23 13:51:04,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:04,025 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-07-23 13:51:04,025 INFO L472 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-23 13:51:04,025 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-07-23 13:51:04,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-23 13:51:04,026 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:04,026 INFO L357 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-07-23 13:51:04,026 INFO L414 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:04,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-07-23 13:51:04,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:04,176 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-23 13:51:04,177 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:04,177 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-23 13:51:04,177 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:04,177 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-23 13:51:04,178 INFO L185 omatonBuilderFactory]: Interpolants [4544#(<= main_x 7), 4545#(<= main_x 8), 4546#(<= main_x 9), 4547#(<= main_x 10), 4548#(<= main_x 11), 4549#(<= main_x 12), 4550#(<= main_x 13), 4551#(<= main_x 14), 4552#(<= main_x 15), 4553#(<= main_x 16), 4554#(<= main_x 17), 4555#(<= main_x 18), 4556#(<= main_x 19), 4557#(<= main_x 20), 4558#(<= main_x 21), 4559#(<= main_x 22), 4560#(<= main_x 23), 4561#(<= main_x 24), 4562#(<= main_x 25), 4563#(<= main_x 26), 4564#(<= main_x 27), 4565#(<= main_x 28), 4566#(<= main_x 29), 4567#(<= main_x 30), 4568#(<= main_x 31), 4569#(<= main_x 32), 4570#(<= main_x 33), 4571#(<= main_x 34), 4572#(<= main_x 35), 4573#(<= main_x 36), 4574#(<= main_x 37), 4575#(<= main_x 38), 4576#(<= main_x 39), 4535#true, 4536#false, 4537#(<= main_x 0), 4538#(<= main_x 1), 4539#(<= main_x 2), 4540#(<= main_x 3), 4541#(<= main_x 4), 4542#(<= main_x 5), 4543#(<= main_x 6)] [2018-07-23 13:51:04,178 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-23 13:51:04,178 INFO L450 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-23 13:51:04,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-23 13:51:04,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 13:51:04,180 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-07-23 13:51:04,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:04,202 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-07-23 13:51:04,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-23 13:51:04,202 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-07-23 13:51:04,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:04,203 INFO L225 Difference]: With dead ends: 44 [2018-07-23 13:51:04,203 INFO L226 Difference]: Without dead ends: 43 [2018-07-23 13:51:04,204 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 13:51:04,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-23 13:51:04,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-23 13:51:04,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-23 13:51:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-23 13:51:04,206 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-07-23 13:51:04,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:04,207 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-23 13:51:04,207 INFO L472 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-23 13:51:04,207 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-23 13:51:04,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 13:51:04,207 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:04,207 INFO L357 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-07-23 13:51:04,208 INFO L414 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:04,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-07-23 13:51:04,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:04,357 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-23 13:51:04,358 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:04,358 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-23 13:51:04,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:04,358 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-23 13:51:04,359 INFO L185 omatonBuilderFactory]: Interpolants [4751#true, 4752#false, 4753#(<= main_x 0), 4754#(<= main_x 1), 4755#(<= main_x 2), 4756#(<= main_x 3), 4757#(<= main_x 4), 4758#(<= main_x 5), 4759#(<= main_x 6), 4760#(<= main_x 7), 4761#(<= main_x 8), 4762#(<= main_x 9), 4763#(<= main_x 10), 4764#(<= main_x 11), 4765#(<= main_x 12), 4766#(<= main_x 13), 4767#(<= main_x 14), 4768#(<= main_x 15), 4769#(<= main_x 16), 4770#(<= main_x 17), 4771#(<= main_x 18), 4772#(<= main_x 19), 4773#(<= main_x 20), 4774#(<= main_x 21), 4775#(<= main_x 22), 4776#(<= main_x 23), 4777#(<= main_x 24), 4778#(<= main_x 25), 4779#(<= main_x 26), 4780#(<= main_x 27), 4781#(<= main_x 28), 4782#(<= main_x 29), 4783#(<= main_x 30), 4784#(<= main_x 31), 4785#(<= main_x 32), 4786#(<= main_x 33), 4787#(<= main_x 34), 4788#(<= main_x 35), 4789#(<= main_x 36), 4790#(<= main_x 37), 4791#(<= main_x 38), 4792#(<= main_x 39), 4793#(<= main_x 40)] [2018-07-23 13:51:04,359 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-23 13:51:04,359 INFO L450 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-23 13:51:04,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-23 13:51:04,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 13:51:04,361 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-07-23 13:51:04,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:04,382 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-23 13:51:04,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 13:51:04,383 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-07-23 13:51:04,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:04,383 INFO L225 Difference]: With dead ends: 45 [2018-07-23 13:51:04,383 INFO L226 Difference]: Without dead ends: 44 [2018-07-23 13:51:04,384 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 13:51:04,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-23 13:51:04,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-23 13:51:04,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-23 13:51:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-23 13:51:04,387 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-07-23 13:51:04,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:04,387 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-23 13:51:04,387 INFO L472 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-23 13:51:04,387 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-23 13:51:04,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-23 13:51:04,388 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:04,388 INFO L357 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-07-23 13:51:04,388 INFO L414 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:04,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-07-23 13:51:04,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:04,543 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-23 13:51:04,544 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:04,544 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-23 13:51:04,544 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:04,544 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-23 13:51:04,545 INFO L185 omatonBuilderFactory]: Interpolants [4992#(<= main_x 18), 4993#(<= main_x 19), 4994#(<= main_x 20), 4995#(<= main_x 21), 4996#(<= main_x 22), 4997#(<= main_x 23), 4998#(<= main_x 24), 4999#(<= main_x 25), 5000#(<= main_x 26), 5001#(<= main_x 27), 5002#(<= main_x 28), 5003#(<= main_x 29), 5004#(<= main_x 30), 5005#(<= main_x 31), 5006#(<= main_x 32), 5007#(<= main_x 33), 5008#(<= main_x 34), 5009#(<= main_x 35), 5010#(<= main_x 36), 5011#(<= main_x 37), 5012#(<= main_x 38), 5013#(<= main_x 39), 5014#(<= main_x 40), 5015#(<= main_x 41), 4972#true, 4973#false, 4974#(<= main_x 0), 4975#(<= main_x 1), 4976#(<= main_x 2), 4977#(<= main_x 3), 4978#(<= main_x 4), 4979#(<= main_x 5), 4980#(<= main_x 6), 4981#(<= main_x 7), 4982#(<= main_x 8), 4983#(<= main_x 9), 4984#(<= main_x 10), 4985#(<= main_x 11), 4986#(<= main_x 12), 4987#(<= main_x 13), 4988#(<= main_x 14), 4989#(<= main_x 15), 4990#(<= main_x 16), 4991#(<= main_x 17)] [2018-07-23 13:51:04,545 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-23 13:51:04,545 INFO L450 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-23 13:51:04,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-23 13:51:04,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 13:51:04,547 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-07-23 13:51:04,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:04,565 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-07-23 13:51:04,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-23 13:51:04,566 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-07-23 13:51:04,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:04,566 INFO L225 Difference]: With dead ends: 46 [2018-07-23 13:51:04,566 INFO L226 Difference]: Without dead ends: 45 [2018-07-23 13:51:04,568 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 13:51:04,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-23 13:51:04,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-23 13:51:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-23 13:51:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-23 13:51:04,570 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-07-23 13:51:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:04,571 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-23 13:51:04,571 INFO L472 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-23 13:51:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-23 13:51:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-23 13:51:04,571 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:04,572 INFO L357 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-07-23 13:51:04,572 INFO L414 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:04,572 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-07-23 13:51:04,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:04,729 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-23 13:51:04,729 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:04,730 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-23 13:51:04,730 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:04,730 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-23 13:51:04,730 INFO L185 omatonBuilderFactory]: Interpolants [5198#true, 5199#false, 5200#(<= main_x 0), 5201#(<= main_x 1), 5202#(<= main_x 2), 5203#(<= main_x 3), 5204#(<= main_x 4), 5205#(<= main_x 5), 5206#(<= main_x 6), 5207#(<= main_x 7), 5208#(<= main_x 8), 5209#(<= main_x 9), 5210#(<= main_x 10), 5211#(<= main_x 11), 5212#(<= main_x 12), 5213#(<= main_x 13), 5214#(<= main_x 14), 5215#(<= main_x 15), 5216#(<= main_x 16), 5217#(<= main_x 17), 5218#(<= main_x 18), 5219#(<= main_x 19), 5220#(<= main_x 20), 5221#(<= main_x 21), 5222#(<= main_x 22), 5223#(<= main_x 23), 5224#(<= main_x 24), 5225#(<= main_x 25), 5226#(<= main_x 26), 5227#(<= main_x 27), 5228#(<= main_x 28), 5229#(<= main_x 29), 5230#(<= main_x 30), 5231#(<= main_x 31), 5232#(<= main_x 32), 5233#(<= main_x 33), 5234#(<= main_x 34), 5235#(<= main_x 35), 5236#(<= main_x 36), 5237#(<= main_x 37), 5238#(<= main_x 38), 5239#(<= main_x 39), 5240#(<= main_x 40), 5241#(<= main_x 41), 5242#(<= main_x 42)] [2018-07-23 13:51:04,731 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-23 13:51:04,731 INFO L450 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-23 13:51:04,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-23 13:51:04,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 13:51:04,733 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-07-23 13:51:04,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:04,756 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-23 13:51:04,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 13:51:04,757 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-07-23 13:51:04,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:04,757 INFO L225 Difference]: With dead ends: 47 [2018-07-23 13:51:04,757 INFO L226 Difference]: Without dead ends: 46 [2018-07-23 13:51:04,759 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 13:51:04,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-23 13:51:04,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-23 13:51:04,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-23 13:51:04,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-07-23 13:51:04,763 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-07-23 13:51:04,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:04,763 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-07-23 13:51:04,763 INFO L472 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-23 13:51:04,763 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-07-23 13:51:04,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-23 13:51:04,764 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:04,764 INFO L357 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-07-23 13:51:04,764 INFO L414 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:04,764 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-07-23 13:51:04,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:04,932 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:04,932 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-23 13:51:04,932 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:04,932 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-23 13:51:04,933 INFO L185 omatonBuilderFactory]: Interpolants [5440#(<= main_x 9), 5441#(<= main_x 10), 5442#(<= main_x 11), 5443#(<= main_x 12), 5444#(<= main_x 13), 5445#(<= main_x 14), 5446#(<= main_x 15), 5447#(<= main_x 16), 5448#(<= main_x 17), 5449#(<= main_x 18), 5450#(<= main_x 19), 5451#(<= main_x 20), 5452#(<= main_x 21), 5453#(<= main_x 22), 5454#(<= main_x 23), 5455#(<= main_x 24), 5456#(<= main_x 25), 5457#(<= main_x 26), 5458#(<= main_x 27), 5459#(<= main_x 28), 5460#(<= main_x 29), 5461#(<= main_x 30), 5462#(<= main_x 31), 5463#(<= main_x 32), 5464#(<= main_x 33), 5465#(<= main_x 34), 5466#(<= main_x 35), 5467#(<= main_x 36), 5468#(<= main_x 37), 5469#(<= main_x 38), 5470#(<= main_x 39), 5471#(<= main_x 40), 5472#(<= main_x 41), 5473#(<= main_x 42), 5474#(<= main_x 43), 5429#true, 5430#false, 5431#(<= main_x 0), 5432#(<= main_x 1), 5433#(<= main_x 2), 5434#(<= main_x 3), 5435#(<= main_x 4), 5436#(<= main_x 5), 5437#(<= main_x 6), 5438#(<= main_x 7), 5439#(<= main_x 8)] [2018-07-23 13:51:04,933 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:04,933 INFO L450 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-23 13:51:04,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-23 13:51:04,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 13:51:04,936 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-07-23 13:51:04,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:04,962 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-07-23 13:51:04,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 13:51:04,962 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-07-23 13:51:04,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:04,963 INFO L225 Difference]: With dead ends: 48 [2018-07-23 13:51:04,963 INFO L226 Difference]: Without dead ends: 47 [2018-07-23 13:51:04,964 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 13:51:04,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-23 13:51:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-23 13:51:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-23 13:51:04,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-23 13:51:04,968 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-07-23 13:51:04,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:04,968 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-23 13:51:04,968 INFO L472 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-23 13:51:04,968 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-23 13:51:04,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-23 13:51:04,969 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:04,969 INFO L357 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-07-23 13:51:04,969 INFO L414 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:04,969 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2018-07-23 13:51:04,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:05,168 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:05,169 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:05,169 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-23 13:51:05,169 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:05,169 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-23 13:51:05,170 INFO L185 omatonBuilderFactory]: Interpolants [5696#(<= main_x 29), 5697#(<= main_x 30), 5698#(<= main_x 31), 5699#(<= main_x 32), 5700#(<= main_x 33), 5701#(<= main_x 34), 5702#(<= main_x 35), 5703#(<= main_x 36), 5704#(<= main_x 37), 5705#(<= main_x 38), 5706#(<= main_x 39), 5707#(<= main_x 40), 5708#(<= main_x 41), 5709#(<= main_x 42), 5710#(<= main_x 43), 5711#(<= main_x 44), 5665#true, 5666#false, 5667#(<= main_x 0), 5668#(<= main_x 1), 5669#(<= main_x 2), 5670#(<= main_x 3), 5671#(<= main_x 4), 5672#(<= main_x 5), 5673#(<= main_x 6), 5674#(<= main_x 7), 5675#(<= main_x 8), 5676#(<= main_x 9), 5677#(<= main_x 10), 5678#(<= main_x 11), 5679#(<= main_x 12), 5680#(<= main_x 13), 5681#(<= main_x 14), 5682#(<= main_x 15), 5683#(<= main_x 16), 5684#(<= main_x 17), 5685#(<= main_x 18), 5686#(<= main_x 19), 5687#(<= main_x 20), 5688#(<= main_x 21), 5689#(<= main_x 22), 5690#(<= main_x 23), 5691#(<= main_x 24), 5692#(<= main_x 25), 5693#(<= main_x 26), 5694#(<= main_x 27), 5695#(<= main_x 28)] [2018-07-23 13:51:05,171 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:05,171 INFO L450 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-23 13:51:05,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-23 13:51:05,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 13:51:05,175 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-07-23 13:51:05,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:05,198 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-23 13:51:05,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-23 13:51:05,199 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-07-23 13:51:05,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:05,199 INFO L225 Difference]: With dead ends: 49 [2018-07-23 13:51:05,199 INFO L226 Difference]: Without dead ends: 48 [2018-07-23 13:51:05,200 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 13:51:05,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-23 13:51:05,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-23 13:51:05,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-23 13:51:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-07-23 13:51:05,203 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-07-23 13:51:05,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:05,204 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-07-23 13:51:05,204 INFO L472 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-23 13:51:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-07-23 13:51:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-23 13:51:05,205 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:05,205 INFO L357 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-07-23 13:51:05,205 INFO L414 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:05,205 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2018-07-23 13:51:05,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:05,421 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:05,421 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-23 13:51:05,421 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:05,421 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-23 13:51:05,422 INFO L185 omatonBuilderFactory]: Interpolants [5952#(<= main_x 44), 5953#(<= main_x 45), 5906#true, 5907#false, 5908#(<= main_x 0), 5909#(<= main_x 1), 5910#(<= main_x 2), 5911#(<= main_x 3), 5912#(<= main_x 4), 5913#(<= main_x 5), 5914#(<= main_x 6), 5915#(<= main_x 7), 5916#(<= main_x 8), 5917#(<= main_x 9), 5918#(<= main_x 10), 5919#(<= main_x 11), 5920#(<= main_x 12), 5921#(<= main_x 13), 5922#(<= main_x 14), 5923#(<= main_x 15), 5924#(<= main_x 16), 5925#(<= main_x 17), 5926#(<= main_x 18), 5927#(<= main_x 19), 5928#(<= main_x 20), 5929#(<= main_x 21), 5930#(<= main_x 22), 5931#(<= main_x 23), 5932#(<= main_x 24), 5933#(<= main_x 25), 5934#(<= main_x 26), 5935#(<= main_x 27), 5936#(<= main_x 28), 5937#(<= main_x 29), 5938#(<= main_x 30), 5939#(<= main_x 31), 5940#(<= main_x 32), 5941#(<= main_x 33), 5942#(<= main_x 34), 5943#(<= main_x 35), 5944#(<= main_x 36), 5945#(<= main_x 37), 5946#(<= main_x 38), 5947#(<= main_x 39), 5948#(<= main_x 40), 5949#(<= main_x 41), 5950#(<= main_x 42), 5951#(<= main_x 43)] [2018-07-23 13:51:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:05,422 INFO L450 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-23 13:51:05,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-23 13:51:05,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 13:51:05,424 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-07-23 13:51:05,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:05,446 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-07-23 13:51:05,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-23 13:51:05,446 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-07-23 13:51:05,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:05,447 INFO L225 Difference]: With dead ends: 50 [2018-07-23 13:51:05,447 INFO L226 Difference]: Without dead ends: 49 [2018-07-23 13:51:05,448 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 13:51:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-23 13:51:05,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-23 13:51:05,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-23 13:51:05,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-23 13:51:05,451 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-07-23 13:51:05,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:05,451 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-23 13:51:05,451 INFO L472 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-23 13:51:05,451 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-23 13:51:05,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 13:51:05,452 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:05,452 INFO L357 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-07-23 13:51:05,452 INFO L414 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:05,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2018-07-23 13:51:05,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:05,623 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:05,623 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-23 13:51:05,623 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:05,623 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-23 13:51:05,624 INFO L185 omatonBuilderFactory]: Interpolants [6152#true, 6153#false, 6154#(<= main_x 0), 6155#(<= main_x 1), 6156#(<= main_x 2), 6157#(<= main_x 3), 6158#(<= main_x 4), 6159#(<= main_x 5), 6160#(<= main_x 6), 6161#(<= main_x 7), 6162#(<= main_x 8), 6163#(<= main_x 9), 6164#(<= main_x 10), 6165#(<= main_x 11), 6166#(<= main_x 12), 6167#(<= main_x 13), 6168#(<= main_x 14), 6169#(<= main_x 15), 6170#(<= main_x 16), 6171#(<= main_x 17), 6172#(<= main_x 18), 6173#(<= main_x 19), 6174#(<= main_x 20), 6175#(<= main_x 21), 6176#(<= main_x 22), 6177#(<= main_x 23), 6178#(<= main_x 24), 6179#(<= main_x 25), 6180#(<= main_x 26), 6181#(<= main_x 27), 6182#(<= main_x 28), 6183#(<= main_x 29), 6184#(<= main_x 30), 6185#(<= main_x 31), 6186#(<= main_x 32), 6187#(<= main_x 33), 6188#(<= main_x 34), 6189#(<= main_x 35), 6190#(<= main_x 36), 6191#(<= main_x 37), 6192#(<= main_x 38), 6193#(<= main_x 39), 6194#(<= main_x 40), 6195#(<= main_x 41), 6196#(<= main_x 42), 6197#(<= main_x 43), 6198#(<= main_x 44), 6199#(<= main_x 45), 6200#(<= main_x 46)] [2018-07-23 13:51:05,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:05,624 INFO L450 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-23 13:51:05,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-23 13:51:05,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 13:51:05,626 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-07-23 13:51:05,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:05,654 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-23 13:51:05,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-23 13:51:05,655 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-07-23 13:51:05,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:05,655 INFO L225 Difference]: With dead ends: 51 [2018-07-23 13:51:05,655 INFO L226 Difference]: Without dead ends: 50 [2018-07-23 13:51:05,656 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 13:51:05,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-23 13:51:05,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-07-23 13:51:05,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-23 13:51:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-07-23 13:51:05,660 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-07-23 13:51:05,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:05,660 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-07-23 13:51:05,660 INFO L472 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-23 13:51:05,660 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-07-23 13:51:05,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-23 13:51:05,661 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:05,661 INFO L357 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-07-23 13:51:05,661 INFO L414 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:05,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2018-07-23 13:51:05,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:05,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:05,831 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:05,831 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-23 13:51:05,832 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:05,832 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-23 13:51:05,832 INFO L185 omatonBuilderFactory]: Interpolants [6403#true, 6404#false, 6405#(<= main_x 0), 6406#(<= main_x 1), 6407#(<= main_x 2), 6408#(<= main_x 3), 6409#(<= main_x 4), 6410#(<= main_x 5), 6411#(<= main_x 6), 6412#(<= main_x 7), 6413#(<= main_x 8), 6414#(<= main_x 9), 6415#(<= main_x 10), 6416#(<= main_x 11), 6417#(<= main_x 12), 6418#(<= main_x 13), 6419#(<= main_x 14), 6420#(<= main_x 15), 6421#(<= main_x 16), 6422#(<= main_x 17), 6423#(<= main_x 18), 6424#(<= main_x 19), 6425#(<= main_x 20), 6426#(<= main_x 21), 6427#(<= main_x 22), 6428#(<= main_x 23), 6429#(<= main_x 24), 6430#(<= main_x 25), 6431#(<= main_x 26), 6432#(<= main_x 27), 6433#(<= main_x 28), 6434#(<= main_x 29), 6435#(<= main_x 30), 6436#(<= main_x 31), 6437#(<= main_x 32), 6438#(<= main_x 33), 6439#(<= main_x 34), 6440#(<= main_x 35), 6441#(<= main_x 36), 6442#(<= main_x 37), 6443#(<= main_x 38), 6444#(<= main_x 39), 6445#(<= main_x 40), 6446#(<= main_x 41), 6447#(<= main_x 42), 6448#(<= main_x 43), 6449#(<= main_x 44), 6450#(<= main_x 45), 6451#(<= main_x 46), 6452#(<= main_x 47)] [2018-07-23 13:51:05,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:05,833 INFO L450 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-23 13:51:05,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-23 13:51:05,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 13:51:05,834 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-07-23 13:51:05,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:05,864 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-07-23 13:51:05,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-23 13:51:05,864 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-07-23 13:51:05,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:05,865 INFO L225 Difference]: With dead ends: 52 [2018-07-23 13:51:05,865 INFO L226 Difference]: Without dead ends: 51 [2018-07-23 13:51:05,866 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 13:51:05,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-23 13:51:05,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-23 13:51:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-23 13:51:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-23 13:51:05,871 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-07-23 13:51:05,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:05,871 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-23 13:51:05,871 INFO L472 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-23 13:51:05,871 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-23 13:51:05,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-23 13:51:05,872 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:05,872 INFO L357 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-07-23 13:51:05,872 INFO L414 AbstractCegarLoop]: === Iteration 49 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:05,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2018-07-23 13:51:05,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:06,045 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:06,045 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-23 13:51:06,046 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:06,046 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-23 13:51:06,046 INFO L185 omatonBuilderFactory]: Interpolants [6659#true, 6660#false, 6661#(<= main_x 0), 6662#(<= main_x 1), 6663#(<= main_x 2), 6664#(<= main_x 3), 6665#(<= main_x 4), 6666#(<= main_x 5), 6667#(<= main_x 6), 6668#(<= main_x 7), 6669#(<= main_x 8), 6670#(<= main_x 9), 6671#(<= main_x 10), 6672#(<= main_x 11), 6673#(<= main_x 12), 6674#(<= main_x 13), 6675#(<= main_x 14), 6676#(<= main_x 15), 6677#(<= main_x 16), 6678#(<= main_x 17), 6679#(<= main_x 18), 6680#(<= main_x 19), 6681#(<= main_x 20), 6682#(<= main_x 21), 6683#(<= main_x 22), 6684#(<= main_x 23), 6685#(<= main_x 24), 6686#(<= main_x 25), 6687#(<= main_x 26), 6688#(<= main_x 27), 6689#(<= main_x 28), 6690#(<= main_x 29), 6691#(<= main_x 30), 6692#(<= main_x 31), 6693#(<= main_x 32), 6694#(<= main_x 33), 6695#(<= main_x 34), 6696#(<= main_x 35), 6697#(<= main_x 36), 6698#(<= main_x 37), 6699#(<= main_x 38), 6700#(<= main_x 39), 6701#(<= main_x 40), 6702#(<= main_x 41), 6703#(<= main_x 42), 6704#(<= main_x 43), 6705#(<= main_x 44), 6706#(<= main_x 45), 6707#(<= main_x 46), 6708#(<= main_x 47), 6709#(<= main_x 48)] [2018-07-23 13:51:06,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:06,047 INFO L450 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-23 13:51:06,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-23 13:51:06,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 13:51:06,048 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-07-23 13:51:06,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:06,076 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-23 13:51:06,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-23 13:51:06,076 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-07-23 13:51:06,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:06,077 INFO L225 Difference]: With dead ends: 53 [2018-07-23 13:51:06,077 INFO L226 Difference]: Without dead ends: 52 [2018-07-23 13:51:06,078 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 13:51:06,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-23 13:51:06,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-07-23 13:51:06,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-23 13:51:06,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-07-23 13:51:06,081 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-07-23 13:51:06,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:06,082 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-07-23 13:51:06,082 INFO L472 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-23 13:51:06,082 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-07-23 13:51:06,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-23 13:51:06,082 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:06,082 INFO L357 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-07-23 13:51:06,083 INFO L414 AbstractCegarLoop]: === Iteration 50 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:06,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2018-07-23 13:51:06,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:06,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:06,258 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:06,258 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-23 13:51:06,258 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:06,258 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-23 13:51:06,259 INFO L185 omatonBuilderFactory]: Interpolants [6920#true, 6921#false, 6922#(<= main_x 0), 6923#(<= main_x 1), 6924#(<= main_x 2), 6925#(<= main_x 3), 6926#(<= main_x 4), 6927#(<= main_x 5), 6928#(<= main_x 6), 6929#(<= main_x 7), 6930#(<= main_x 8), 6931#(<= main_x 9), 6932#(<= main_x 10), 6933#(<= main_x 11), 6934#(<= main_x 12), 6935#(<= main_x 13), 6936#(<= main_x 14), 6937#(<= main_x 15), 6938#(<= main_x 16), 6939#(<= main_x 17), 6940#(<= main_x 18), 6941#(<= main_x 19), 6942#(<= main_x 20), 6943#(<= main_x 21), 6944#(<= main_x 22), 6945#(<= main_x 23), 6946#(<= main_x 24), 6947#(<= main_x 25), 6948#(<= main_x 26), 6949#(<= main_x 27), 6950#(<= main_x 28), 6951#(<= main_x 29), 6952#(<= main_x 30), 6953#(<= main_x 31), 6954#(<= main_x 32), 6955#(<= main_x 33), 6956#(<= main_x 34), 6957#(<= main_x 35), 6958#(<= main_x 36), 6959#(<= main_x 37), 6960#(<= main_x 38), 6961#(<= main_x 39), 6962#(<= main_x 40), 6963#(<= main_x 41), 6964#(<= main_x 42), 6965#(<= main_x 43), 6966#(<= main_x 44), 6967#(<= main_x 45), 6968#(<= main_x 46), 6969#(<= main_x 47), 6970#(<= main_x 48), 6971#(<= main_x 49)] [2018-07-23 13:51:06,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:06,259 INFO L450 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-23 13:51:06,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-23 13:51:06,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 13:51:06,261 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-07-23 13:51:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:06,290 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-23 13:51:06,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-23 13:51:06,291 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-07-23 13:51:06,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:06,291 INFO L225 Difference]: With dead ends: 54 [2018-07-23 13:51:06,292 INFO L226 Difference]: Without dead ends: 53 [2018-07-23 13:51:06,292 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 13:51:06,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-23 13:51:06,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-23 13:51:06,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-23 13:51:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-23 13:51:06,295 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-07-23 13:51:06,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:06,295 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-23 13:51:06,295 INFO L472 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-23 13:51:06,295 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-23 13:51:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-23 13:51:06,296 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:06,296 INFO L357 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-07-23 13:51:06,296 INFO L414 AbstractCegarLoop]: === Iteration 51 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:06,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2018-07-23 13:51:06,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:06,495 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:06,495 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-23 13:51:06,495 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:06,495 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-23 13:51:06,496 INFO L185 omatonBuilderFactory]: Interpolants [7186#true, 7187#false, 7188#(<= main_x 0), 7189#(<= main_x 1), 7190#(<= main_x 2), 7191#(<= main_x 3), 7192#(<= main_x 4), 7193#(<= main_x 5), 7194#(<= main_x 6), 7195#(<= main_x 7), 7196#(<= main_x 8), 7197#(<= main_x 9), 7198#(<= main_x 10), 7199#(<= main_x 11), 7200#(<= main_x 12), 7201#(<= main_x 13), 7202#(<= main_x 14), 7203#(<= main_x 15), 7204#(<= main_x 16), 7205#(<= main_x 17), 7206#(<= main_x 18), 7207#(<= main_x 19), 7208#(<= main_x 20), 7209#(<= main_x 21), 7210#(<= main_x 22), 7211#(<= main_x 23), 7212#(<= main_x 24), 7213#(<= main_x 25), 7214#(<= main_x 26), 7215#(<= main_x 27), 7216#(<= main_x 28), 7217#(<= main_x 29), 7218#(<= main_x 30), 7219#(<= main_x 31), 7220#(<= main_x 32), 7221#(<= main_x 33), 7222#(<= main_x 34), 7223#(<= main_x 35), 7224#(<= main_x 36), 7225#(<= main_x 37), 7226#(<= main_x 38), 7227#(<= main_x 39), 7228#(<= main_x 40), 7229#(<= main_x 41), 7230#(<= main_x 42), 7231#(<= main_x 43), 7232#(<= main_x 44), 7233#(<= main_x 45), 7234#(<= main_x 46), 7235#(<= main_x 47), 7236#(<= main_x 48), 7237#(<= main_x 49), 7238#(<= main_x 50)] [2018-07-23 13:51:06,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:06,496 INFO L450 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-23 13:51:06,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-23 13:51:06,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 13:51:06,498 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-07-23 13:51:06,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:06,527 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-23 13:51:06,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-23 13:51:06,527 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-07-23 13:51:06,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:06,528 INFO L225 Difference]: With dead ends: 55 [2018-07-23 13:51:06,528 INFO L226 Difference]: Without dead ends: 54 [2018-07-23 13:51:06,529 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 13:51:06,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-23 13:51:06,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-07-23 13:51:06,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-23 13:51:06,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-07-23 13:51:06,532 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-07-23 13:51:06,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:06,532 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-07-23 13:51:06,532 INFO L472 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-23 13:51:06,533 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-07-23 13:51:06,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-23 13:51:06,533 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:06,533 INFO L357 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-07-23 13:51:06,533 INFO L414 AbstractCegarLoop]: === Iteration 52 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:06,534 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2018-07-23 13:51:06,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:06,708 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:06,708 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-23 13:51:06,709 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:06,709 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-23 13:51:06,709 INFO L185 omatonBuilderFactory]: Interpolants [7457#true, 7458#false, 7459#(<= main_x 0), 7460#(<= main_x 1), 7461#(<= main_x 2), 7462#(<= main_x 3), 7463#(<= main_x 4), 7464#(<= main_x 5), 7465#(<= main_x 6), 7466#(<= main_x 7), 7467#(<= main_x 8), 7468#(<= main_x 9), 7469#(<= main_x 10), 7470#(<= main_x 11), 7471#(<= main_x 12), 7472#(<= main_x 13), 7473#(<= main_x 14), 7474#(<= main_x 15), 7475#(<= main_x 16), 7476#(<= main_x 17), 7477#(<= main_x 18), 7478#(<= main_x 19), 7479#(<= main_x 20), 7480#(<= main_x 21), 7481#(<= main_x 22), 7482#(<= main_x 23), 7483#(<= main_x 24), 7484#(<= main_x 25), 7485#(<= main_x 26), 7486#(<= main_x 27), 7487#(<= main_x 28), 7488#(<= main_x 29), 7489#(<= main_x 30), 7490#(<= main_x 31), 7491#(<= main_x 32), 7492#(<= main_x 33), 7493#(<= main_x 34), 7494#(<= main_x 35), 7495#(<= main_x 36), 7496#(<= main_x 37), 7497#(<= main_x 38), 7498#(<= main_x 39), 7499#(<= main_x 40), 7500#(<= main_x 41), 7501#(<= main_x 42), 7502#(<= main_x 43), 7503#(<= main_x 44), 7504#(<= main_x 45), 7505#(<= main_x 46), 7506#(<= main_x 47), 7507#(<= main_x 48), 7508#(<= main_x 49), 7509#(<= main_x 50), 7510#(<= main_x 51)] [2018-07-23 13:51:06,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:06,710 INFO L450 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-23 13:51:06,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-23 13:51:06,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 13:51:06,711 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-07-23 13:51:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:06,738 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-07-23 13:51:06,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-23 13:51:06,739 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-07-23 13:51:06,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:06,739 INFO L225 Difference]: With dead ends: 56 [2018-07-23 13:51:06,739 INFO L226 Difference]: Without dead ends: 55 [2018-07-23 13:51:06,740 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 13:51:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-23 13:51:06,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-23 13:51:06,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-23 13:51:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-23 13:51:06,743 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-07-23 13:51:06,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:06,743 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-23 13:51:06,743 INFO L472 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-23 13:51:06,743 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-23 13:51:06,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-23 13:51:06,744 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:06,744 INFO L357 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-07-23 13:51:06,744 INFO L414 AbstractCegarLoop]: === Iteration 53 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:06,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2018-07-23 13:51:06,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:06,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:06,913 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:06,913 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-23 13:51:06,914 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:06,914 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-23 13:51:06,914 INFO L185 omatonBuilderFactory]: Interpolants [7733#true, 7734#false, 7735#(<= main_x 0), 7736#(<= main_x 1), 7737#(<= main_x 2), 7738#(<= main_x 3), 7739#(<= main_x 4), 7740#(<= main_x 5), 7741#(<= main_x 6), 7742#(<= main_x 7), 7743#(<= main_x 8), 7744#(<= main_x 9), 7745#(<= main_x 10), 7746#(<= main_x 11), 7747#(<= main_x 12), 7748#(<= main_x 13), 7749#(<= main_x 14), 7750#(<= main_x 15), 7751#(<= main_x 16), 7752#(<= main_x 17), 7753#(<= main_x 18), 7754#(<= main_x 19), 7755#(<= main_x 20), 7756#(<= main_x 21), 7757#(<= main_x 22), 7758#(<= main_x 23), 7759#(<= main_x 24), 7760#(<= main_x 25), 7761#(<= main_x 26), 7762#(<= main_x 27), 7763#(<= main_x 28), 7764#(<= main_x 29), 7765#(<= main_x 30), 7766#(<= main_x 31), 7767#(<= main_x 32), 7768#(<= main_x 33), 7769#(<= main_x 34), 7770#(<= main_x 35), 7771#(<= main_x 36), 7772#(<= main_x 37), 7773#(<= main_x 38), 7774#(<= main_x 39), 7775#(<= main_x 40), 7776#(<= main_x 41), 7777#(<= main_x 42), 7778#(<= main_x 43), 7779#(<= main_x 44), 7780#(<= main_x 45), 7781#(<= main_x 46), 7782#(<= main_x 47), 7783#(<= main_x 48), 7784#(<= main_x 49), 7785#(<= main_x 50), 7786#(<= main_x 51), 7787#(<= main_x 52)] [2018-07-23 13:51:06,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:06,915 INFO L450 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-23 13:51:06,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-23 13:51:06,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 13:51:06,916 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-07-23 13:51:06,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:06,945 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-23 13:51:06,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-23 13:51:06,945 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-07-23 13:51:06,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:06,946 INFO L225 Difference]: With dead ends: 57 [2018-07-23 13:51:06,946 INFO L226 Difference]: Without dead ends: 56 [2018-07-23 13:51:06,947 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 13:51:06,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-23 13:51:06,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-07-23 13:51:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-23 13:51:06,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-23 13:51:06,950 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-07-23 13:51:06,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:06,950 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-23 13:51:06,950 INFO L472 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-23 13:51:06,951 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-23 13:51:06,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-23 13:51:06,951 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:06,951 INFO L357 BasicCegarLoop]: trace histogram [53, 1, 1] [2018-07-23 13:51:06,951 INFO L414 AbstractCegarLoop]: === Iteration 54 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:06,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2018-07-23 13:51:06,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:07,134 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:07,134 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-23 13:51:07,134 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:07,135 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-23 13:51:07,135 INFO L185 omatonBuilderFactory]: Interpolants [8064#(<= main_x 48), 8065#(<= main_x 49), 8066#(<= main_x 50), 8067#(<= main_x 51), 8068#(<= main_x 52), 8069#(<= main_x 53), 8014#true, 8015#false, 8016#(<= main_x 0), 8017#(<= main_x 1), 8018#(<= main_x 2), 8019#(<= main_x 3), 8020#(<= main_x 4), 8021#(<= main_x 5), 8022#(<= main_x 6), 8023#(<= main_x 7), 8024#(<= main_x 8), 8025#(<= main_x 9), 8026#(<= main_x 10), 8027#(<= main_x 11), 8028#(<= main_x 12), 8029#(<= main_x 13), 8030#(<= main_x 14), 8031#(<= main_x 15), 8032#(<= main_x 16), 8033#(<= main_x 17), 8034#(<= main_x 18), 8035#(<= main_x 19), 8036#(<= main_x 20), 8037#(<= main_x 21), 8038#(<= main_x 22), 8039#(<= main_x 23), 8040#(<= main_x 24), 8041#(<= main_x 25), 8042#(<= main_x 26), 8043#(<= main_x 27), 8044#(<= main_x 28), 8045#(<= main_x 29), 8046#(<= main_x 30), 8047#(<= main_x 31), 8048#(<= main_x 32), 8049#(<= main_x 33), 8050#(<= main_x 34), 8051#(<= main_x 35), 8052#(<= main_x 36), 8053#(<= main_x 37), 8054#(<= main_x 38), 8055#(<= main_x 39), 8056#(<= main_x 40), 8057#(<= main_x 41), 8058#(<= main_x 42), 8059#(<= main_x 43), 8060#(<= main_x 44), 8061#(<= main_x 45), 8062#(<= main_x 46), 8063#(<= main_x 47)] [2018-07-23 13:51:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:07,136 INFO L450 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-23 13:51:07,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-23 13:51:07,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 13:51:07,137 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-07-23 13:51:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:07,165 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-07-23 13:51:07,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-23 13:51:07,165 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-07-23 13:51:07,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:07,166 INFO L225 Difference]: With dead ends: 58 [2018-07-23 13:51:07,166 INFO L226 Difference]: Without dead ends: 57 [2018-07-23 13:51:07,167 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 13:51:07,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-23 13:51:07,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-23 13:51:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-23 13:51:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-23 13:51:07,170 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-07-23 13:51:07,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:07,170 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-23 13:51:07,170 INFO L472 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-23 13:51:07,170 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-23 13:51:07,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-23 13:51:07,171 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:07,171 INFO L357 BasicCegarLoop]: trace histogram [54, 1, 1] [2018-07-23 13:51:07,171 INFO L414 AbstractCegarLoop]: === Iteration 55 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:07,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2018-07-23 13:51:07,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:07,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:07,364 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:07,364 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-23 13:51:07,364 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:07,365 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-23 13:51:07,365 INFO L185 omatonBuilderFactory]: Interpolants [8320#(<= main_x 18), 8321#(<= main_x 19), 8322#(<= main_x 20), 8323#(<= main_x 21), 8324#(<= main_x 22), 8325#(<= main_x 23), 8326#(<= main_x 24), 8327#(<= main_x 25), 8328#(<= main_x 26), 8329#(<= main_x 27), 8330#(<= main_x 28), 8331#(<= main_x 29), 8332#(<= main_x 30), 8333#(<= main_x 31), 8334#(<= main_x 32), 8335#(<= main_x 33), 8336#(<= main_x 34), 8337#(<= main_x 35), 8338#(<= main_x 36), 8339#(<= main_x 37), 8340#(<= main_x 38), 8341#(<= main_x 39), 8342#(<= main_x 40), 8343#(<= main_x 41), 8344#(<= main_x 42), 8345#(<= main_x 43), 8346#(<= main_x 44), 8347#(<= main_x 45), 8348#(<= main_x 46), 8349#(<= main_x 47), 8350#(<= main_x 48), 8351#(<= main_x 49), 8352#(<= main_x 50), 8353#(<= main_x 51), 8354#(<= main_x 52), 8355#(<= main_x 53), 8356#(<= main_x 54), 8300#true, 8301#false, 8302#(<= main_x 0), 8303#(<= main_x 1), 8304#(<= main_x 2), 8305#(<= main_x 3), 8306#(<= main_x 4), 8307#(<= main_x 5), 8308#(<= main_x 6), 8309#(<= main_x 7), 8310#(<= main_x 8), 8311#(<= main_x 9), 8312#(<= main_x 10), 8313#(<= main_x 11), 8314#(<= main_x 12), 8315#(<= main_x 13), 8316#(<= main_x 14), 8317#(<= main_x 15), 8318#(<= main_x 16), 8319#(<= main_x 17)] [2018-07-23 13:51:07,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:07,366 INFO L450 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-23 13:51:07,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-23 13:51:07,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 13:51:07,367 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2018-07-23 13:51:07,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:07,398 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-23 13:51:07,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-23 13:51:07,399 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-07-23 13:51:07,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:07,399 INFO L225 Difference]: With dead ends: 59 [2018-07-23 13:51:07,400 INFO L226 Difference]: Without dead ends: 58 [2018-07-23 13:51:07,401 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 13:51:07,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-23 13:51:07,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-07-23 13:51:07,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-23 13:51:07,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-07-23 13:51:07,404 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-07-23 13:51:07,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:07,404 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-07-23 13:51:07,404 INFO L472 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-23 13:51:07,404 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-07-23 13:51:07,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-23 13:51:07,405 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:07,405 INFO L357 BasicCegarLoop]: trace histogram [55, 1, 1] [2018-07-23 13:51:07,405 INFO L414 AbstractCegarLoop]: === Iteration 56 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:07,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895647, now seen corresponding path program 55 times [2018-07-23 13:51:07,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:07,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:07,649 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:07,649 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-23 13:51:07,649 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:07,650 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-23 13:51:07,650 INFO L185 omatonBuilderFactory]: Interpolants [8591#true, 8592#false, 8593#(<= main_x 0), 8594#(<= main_x 1), 8595#(<= main_x 2), 8596#(<= main_x 3), 8597#(<= main_x 4), 8598#(<= main_x 5), 8599#(<= main_x 6), 8600#(<= main_x 7), 8601#(<= main_x 8), 8602#(<= main_x 9), 8603#(<= main_x 10), 8604#(<= main_x 11), 8605#(<= main_x 12), 8606#(<= main_x 13), 8607#(<= main_x 14), 8608#(<= main_x 15), 8609#(<= main_x 16), 8610#(<= main_x 17), 8611#(<= main_x 18), 8612#(<= main_x 19), 8613#(<= main_x 20), 8614#(<= main_x 21), 8615#(<= main_x 22), 8616#(<= main_x 23), 8617#(<= main_x 24), 8618#(<= main_x 25), 8619#(<= main_x 26), 8620#(<= main_x 27), 8621#(<= main_x 28), 8622#(<= main_x 29), 8623#(<= main_x 30), 8624#(<= main_x 31), 8625#(<= main_x 32), 8626#(<= main_x 33), 8627#(<= main_x 34), 8628#(<= main_x 35), 8629#(<= main_x 36), 8630#(<= main_x 37), 8631#(<= main_x 38), 8632#(<= main_x 39), 8633#(<= main_x 40), 8634#(<= main_x 41), 8635#(<= main_x 42), 8636#(<= main_x 43), 8637#(<= main_x 44), 8638#(<= main_x 45), 8639#(<= main_x 46), 8640#(<= main_x 47), 8641#(<= main_x 48), 8642#(<= main_x 49), 8643#(<= main_x 50), 8644#(<= main_x 51), 8645#(<= main_x 52), 8646#(<= main_x 53), 8647#(<= main_x 54), 8648#(<= main_x 55)] [2018-07-23 13:51:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:07,651 INFO L450 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-23 13:51:07,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-23 13:51:07,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 13:51:07,653 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-07-23 13:51:07,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:07,696 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-23 13:51:07,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-23 13:51:07,697 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-07-23 13:51:07,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:07,698 INFO L225 Difference]: With dead ends: 60 [2018-07-23 13:51:07,698 INFO L226 Difference]: Without dead ends: 59 [2018-07-23 13:51:07,699 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 13:51:07,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-23 13:51:07,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-23 13:51:07,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-23 13:51:07,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-23 13:51:07,702 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-07-23 13:51:07,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:07,703 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-23 13:51:07,703 INFO L472 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-23 13:51:07,703 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-23 13:51:07,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-23 13:51:07,704 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:07,704 INFO L357 BasicCegarLoop]: trace histogram [56, 1, 1] [2018-07-23 13:51:07,704 INFO L414 AbstractCegarLoop]: === Iteration 57 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:07,704 INFO L82 PathProgramCache]: Analyzing trace with hash -836059449, now seen corresponding path program 56 times [2018-07-23 13:51:07,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:07,956 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:07,956 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-23 13:51:07,956 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:07,956 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-23 13:51:07,957 INFO L185 omatonBuilderFactory]: Interpolants [8887#true, 8888#false, 8889#(<= main_x 0), 8890#(<= main_x 1), 8891#(<= main_x 2), 8892#(<= main_x 3), 8893#(<= main_x 4), 8894#(<= main_x 5), 8895#(<= main_x 6), 8896#(<= main_x 7), 8897#(<= main_x 8), 8898#(<= main_x 9), 8899#(<= main_x 10), 8900#(<= main_x 11), 8901#(<= main_x 12), 8902#(<= main_x 13), 8903#(<= main_x 14), 8904#(<= main_x 15), 8905#(<= main_x 16), 8906#(<= main_x 17), 8907#(<= main_x 18), 8908#(<= main_x 19), 8909#(<= main_x 20), 8910#(<= main_x 21), 8911#(<= main_x 22), 8912#(<= main_x 23), 8913#(<= main_x 24), 8914#(<= main_x 25), 8915#(<= main_x 26), 8916#(<= main_x 27), 8917#(<= main_x 28), 8918#(<= main_x 29), 8919#(<= main_x 30), 8920#(<= main_x 31), 8921#(<= main_x 32), 8922#(<= main_x 33), 8923#(<= main_x 34), 8924#(<= main_x 35), 8925#(<= main_x 36), 8926#(<= main_x 37), 8927#(<= main_x 38), 8928#(<= main_x 39), 8929#(<= main_x 40), 8930#(<= main_x 41), 8931#(<= main_x 42), 8932#(<= main_x 43), 8933#(<= main_x 44), 8934#(<= main_x 45), 8935#(<= main_x 46), 8936#(<= main_x 47), 8937#(<= main_x 48), 8938#(<= main_x 49), 8939#(<= main_x 50), 8940#(<= main_x 51), 8941#(<= main_x 52), 8942#(<= main_x 53), 8943#(<= main_x 54), 8944#(<= main_x 55), 8945#(<= main_x 56)] [2018-07-23 13:51:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:07,957 INFO L450 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-23 13:51:07,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-23 13:51:07,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 13:51:07,959 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2018-07-23 13:51:07,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:07,998 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-23 13:51:07,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-23 13:51:07,998 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2018-07-23 13:51:07,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:07,999 INFO L225 Difference]: With dead ends: 61 [2018-07-23 13:51:07,999 INFO L226 Difference]: Without dead ends: 60 [2018-07-23 13:51:08,000 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 13:51:08,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-23 13:51:08,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-07-23 13:51:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-23 13:51:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-07-23 13:51:08,003 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-07-23 13:51:08,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:08,003 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-07-23 13:51:08,003 INFO L472 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-23 13:51:08,003 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-07-23 13:51:08,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-23 13:51:08,004 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:08,004 INFO L357 BasicCegarLoop]: trace histogram [57, 1, 1] [2018-07-23 13:51:08,004 INFO L414 AbstractCegarLoop]: === Iteration 58 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:08,005 INFO L82 PathProgramCache]: Analyzing trace with hash -148039199, now seen corresponding path program 57 times [2018-07-23 13:51:08,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:08,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:08,204 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:08,204 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-23 13:51:08,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:08,205 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-23 13:51:08,205 INFO L185 omatonBuilderFactory]: Interpolants [9216#(<= main_x 26), 9217#(<= main_x 27), 9218#(<= main_x 28), 9219#(<= main_x 29), 9220#(<= main_x 30), 9221#(<= main_x 31), 9222#(<= main_x 32), 9223#(<= main_x 33), 9224#(<= main_x 34), 9225#(<= main_x 35), 9226#(<= main_x 36), 9227#(<= main_x 37), 9228#(<= main_x 38), 9229#(<= main_x 39), 9230#(<= main_x 40), 9231#(<= main_x 41), 9232#(<= main_x 42), 9233#(<= main_x 43), 9234#(<= main_x 44), 9235#(<= main_x 45), 9236#(<= main_x 46), 9237#(<= main_x 47), 9238#(<= main_x 48), 9239#(<= main_x 49), 9240#(<= main_x 50), 9241#(<= main_x 51), 9242#(<= main_x 52), 9243#(<= main_x 53), 9244#(<= main_x 54), 9245#(<= main_x 55), 9246#(<= main_x 56), 9247#(<= main_x 57), 9188#true, 9189#false, 9190#(<= main_x 0), 9191#(<= main_x 1), 9192#(<= main_x 2), 9193#(<= main_x 3), 9194#(<= main_x 4), 9195#(<= main_x 5), 9196#(<= main_x 6), 9197#(<= main_x 7), 9198#(<= main_x 8), 9199#(<= main_x 9), 9200#(<= main_x 10), 9201#(<= main_x 11), 9202#(<= main_x 12), 9203#(<= main_x 13), 9204#(<= main_x 14), 9205#(<= main_x 15), 9206#(<= main_x 16), 9207#(<= main_x 17), 9208#(<= main_x 18), 9209#(<= main_x 19), 9210#(<= main_x 20), 9211#(<= main_x 21), 9212#(<= main_x 22), 9213#(<= main_x 23), 9214#(<= main_x 24), 9215#(<= main_x 25)] [2018-07-23 13:51:08,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:08,206 INFO L450 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-23 13:51:08,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-23 13:51:08,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 13:51:08,207 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-07-23 13:51:08,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:08,237 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-07-23 13:51:08,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-23 13:51:08,237 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-07-23 13:51:08,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:08,238 INFO L225 Difference]: With dead ends: 62 [2018-07-23 13:51:08,238 INFO L226 Difference]: Without dead ends: 61 [2018-07-23 13:51:08,239 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 13:51:08,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-23 13:51:08,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-23 13:51:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-23 13:51:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-23 13:51:08,242 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-07-23 13:51:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:08,242 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-23 13:51:08,242 INFO L472 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-23 13:51:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-23 13:51:08,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-23 13:51:08,243 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:08,243 INFO L357 BasicCegarLoop]: trace histogram [58, 1, 1] [2018-07-23 13:51:08,243 INFO L414 AbstractCegarLoop]: === Iteration 59 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:08,244 INFO L82 PathProgramCache]: Analyzing trace with hash -294247929, now seen corresponding path program 58 times [2018-07-23 13:51:08,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:08,452 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:08,452 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-23 13:51:08,452 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:08,452 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-23 13:51:08,453 INFO L185 omatonBuilderFactory]: Interpolants [9494#true, 9495#false, 9496#(<= main_x 0), 9497#(<= main_x 1), 9498#(<= main_x 2), 9499#(<= main_x 3), 9500#(<= main_x 4), 9501#(<= main_x 5), 9502#(<= main_x 6), 9503#(<= main_x 7), 9504#(<= main_x 8), 9505#(<= main_x 9), 9506#(<= main_x 10), 9507#(<= main_x 11), 9508#(<= main_x 12), 9509#(<= main_x 13), 9510#(<= main_x 14), 9511#(<= main_x 15), 9512#(<= main_x 16), 9513#(<= main_x 17), 9514#(<= main_x 18), 9515#(<= main_x 19), 9516#(<= main_x 20), 9517#(<= main_x 21), 9518#(<= main_x 22), 9519#(<= main_x 23), 9520#(<= main_x 24), 9521#(<= main_x 25), 9522#(<= main_x 26), 9523#(<= main_x 27), 9524#(<= main_x 28), 9525#(<= main_x 29), 9526#(<= main_x 30), 9527#(<= main_x 31), 9528#(<= main_x 32), 9529#(<= main_x 33), 9530#(<= main_x 34), 9531#(<= main_x 35), 9532#(<= main_x 36), 9533#(<= main_x 37), 9534#(<= main_x 38), 9535#(<= main_x 39), 9536#(<= main_x 40), 9537#(<= main_x 41), 9538#(<= main_x 42), 9539#(<= main_x 43), 9540#(<= main_x 44), 9541#(<= main_x 45), 9542#(<= main_x 46), 9543#(<= main_x 47), 9544#(<= main_x 48), 9545#(<= main_x 49), 9546#(<= main_x 50), 9547#(<= main_x 51), 9548#(<= main_x 52), 9549#(<= main_x 53), 9550#(<= main_x 54), 9551#(<= main_x 55), 9552#(<= main_x 56), 9553#(<= main_x 57), 9554#(<= main_x 58)] [2018-07-23 13:51:08,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:08,453 INFO L450 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-23 13:51:08,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-23 13:51:08,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 13:51:08,455 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2018-07-23 13:51:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:08,495 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-23 13:51:08,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-23 13:51:08,495 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2018-07-23 13:51:08,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:08,496 INFO L225 Difference]: With dead ends: 63 [2018-07-23 13:51:08,496 INFO L226 Difference]: Without dead ends: 62 [2018-07-23 13:51:08,498 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 13:51:08,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-23 13:51:08,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-07-23 13:51:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-23 13:51:08,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-07-23 13:51:08,501 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-07-23 13:51:08,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:08,502 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-07-23 13:51:08,502 INFO L472 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-23 13:51:08,502 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-07-23 13:51:08,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-23 13:51:08,502 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:08,503 INFO L357 BasicCegarLoop]: trace histogram [59, 1, 1] [2018-07-23 13:51:08,503 INFO L414 AbstractCegarLoop]: === Iteration 60 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:08,503 INFO L82 PathProgramCache]: Analyzing trace with hash -531751263, now seen corresponding path program 59 times [2018-07-23 13:51:08,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:08,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:08,718 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:08,718 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-23 13:51:08,718 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:08,719 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-23 13:51:08,719 INFO L185 omatonBuilderFactory]: Interpolants [9856#(<= main_x 49), 9857#(<= main_x 50), 9858#(<= main_x 51), 9859#(<= main_x 52), 9860#(<= main_x 53), 9861#(<= main_x 54), 9862#(<= main_x 55), 9863#(<= main_x 56), 9864#(<= main_x 57), 9865#(<= main_x 58), 9866#(<= main_x 59), 9805#true, 9806#false, 9807#(<= main_x 0), 9808#(<= main_x 1), 9809#(<= main_x 2), 9810#(<= main_x 3), 9811#(<= main_x 4), 9812#(<= main_x 5), 9813#(<= main_x 6), 9814#(<= main_x 7), 9815#(<= main_x 8), 9816#(<= main_x 9), 9817#(<= main_x 10), 9818#(<= main_x 11), 9819#(<= main_x 12), 9820#(<= main_x 13), 9821#(<= main_x 14), 9822#(<= main_x 15), 9823#(<= main_x 16), 9824#(<= main_x 17), 9825#(<= main_x 18), 9826#(<= main_x 19), 9827#(<= main_x 20), 9828#(<= main_x 21), 9829#(<= main_x 22), 9830#(<= main_x 23), 9831#(<= main_x 24), 9832#(<= main_x 25), 9833#(<= main_x 26), 9834#(<= main_x 27), 9835#(<= main_x 28), 9836#(<= main_x 29), 9837#(<= main_x 30), 9838#(<= main_x 31), 9839#(<= main_x 32), 9840#(<= main_x 33), 9841#(<= main_x 34), 9842#(<= main_x 35), 9843#(<= main_x 36), 9844#(<= main_x 37), 9845#(<= main_x 38), 9846#(<= main_x 39), 9847#(<= main_x 40), 9848#(<= main_x 41), 9849#(<= main_x 42), 9850#(<= main_x 43), 9851#(<= main_x 44), 9852#(<= main_x 45), 9853#(<= main_x 46), 9854#(<= main_x 47), 9855#(<= main_x 48)] [2018-07-23 13:51:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:08,720 INFO L450 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-23 13:51:08,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-23 13:51:08,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 13:51:08,723 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-07-23 13:51:08,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:08,758 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-07-23 13:51:08,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-23 13:51:08,758 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-07-23 13:51:08,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:08,759 INFO L225 Difference]: With dead ends: 64 [2018-07-23 13:51:08,759 INFO L226 Difference]: Without dead ends: 63 [2018-07-23 13:51:08,760 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 13:51:08,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-23 13:51:08,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-23 13:51:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-23 13:51:08,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-23 13:51:08,763 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-07-23 13:51:08,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:08,764 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-23 13:51:08,764 INFO L472 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-23 13:51:08,764 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-23 13:51:08,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-23 13:51:08,764 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:08,765 INFO L357 BasicCegarLoop]: trace histogram [60, 1, 1] [2018-07-23 13:51:08,765 INFO L414 AbstractCegarLoop]: === Iteration 61 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:08,765 INFO L82 PathProgramCache]: Analyzing trace with hash 695579975, now seen corresponding path program 60 times [2018-07-23 13:51:08,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:08,996 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:08,996 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-23 13:51:08,996 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:08,997 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-23 13:51:08,997 INFO L185 omatonBuilderFactory]: Interpolants [10121#true, 10122#false, 10123#(<= main_x 0), 10124#(<= main_x 1), 10125#(<= main_x 2), 10126#(<= main_x 3), 10127#(<= main_x 4), 10128#(<= main_x 5), 10129#(<= main_x 6), 10130#(<= main_x 7), 10131#(<= main_x 8), 10132#(<= main_x 9), 10133#(<= main_x 10), 10134#(<= main_x 11), 10135#(<= main_x 12), 10136#(<= main_x 13), 10137#(<= main_x 14), 10138#(<= main_x 15), 10139#(<= main_x 16), 10140#(<= main_x 17), 10141#(<= main_x 18), 10142#(<= main_x 19), 10143#(<= main_x 20), 10144#(<= main_x 21), 10145#(<= main_x 22), 10146#(<= main_x 23), 10147#(<= main_x 24), 10148#(<= main_x 25), 10149#(<= main_x 26), 10150#(<= main_x 27), 10151#(<= main_x 28), 10152#(<= main_x 29), 10153#(<= main_x 30), 10154#(<= main_x 31), 10155#(<= main_x 32), 10156#(<= main_x 33), 10157#(<= main_x 34), 10158#(<= main_x 35), 10159#(<= main_x 36), 10160#(<= main_x 37), 10161#(<= main_x 38), 10162#(<= main_x 39), 10163#(<= main_x 40), 10164#(<= main_x 41), 10165#(<= main_x 42), 10166#(<= main_x 43), 10167#(<= main_x 44), 10168#(<= main_x 45), 10169#(<= main_x 46), 10170#(<= main_x 47), 10171#(<= main_x 48), 10172#(<= main_x 49), 10173#(<= main_x 50), 10174#(<= main_x 51), 10175#(<= main_x 52), 10176#(<= main_x 53), 10177#(<= main_x 54), 10178#(<= main_x 55), 10179#(<= main_x 56), 10180#(<= main_x 57), 10181#(<= main_x 58), 10182#(<= main_x 59), 10183#(<= main_x 60)] [2018-07-23 13:51:08,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:08,998 INFO L450 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-23 13:51:08,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-23 13:51:08,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 13:51:09,000 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2018-07-23 13:51:09,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:09,045 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-23 13:51:09,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-23 13:51:09,046 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2018-07-23 13:51:09,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:09,046 INFO L225 Difference]: With dead ends: 65 [2018-07-23 13:51:09,046 INFO L226 Difference]: Without dead ends: 64 [2018-07-23 13:51:09,048 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 13:51:09,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-23 13:51:09,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-07-23 13:51:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-23 13:51:09,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-07-23 13:51:09,051 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-07-23 13:51:09,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:09,051 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-07-23 13:51:09,051 INFO L472 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-23 13:51:09,051 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-07-23 13:51:09,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-23 13:51:09,052 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:09,052 INFO L357 BasicCegarLoop]: trace histogram [61, 1, 1] [2018-07-23 13:51:09,052 INFO L414 AbstractCegarLoop]: === Iteration 62 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:09,053 INFO L82 PathProgramCache]: Analyzing trace with hash 88142689, now seen corresponding path program 61 times [2018-07-23 13:51:09,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:09,286 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:09,286 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-23 13:51:09,286 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:09,287 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-23 13:51:09,287 INFO L185 omatonBuilderFactory]: Interpolants [10496#(<= main_x 52), 10497#(<= main_x 53), 10498#(<= main_x 54), 10499#(<= main_x 55), 10500#(<= main_x 56), 10501#(<= main_x 57), 10502#(<= main_x 58), 10503#(<= main_x 59), 10504#(<= main_x 60), 10505#(<= main_x 61), 10442#true, 10443#false, 10444#(<= main_x 0), 10445#(<= main_x 1), 10446#(<= main_x 2), 10447#(<= main_x 3), 10448#(<= main_x 4), 10449#(<= main_x 5), 10450#(<= main_x 6), 10451#(<= main_x 7), 10452#(<= main_x 8), 10453#(<= main_x 9), 10454#(<= main_x 10), 10455#(<= main_x 11), 10456#(<= main_x 12), 10457#(<= main_x 13), 10458#(<= main_x 14), 10459#(<= main_x 15), 10460#(<= main_x 16), 10461#(<= main_x 17), 10462#(<= main_x 18), 10463#(<= main_x 19), 10464#(<= main_x 20), 10465#(<= main_x 21), 10466#(<= main_x 22), 10467#(<= main_x 23), 10468#(<= main_x 24), 10469#(<= main_x 25), 10470#(<= main_x 26), 10471#(<= main_x 27), 10472#(<= main_x 28), 10473#(<= main_x 29), 10474#(<= main_x 30), 10475#(<= main_x 31), 10476#(<= main_x 32), 10477#(<= main_x 33), 10478#(<= main_x 34), 10479#(<= main_x 35), 10480#(<= main_x 36), 10481#(<= main_x 37), 10482#(<= main_x 38), 10483#(<= main_x 39), 10484#(<= main_x 40), 10485#(<= main_x 41), 10486#(<= main_x 42), 10487#(<= main_x 43), 10488#(<= main_x 44), 10489#(<= main_x 45), 10490#(<= main_x 46), 10491#(<= main_x 47), 10492#(<= main_x 48), 10493#(<= main_x 49), 10494#(<= main_x 50), 10495#(<= main_x 51)] [2018-07-23 13:51:09,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:09,288 INFO L450 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-23 13:51:09,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-23 13:51:09,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 13:51:09,290 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-07-23 13:51:09,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:09,324 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-23 13:51:09,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-23 13:51:09,324 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-07-23 13:51:09,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:09,325 INFO L225 Difference]: With dead ends: 66 [2018-07-23 13:51:09,325 INFO L226 Difference]: Without dead ends: 65 [2018-07-23 13:51:09,326 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 13:51:09,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-23 13:51:09,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-23 13:51:09,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 13:51:09,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-23 13:51:09,330 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-07-23 13:51:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:09,330 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-23 13:51:09,330 INFO L472 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-23 13:51:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-23 13:51:09,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-23 13:51:09,331 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:09,331 INFO L357 BasicCegarLoop]: trace histogram [62, 1, 1] [2018-07-23 13:51:09,331 INFO L414 AbstractCegarLoop]: === Iteration 63 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:09,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543993, now seen corresponding path program 62 times [2018-07-23 13:51:09,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:09,561 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:09,561 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-23 13:51:09,562 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:09,562 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-23 13:51:09,562 INFO L185 omatonBuilderFactory]: Interpolants [10768#true, 10769#false, 10770#(<= main_x 0), 10771#(<= main_x 1), 10772#(<= main_x 2), 10773#(<= main_x 3), 10774#(<= main_x 4), 10775#(<= main_x 5), 10776#(<= main_x 6), 10777#(<= main_x 7), 10778#(<= main_x 8), 10779#(<= main_x 9), 10780#(<= main_x 10), 10781#(<= main_x 11), 10782#(<= main_x 12), 10783#(<= main_x 13), 10784#(<= main_x 14), 10785#(<= main_x 15), 10786#(<= main_x 16), 10787#(<= main_x 17), 10788#(<= main_x 18), 10789#(<= main_x 19), 10790#(<= main_x 20), 10791#(<= main_x 21), 10792#(<= main_x 22), 10793#(<= main_x 23), 10794#(<= main_x 24), 10795#(<= main_x 25), 10796#(<= main_x 26), 10797#(<= main_x 27), 10798#(<= main_x 28), 10799#(<= main_x 29), 10800#(<= main_x 30), 10801#(<= main_x 31), 10802#(<= main_x 32), 10803#(<= main_x 33), 10804#(<= main_x 34), 10805#(<= main_x 35), 10806#(<= main_x 36), 10807#(<= main_x 37), 10808#(<= main_x 38), 10809#(<= main_x 39), 10810#(<= main_x 40), 10811#(<= main_x 41), 10812#(<= main_x 42), 10813#(<= main_x 43), 10814#(<= main_x 44), 10815#(<= main_x 45), 10816#(<= main_x 46), 10817#(<= main_x 47), 10818#(<= main_x 48), 10819#(<= main_x 49), 10820#(<= main_x 50), 10821#(<= main_x 51), 10822#(<= main_x 52), 10823#(<= main_x 53), 10824#(<= main_x 54), 10825#(<= main_x 55), 10826#(<= main_x 56), 10827#(<= main_x 57), 10828#(<= main_x 58), 10829#(<= main_x 59), 10830#(<= main_x 60), 10831#(<= main_x 61), 10832#(<= main_x 62)] [2018-07-23 13:51:09,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:09,563 INFO L450 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-23 13:51:09,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-23 13:51:09,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 13:51:09,565 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2018-07-23 13:51:09,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:09,612 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-23 13:51:09,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-23 13:51:09,612 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2018-07-23 13:51:09,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:09,613 INFO L225 Difference]: With dead ends: 67 [2018-07-23 13:51:09,613 INFO L226 Difference]: Without dead ends: 66 [2018-07-23 13:51:09,614 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 13:51:09,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-23 13:51:09,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-07-23 13:51:09,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-23 13:51:09,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-07-23 13:51:09,617 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-07-23 13:51:09,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:09,617 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-07-23 13:51:09,617 INFO L472 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-23 13:51:09,618 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-07-23 13:51:09,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-23 13:51:09,618 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:09,618 INFO L357 BasicCegarLoop]: trace histogram [63, 1, 1] [2018-07-23 13:51:09,618 INFO L414 AbstractCegarLoop]: === Iteration 64 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:09,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223583, now seen corresponding path program 63 times [2018-07-23 13:51:09,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:09,848 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:09,848 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-23 13:51:09,849 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:09,849 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-23 13:51:09,849 INFO L185 omatonBuilderFactory]: Interpolants [11136#(<= main_x 35), 11137#(<= main_x 36), 11138#(<= main_x 37), 11139#(<= main_x 38), 11140#(<= main_x 39), 11141#(<= main_x 40), 11142#(<= main_x 41), 11143#(<= main_x 42), 11144#(<= main_x 43), 11145#(<= main_x 44), 11146#(<= main_x 45), 11147#(<= main_x 46), 11148#(<= main_x 47), 11149#(<= main_x 48), 11150#(<= main_x 49), 11151#(<= main_x 50), 11152#(<= main_x 51), 11153#(<= main_x 52), 11154#(<= main_x 53), 11155#(<= main_x 54), 11156#(<= main_x 55), 11157#(<= main_x 56), 11158#(<= main_x 57), 11159#(<= main_x 58), 11160#(<= main_x 59), 11161#(<= main_x 60), 11162#(<= main_x 61), 11163#(<= main_x 62), 11164#(<= main_x 63), 11099#true, 11100#false, 11101#(<= main_x 0), 11102#(<= main_x 1), 11103#(<= main_x 2), 11104#(<= main_x 3), 11105#(<= main_x 4), 11106#(<= main_x 5), 11107#(<= main_x 6), 11108#(<= main_x 7), 11109#(<= main_x 8), 11110#(<= main_x 9), 11111#(<= main_x 10), 11112#(<= main_x 11), 11113#(<= main_x 12), 11114#(<= main_x 13), 11115#(<= main_x 14), 11116#(<= main_x 15), 11117#(<= main_x 16), 11118#(<= main_x 17), 11119#(<= main_x 18), 11120#(<= main_x 19), 11121#(<= main_x 20), 11122#(<= main_x 21), 11123#(<= main_x 22), 11124#(<= main_x 23), 11125#(<= main_x 24), 11126#(<= main_x 25), 11127#(<= main_x 26), 11128#(<= main_x 27), 11129#(<= main_x 28), 11130#(<= main_x 29), 11131#(<= main_x 30), 11132#(<= main_x 31), 11133#(<= main_x 32), 11134#(<= main_x 33), 11135#(<= main_x 34)] [2018-07-23 13:51:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:09,850 INFO L450 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-23 13:51:09,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-23 13:51:09,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 13:51:09,852 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-07-23 13:51:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:09,880 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-07-23 13:51:09,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-23 13:51:09,881 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-07-23 13:51:09,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:09,881 INFO L225 Difference]: With dead ends: 68 [2018-07-23 13:51:09,882 INFO L226 Difference]: Without dead ends: 67 [2018-07-23 13:51:09,882 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 13:51:09,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-23 13:51:09,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-23 13:51:09,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-23 13:51:09,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-23 13:51:09,886 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-07-23 13:51:09,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:09,886 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-23 13:51:09,886 INFO L472 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-23 13:51:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-23 13:51:09,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-23 13:51:09,887 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:09,887 INFO L357 BasicCegarLoop]: trace histogram [64, 1, 1] [2018-07-23 13:51:09,887 INFO L414 AbstractCegarLoop]: === Iteration 65 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:09,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774535, now seen corresponding path program 64 times [2018-07-23 13:51:09,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:10,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:10,161 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:10,161 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-23 13:51:10,161 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:10,162 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-23 13:51:10,162 INFO L185 omatonBuilderFactory]: Interpolants [11435#true, 11436#false, 11437#(<= main_x 0), 11438#(<= main_x 1), 11439#(<= main_x 2), 11440#(<= main_x 3), 11441#(<= main_x 4), 11442#(<= main_x 5), 11443#(<= main_x 6), 11444#(<= main_x 7), 11445#(<= main_x 8), 11446#(<= main_x 9), 11447#(<= main_x 10), 11448#(<= main_x 11), 11449#(<= main_x 12), 11450#(<= main_x 13), 11451#(<= main_x 14), 11452#(<= main_x 15), 11453#(<= main_x 16), 11454#(<= main_x 17), 11455#(<= main_x 18), 11456#(<= main_x 19), 11457#(<= main_x 20), 11458#(<= main_x 21), 11459#(<= main_x 22), 11460#(<= main_x 23), 11461#(<= main_x 24), 11462#(<= main_x 25), 11463#(<= main_x 26), 11464#(<= main_x 27), 11465#(<= main_x 28), 11466#(<= main_x 29), 11467#(<= main_x 30), 11468#(<= main_x 31), 11469#(<= main_x 32), 11470#(<= main_x 33), 11471#(<= main_x 34), 11472#(<= main_x 35), 11473#(<= main_x 36), 11474#(<= main_x 37), 11475#(<= main_x 38), 11476#(<= main_x 39), 11477#(<= main_x 40), 11478#(<= main_x 41), 11479#(<= main_x 42), 11480#(<= main_x 43), 11481#(<= main_x 44), 11482#(<= main_x 45), 11483#(<= main_x 46), 11484#(<= main_x 47), 11485#(<= main_x 48), 11486#(<= main_x 49), 11487#(<= main_x 50), 11488#(<= main_x 51), 11489#(<= main_x 52), 11490#(<= main_x 53), 11491#(<= main_x 54), 11492#(<= main_x 55), 11493#(<= main_x 56), 11494#(<= main_x 57), 11495#(<= main_x 58), 11496#(<= main_x 59), 11497#(<= main_x 60), 11498#(<= main_x 61), 11499#(<= main_x 62), 11500#(<= main_x 63), 11501#(<= main_x 64)] [2018-07-23 13:51:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:10,163 INFO L450 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-23 13:51:10,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-23 13:51:10,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 13:51:10,164 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2018-07-23 13:51:10,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:10,211 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-23 13:51:10,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-23 13:51:10,211 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-07-23 13:51:10,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:10,212 INFO L225 Difference]: With dead ends: 69 [2018-07-23 13:51:10,212 INFO L226 Difference]: Without dead ends: 68 [2018-07-23 13:51:10,213 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 13:51:10,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-23 13:51:10,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-07-23 13:51:10,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-23 13:51:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-07-23 13:51:10,216 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-07-23 13:51:10,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:10,216 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-07-23 13:51:10,217 INFO L472 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-23 13:51:10,217 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-07-23 13:51:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-23 13:51:10,217 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:10,217 INFO L357 BasicCegarLoop]: trace histogram [65, 1, 1] [2018-07-23 13:51:10,218 INFO L414 AbstractCegarLoop]: === Iteration 66 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:10,218 INFO L82 PathProgramCache]: Analyzing trace with hash -892597023, now seen corresponding path program 65 times [2018-07-23 13:51:10,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:10,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:10,517 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:10,517 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-23 13:51:10,517 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:10,518 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-23 13:51:10,518 INFO L185 omatonBuilderFactory]: Interpolants [11776#true, 11777#false, 11778#(<= main_x 0), 11779#(<= main_x 1), 11780#(<= main_x 2), 11781#(<= main_x 3), 11782#(<= main_x 4), 11783#(<= main_x 5), 11784#(<= main_x 6), 11785#(<= main_x 7), 11786#(<= main_x 8), 11787#(<= main_x 9), 11788#(<= main_x 10), 11789#(<= main_x 11), 11790#(<= main_x 12), 11791#(<= main_x 13), 11792#(<= main_x 14), 11793#(<= main_x 15), 11794#(<= main_x 16), 11795#(<= main_x 17), 11796#(<= main_x 18), 11797#(<= main_x 19), 11798#(<= main_x 20), 11799#(<= main_x 21), 11800#(<= main_x 22), 11801#(<= main_x 23), 11802#(<= main_x 24), 11803#(<= main_x 25), 11804#(<= main_x 26), 11805#(<= main_x 27), 11806#(<= main_x 28), 11807#(<= main_x 29), 11808#(<= main_x 30), 11809#(<= main_x 31), 11810#(<= main_x 32), 11811#(<= main_x 33), 11812#(<= main_x 34), 11813#(<= main_x 35), 11814#(<= main_x 36), 11815#(<= main_x 37), 11816#(<= main_x 38), 11817#(<= main_x 39), 11818#(<= main_x 40), 11819#(<= main_x 41), 11820#(<= main_x 42), 11821#(<= main_x 43), 11822#(<= main_x 44), 11823#(<= main_x 45), 11824#(<= main_x 46), 11825#(<= main_x 47), 11826#(<= main_x 48), 11827#(<= main_x 49), 11828#(<= main_x 50), 11829#(<= main_x 51), 11830#(<= main_x 52), 11831#(<= main_x 53), 11832#(<= main_x 54), 11833#(<= main_x 55), 11834#(<= main_x 56), 11835#(<= main_x 57), 11836#(<= main_x 58), 11837#(<= main_x 59), 11838#(<= main_x 60), 11839#(<= main_x 61), 11840#(<= main_x 62), 11841#(<= main_x 63), 11842#(<= main_x 64), 11843#(<= main_x 65)] [2018-07-23 13:51:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:10,519 INFO L450 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-23 13:51:10,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-23 13:51:10,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 13:51:10,539 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-07-23 13:51:10,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:10,587 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-07-23 13:51:10,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-23 13:51:10,587 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-07-23 13:51:10,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:10,588 INFO L225 Difference]: With dead ends: 70 [2018-07-23 13:51:10,588 INFO L226 Difference]: Without dead ends: 69 [2018-07-23 13:51:10,588 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 13:51:10,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-23 13:51:10,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-23 13:51:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-23 13:51:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-23 13:51:10,591 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-07-23 13:51:10,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:10,592 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-23 13:51:10,592 INFO L472 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-23 13:51:10,592 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-23 13:51:10,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-23 13:51:10,592 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:10,593 INFO L357 BasicCegarLoop]: trace histogram [66, 1, 1] [2018-07-23 13:51:10,593 INFO L414 AbstractCegarLoop]: === Iteration 67 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:10,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703993, now seen corresponding path program 66 times [2018-07-23 13:51:10,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:10,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:10,812 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:10,812 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-23 13:51:10,812 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:10,812 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-23 13:51:10,813 INFO L185 omatonBuilderFactory]: Interpolants [12160#(<= main_x 36), 12161#(<= main_x 37), 12162#(<= main_x 38), 12163#(<= main_x 39), 12164#(<= main_x 40), 12165#(<= main_x 41), 12166#(<= main_x 42), 12167#(<= main_x 43), 12168#(<= main_x 44), 12169#(<= main_x 45), 12170#(<= main_x 46), 12171#(<= main_x 47), 12172#(<= main_x 48), 12173#(<= main_x 49), 12174#(<= main_x 50), 12175#(<= main_x 51), 12176#(<= main_x 52), 12177#(<= main_x 53), 12178#(<= main_x 54), 12179#(<= main_x 55), 12180#(<= main_x 56), 12181#(<= main_x 57), 12182#(<= main_x 58), 12183#(<= main_x 59), 12184#(<= main_x 60), 12185#(<= main_x 61), 12186#(<= main_x 62), 12187#(<= main_x 63), 12188#(<= main_x 64), 12189#(<= main_x 65), 12190#(<= main_x 66), 12122#true, 12123#false, 12124#(<= main_x 0), 12125#(<= main_x 1), 12126#(<= main_x 2), 12127#(<= main_x 3), 12128#(<= main_x 4), 12129#(<= main_x 5), 12130#(<= main_x 6), 12131#(<= main_x 7), 12132#(<= main_x 8), 12133#(<= main_x 9), 12134#(<= main_x 10), 12135#(<= main_x 11), 12136#(<= main_x 12), 12137#(<= main_x 13), 12138#(<= main_x 14), 12139#(<= main_x 15), 12140#(<= main_x 16), 12141#(<= main_x 17), 12142#(<= main_x 18), 12143#(<= main_x 19), 12144#(<= main_x 20), 12145#(<= main_x 21), 12146#(<= main_x 22), 12147#(<= main_x 23), 12148#(<= main_x 24), 12149#(<= main_x 25), 12150#(<= main_x 26), 12151#(<= main_x 27), 12152#(<= main_x 28), 12153#(<= main_x 29), 12154#(<= main_x 30), 12155#(<= main_x 31), 12156#(<= main_x 32), 12157#(<= main_x 33), 12158#(<= main_x 34), 12159#(<= main_x 35)] [2018-07-23 13:51:10,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:10,813 INFO L450 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-23 13:51:10,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-23 13:51:10,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 13:51:10,815 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2018-07-23 13:51:10,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:10,847 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-23 13:51:10,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-23 13:51:10,847 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2018-07-23 13:51:10,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:10,848 INFO L225 Difference]: With dead ends: 71 [2018-07-23 13:51:10,848 INFO L226 Difference]: Without dead ends: 70 [2018-07-23 13:51:10,849 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 13:51:10,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-23 13:51:10,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-23 13:51:10,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-23 13:51:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-07-23 13:51:10,852 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-07-23 13:51:10,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:10,852 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-07-23 13:51:10,852 INFO L472 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-23 13:51:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-07-23 13:51:10,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-23 13:51:10,853 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:10,853 INFO L357 BasicCegarLoop]: trace histogram [67, 1, 1] [2018-07-23 13:51:10,853 INFO L414 AbstractCegarLoop]: === Iteration 68 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:10,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718305, now seen corresponding path program 67 times [2018-07-23 13:51:10,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:11,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:11,093 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:11,093 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-23 13:51:11,093 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:11,093 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-23 13:51:11,094 INFO L185 omatonBuilderFactory]: Interpolants [12473#true, 12474#false, 12475#(<= main_x 0), 12476#(<= main_x 1), 12477#(<= main_x 2), 12478#(<= main_x 3), 12479#(<= main_x 4), 12480#(<= main_x 5), 12481#(<= main_x 6), 12482#(<= main_x 7), 12483#(<= main_x 8), 12484#(<= main_x 9), 12485#(<= main_x 10), 12486#(<= main_x 11), 12487#(<= main_x 12), 12488#(<= main_x 13), 12489#(<= main_x 14), 12490#(<= main_x 15), 12491#(<= main_x 16), 12492#(<= main_x 17), 12493#(<= main_x 18), 12494#(<= main_x 19), 12495#(<= main_x 20), 12496#(<= main_x 21), 12497#(<= main_x 22), 12498#(<= main_x 23), 12499#(<= main_x 24), 12500#(<= main_x 25), 12501#(<= main_x 26), 12502#(<= main_x 27), 12503#(<= main_x 28), 12504#(<= main_x 29), 12505#(<= main_x 30), 12506#(<= main_x 31), 12507#(<= main_x 32), 12508#(<= main_x 33), 12509#(<= main_x 34), 12510#(<= main_x 35), 12511#(<= main_x 36), 12512#(<= main_x 37), 12513#(<= main_x 38), 12514#(<= main_x 39), 12515#(<= main_x 40), 12516#(<= main_x 41), 12517#(<= main_x 42), 12518#(<= main_x 43), 12519#(<= main_x 44), 12520#(<= main_x 45), 12521#(<= main_x 46), 12522#(<= main_x 47), 12523#(<= main_x 48), 12524#(<= main_x 49), 12525#(<= main_x 50), 12526#(<= main_x 51), 12527#(<= main_x 52), 12528#(<= main_x 53), 12529#(<= main_x 54), 12530#(<= main_x 55), 12531#(<= main_x 56), 12532#(<= main_x 57), 12533#(<= main_x 58), 12534#(<= main_x 59), 12535#(<= main_x 60), 12536#(<= main_x 61), 12537#(<= main_x 62), 12538#(<= main_x 63), 12539#(<= main_x 64), 12540#(<= main_x 65), 12541#(<= main_x 66), 12542#(<= main_x 67)] [2018-07-23 13:51:11,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:11,094 INFO L450 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-23 13:51:11,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-23 13:51:11,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 13:51:11,096 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-07-23 13:51:11,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:11,150 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-07-23 13:51:11,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-23 13:51:11,151 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-07-23 13:51:11,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:11,152 INFO L225 Difference]: With dead ends: 72 [2018-07-23 13:51:11,152 INFO L226 Difference]: Without dead ends: 71 [2018-07-23 13:51:11,153 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 13:51:11,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-23 13:51:11,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-23 13:51:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-23 13:51:11,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-23 13:51:11,156 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-07-23 13:51:11,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:11,156 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-23 13:51:11,156 INFO L472 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-23 13:51:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-23 13:51:11,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-23 13:51:11,157 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:11,157 INFO L357 BasicCegarLoop]: trace histogram [68, 1, 1] [2018-07-23 13:51:11,157 INFO L414 AbstractCegarLoop]: === Iteration 69 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:11,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438265, now seen corresponding path program 68 times [2018-07-23 13:51:11,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:11,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:11,399 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:11,399 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-23 13:51:11,399 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:11,399 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-23 13:51:11,400 INFO L185 omatonBuilderFactory]: Interpolants [12829#true, 12830#false, 12831#(<= main_x 0), 12832#(<= main_x 1), 12833#(<= main_x 2), 12834#(<= main_x 3), 12835#(<= main_x 4), 12836#(<= main_x 5), 12837#(<= main_x 6), 12838#(<= main_x 7), 12839#(<= main_x 8), 12840#(<= main_x 9), 12841#(<= main_x 10), 12842#(<= main_x 11), 12843#(<= main_x 12), 12844#(<= main_x 13), 12845#(<= main_x 14), 12846#(<= main_x 15), 12847#(<= main_x 16), 12848#(<= main_x 17), 12849#(<= main_x 18), 12850#(<= main_x 19), 12851#(<= main_x 20), 12852#(<= main_x 21), 12853#(<= main_x 22), 12854#(<= main_x 23), 12855#(<= main_x 24), 12856#(<= main_x 25), 12857#(<= main_x 26), 12858#(<= main_x 27), 12859#(<= main_x 28), 12860#(<= main_x 29), 12861#(<= main_x 30), 12862#(<= main_x 31), 12863#(<= main_x 32), 12864#(<= main_x 33), 12865#(<= main_x 34), 12866#(<= main_x 35), 12867#(<= main_x 36), 12868#(<= main_x 37), 12869#(<= main_x 38), 12870#(<= main_x 39), 12871#(<= main_x 40), 12872#(<= main_x 41), 12873#(<= main_x 42), 12874#(<= main_x 43), 12875#(<= main_x 44), 12876#(<= main_x 45), 12877#(<= main_x 46), 12878#(<= main_x 47), 12879#(<= main_x 48), 12880#(<= main_x 49), 12881#(<= main_x 50), 12882#(<= main_x 51), 12883#(<= main_x 52), 12884#(<= main_x 53), 12885#(<= main_x 54), 12886#(<= main_x 55), 12887#(<= main_x 56), 12888#(<= main_x 57), 12889#(<= main_x 58), 12890#(<= main_x 59), 12891#(<= main_x 60), 12892#(<= main_x 61), 12893#(<= main_x 62), 12894#(<= main_x 63), 12895#(<= main_x 64), 12896#(<= main_x 65), 12897#(<= main_x 66), 12898#(<= main_x 67), 12899#(<= main_x 68)] [2018-07-23 13:51:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:11,400 INFO L450 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-23 13:51:11,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-23 13:51:11,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 13:51:11,402 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2018-07-23 13:51:11,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:11,450 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-23 13:51:11,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-23 13:51:11,450 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2018-07-23 13:51:11,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:11,451 INFO L225 Difference]: With dead ends: 73 [2018-07-23 13:51:11,451 INFO L226 Difference]: Without dead ends: 72 [2018-07-23 13:51:11,451 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 13:51:11,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-23 13:51:11,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-23 13:51:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-23 13:51:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-07-23 13:51:11,454 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-07-23 13:51:11,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:11,455 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-07-23 13:51:11,455 INFO L472 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-23 13:51:11,455 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-07-23 13:51:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-23 13:51:11,455 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:11,456 INFO L357 BasicCegarLoop]: trace histogram [69, 1, 1] [2018-07-23 13:51:11,456 INFO L414 AbstractCegarLoop]: === Iteration 70 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:11,456 INFO L82 PathProgramCache]: Analyzing trace with hash 976119393, now seen corresponding path program 69 times [2018-07-23 13:51:11,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:11,679 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:11,680 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-23 13:51:11,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:11,680 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-23 13:51:11,680 INFO L185 omatonBuilderFactory]: Interpolants [13190#true, 13191#false, 13192#(<= main_x 0), 13193#(<= main_x 1), 13194#(<= main_x 2), 13195#(<= main_x 3), 13196#(<= main_x 4), 13197#(<= main_x 5), 13198#(<= main_x 6), 13199#(<= main_x 7), 13200#(<= main_x 8), 13201#(<= main_x 9), 13202#(<= main_x 10), 13203#(<= main_x 11), 13204#(<= main_x 12), 13205#(<= main_x 13), 13206#(<= main_x 14), 13207#(<= main_x 15), 13208#(<= main_x 16), 13209#(<= main_x 17), 13210#(<= main_x 18), 13211#(<= main_x 19), 13212#(<= main_x 20), 13213#(<= main_x 21), 13214#(<= main_x 22), 13215#(<= main_x 23), 13216#(<= main_x 24), 13217#(<= main_x 25), 13218#(<= main_x 26), 13219#(<= main_x 27), 13220#(<= main_x 28), 13221#(<= main_x 29), 13222#(<= main_x 30), 13223#(<= main_x 31), 13224#(<= main_x 32), 13225#(<= main_x 33), 13226#(<= main_x 34), 13227#(<= main_x 35), 13228#(<= main_x 36), 13229#(<= main_x 37), 13230#(<= main_x 38), 13231#(<= main_x 39), 13232#(<= main_x 40), 13233#(<= main_x 41), 13234#(<= main_x 42), 13235#(<= main_x 43), 13236#(<= main_x 44), 13237#(<= main_x 45), 13238#(<= main_x 46), 13239#(<= main_x 47), 13240#(<= main_x 48), 13241#(<= main_x 49), 13242#(<= main_x 50), 13243#(<= main_x 51), 13244#(<= main_x 52), 13245#(<= main_x 53), 13246#(<= main_x 54), 13247#(<= main_x 55), 13248#(<= main_x 56), 13249#(<= main_x 57), 13250#(<= main_x 58), 13251#(<= main_x 59), 13252#(<= main_x 60), 13253#(<= main_x 61), 13254#(<= main_x 62), 13255#(<= main_x 63), 13256#(<= main_x 64), 13257#(<= main_x 65), 13258#(<= main_x 66), 13259#(<= main_x 67), 13260#(<= main_x 68), 13261#(<= main_x 69)] [2018-07-23 13:51:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:11,681 INFO L450 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-23 13:51:11,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-23 13:51:11,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 13:51:11,683 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-07-23 13:51:11,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:11,738 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-07-23 13:51:11,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-23 13:51:11,739 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-07-23 13:51:11,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:11,739 INFO L225 Difference]: With dead ends: 74 [2018-07-23 13:51:11,739 INFO L226 Difference]: Without dead ends: 73 [2018-07-23 13:51:11,740 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 13:51:11,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-23 13:51:11,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-23 13:51:11,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-23 13:51:11,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-23 13:51:11,743 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-07-23 13:51:11,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:11,744 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-23 13:51:11,744 INFO L472 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-23 13:51:11,744 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-23 13:51:11,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-23 13:51:11,745 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:11,745 INFO L357 BasicCegarLoop]: trace histogram [70, 1, 1] [2018-07-23 13:51:11,745 INFO L414 AbstractCegarLoop]: === Iteration 71 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:11,745 INFO L82 PathProgramCache]: Analyzing trace with hash 194930055, now seen corresponding path program 70 times [2018-07-23 13:51:11,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:11,970 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:11,970 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-23 13:51:11,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:11,971 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-23 13:51:11,971 INFO L185 omatonBuilderFactory]: Interpolants [13568#(<= main_x 10), 13569#(<= main_x 11), 13570#(<= main_x 12), 13571#(<= main_x 13), 13572#(<= main_x 14), 13573#(<= main_x 15), 13574#(<= main_x 16), 13575#(<= main_x 17), 13576#(<= main_x 18), 13577#(<= main_x 19), 13578#(<= main_x 20), 13579#(<= main_x 21), 13580#(<= main_x 22), 13581#(<= main_x 23), 13582#(<= main_x 24), 13583#(<= main_x 25), 13584#(<= main_x 26), 13585#(<= main_x 27), 13586#(<= main_x 28), 13587#(<= main_x 29), 13588#(<= main_x 30), 13589#(<= main_x 31), 13590#(<= main_x 32), 13591#(<= main_x 33), 13592#(<= main_x 34), 13593#(<= main_x 35), 13594#(<= main_x 36), 13595#(<= main_x 37), 13596#(<= main_x 38), 13597#(<= main_x 39), 13598#(<= main_x 40), 13599#(<= main_x 41), 13600#(<= main_x 42), 13601#(<= main_x 43), 13602#(<= main_x 44), 13603#(<= main_x 45), 13604#(<= main_x 46), 13605#(<= main_x 47), 13606#(<= main_x 48), 13607#(<= main_x 49), 13608#(<= main_x 50), 13609#(<= main_x 51), 13610#(<= main_x 52), 13611#(<= main_x 53), 13612#(<= main_x 54), 13613#(<= main_x 55), 13614#(<= main_x 56), 13615#(<= main_x 57), 13616#(<= main_x 58), 13617#(<= main_x 59), 13618#(<= main_x 60), 13619#(<= main_x 61), 13620#(<= main_x 62), 13621#(<= main_x 63), 13622#(<= main_x 64), 13623#(<= main_x 65), 13624#(<= main_x 66), 13625#(<= main_x 67), 13626#(<= main_x 68), 13627#(<= main_x 69), 13628#(<= main_x 70), 13556#true, 13557#false, 13558#(<= main_x 0), 13559#(<= main_x 1), 13560#(<= main_x 2), 13561#(<= main_x 3), 13562#(<= main_x 4), 13563#(<= main_x 5), 13564#(<= main_x 6), 13565#(<= main_x 7), 13566#(<= main_x 8), 13567#(<= main_x 9)] [2018-07-23 13:51:11,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:11,972 INFO L450 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-23 13:51:11,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-23 13:51:11,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 13:51:11,973 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2018-07-23 13:51:12,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:12,026 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-23 13:51:12,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-23 13:51:12,027 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2018-07-23 13:51:12,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:12,027 INFO L225 Difference]: With dead ends: 75 [2018-07-23 13:51:12,028 INFO L226 Difference]: Without dead ends: 74 [2018-07-23 13:51:12,028 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 13:51:12,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-23 13:51:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-23 13:51:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-23 13:51:12,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-07-23 13:51:12,031 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-07-23 13:51:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:12,032 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-07-23 13:51:12,032 INFO L472 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-23 13:51:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-07-23 13:51:12,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-23 13:51:12,033 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:12,033 INFO L357 BasicCegarLoop]: trace histogram [71, 1, 1] [2018-07-23 13:51:12,033 INFO L414 AbstractCegarLoop]: === Iteration 72 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:12,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864353, now seen corresponding path program 71 times [2018-07-23 13:51:12,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:12,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:12,270 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:12,270 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-23 13:51:12,270 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:12,271 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-23 13:51:12,271 INFO L185 omatonBuilderFactory]: Interpolants [13952#(<= main_x 23), 13953#(<= main_x 24), 13954#(<= main_x 25), 13955#(<= main_x 26), 13956#(<= main_x 27), 13957#(<= main_x 28), 13958#(<= main_x 29), 13959#(<= main_x 30), 13960#(<= main_x 31), 13961#(<= main_x 32), 13962#(<= main_x 33), 13963#(<= main_x 34), 13964#(<= main_x 35), 13965#(<= main_x 36), 13966#(<= main_x 37), 13967#(<= main_x 38), 13968#(<= main_x 39), 13969#(<= main_x 40), 13970#(<= main_x 41), 13971#(<= main_x 42), 13972#(<= main_x 43), 13973#(<= main_x 44), 13974#(<= main_x 45), 13975#(<= main_x 46), 13976#(<= main_x 47), 13977#(<= main_x 48), 13978#(<= main_x 49), 13979#(<= main_x 50), 13980#(<= main_x 51), 13981#(<= main_x 52), 13982#(<= main_x 53), 13983#(<= main_x 54), 13984#(<= main_x 55), 13985#(<= main_x 56), 13986#(<= main_x 57), 13987#(<= main_x 58), 13988#(<= main_x 59), 13989#(<= main_x 60), 13990#(<= main_x 61), 13991#(<= main_x 62), 13992#(<= main_x 63), 13993#(<= main_x 64), 13994#(<= main_x 65), 13995#(<= main_x 66), 13996#(<= main_x 67), 13997#(<= main_x 68), 13998#(<= main_x 69), 13999#(<= main_x 70), 14000#(<= main_x 71), 13927#true, 13928#false, 13929#(<= main_x 0), 13930#(<= main_x 1), 13931#(<= main_x 2), 13932#(<= main_x 3), 13933#(<= main_x 4), 13934#(<= main_x 5), 13935#(<= main_x 6), 13936#(<= main_x 7), 13937#(<= main_x 8), 13938#(<= main_x 9), 13939#(<= main_x 10), 13940#(<= main_x 11), 13941#(<= main_x 12), 13942#(<= main_x 13), 13943#(<= main_x 14), 13944#(<= main_x 15), 13945#(<= main_x 16), 13946#(<= main_x 17), 13947#(<= main_x 18), 13948#(<= main_x 19), 13949#(<= main_x 20), 13950#(<= main_x 21), 13951#(<= main_x 22)] [2018-07-23 13:51:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:12,272 INFO L450 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-23 13:51:12,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-23 13:51:12,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 13:51:12,273 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-07-23 13:51:12,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:12,315 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-07-23 13:51:12,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-23 13:51:12,316 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-07-23 13:51:12,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:12,317 INFO L225 Difference]: With dead ends: 76 [2018-07-23 13:51:12,317 INFO L226 Difference]: Without dead ends: 75 [2018-07-23 13:51:12,318 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 13:51:12,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-23 13:51:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-23 13:51:12,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-23 13:51:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-23 13:51:12,321 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-07-23 13:51:12,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:12,321 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-23 13:51:12,321 INFO L472 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-23 13:51:12,321 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-23 13:51:12,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-23 13:51:12,322 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:12,322 INFO L357 BasicCegarLoop]: trace histogram [72, 1, 1] [2018-07-23 13:51:12,322 INFO L414 AbstractCegarLoop]: === Iteration 73 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:12,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779961, now seen corresponding path program 72 times [2018-07-23 13:51:12,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:12,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:12,564 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:12,564 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-23 13:51:12,564 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:12,564 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-23 13:51:12,565 INFO L185 omatonBuilderFactory]: Interpolants [14336#(<= main_x 31), 14337#(<= main_x 32), 14338#(<= main_x 33), 14339#(<= main_x 34), 14340#(<= main_x 35), 14341#(<= main_x 36), 14342#(<= main_x 37), 14343#(<= main_x 38), 14344#(<= main_x 39), 14345#(<= main_x 40), 14346#(<= main_x 41), 14347#(<= main_x 42), 14348#(<= main_x 43), 14349#(<= main_x 44), 14350#(<= main_x 45), 14351#(<= main_x 46), 14352#(<= main_x 47), 14353#(<= main_x 48), 14354#(<= main_x 49), 14355#(<= main_x 50), 14356#(<= main_x 51), 14357#(<= main_x 52), 14358#(<= main_x 53), 14359#(<= main_x 54), 14360#(<= main_x 55), 14361#(<= main_x 56), 14362#(<= main_x 57), 14363#(<= main_x 58), 14364#(<= main_x 59), 14365#(<= main_x 60), 14366#(<= main_x 61), 14367#(<= main_x 62), 14368#(<= main_x 63), 14369#(<= main_x 64), 14370#(<= main_x 65), 14371#(<= main_x 66), 14372#(<= main_x 67), 14373#(<= main_x 68), 14374#(<= main_x 69), 14375#(<= main_x 70), 14376#(<= main_x 71), 14377#(<= main_x 72), 14303#true, 14304#false, 14305#(<= main_x 0), 14306#(<= main_x 1), 14307#(<= main_x 2), 14308#(<= main_x 3), 14309#(<= main_x 4), 14310#(<= main_x 5), 14311#(<= main_x 6), 14312#(<= main_x 7), 14313#(<= main_x 8), 14314#(<= main_x 9), 14315#(<= main_x 10), 14316#(<= main_x 11), 14317#(<= main_x 12), 14318#(<= main_x 13), 14319#(<= main_x 14), 14320#(<= main_x 15), 14321#(<= main_x 16), 14322#(<= main_x 17), 14323#(<= main_x 18), 14324#(<= main_x 19), 14325#(<= main_x 20), 14326#(<= main_x 21), 14327#(<= main_x 22), 14328#(<= main_x 23), 14329#(<= main_x 24), 14330#(<= main_x 25), 14331#(<= main_x 26), 14332#(<= main_x 27), 14333#(<= main_x 28), 14334#(<= main_x 29), 14335#(<= main_x 30)] [2018-07-23 13:51:12,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:12,565 INFO L450 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-23 13:51:12,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-23 13:51:12,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 13:51:12,567 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2018-07-23 13:51:12,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:12,605 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-23 13:51:12,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-23 13:51:12,606 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2018-07-23 13:51:12,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:12,606 INFO L225 Difference]: With dead ends: 77 [2018-07-23 13:51:12,606 INFO L226 Difference]: Without dead ends: 76 [2018-07-23 13:51:12,607 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 13:51:12,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-23 13:51:12,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-23 13:51:12,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-23 13:51:12,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-07-23 13:51:12,610 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-07-23 13:51:12,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:12,611 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-07-23 13:51:12,611 INFO L472 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-23 13:51:12,611 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-07-23 13:51:12,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-23 13:51:12,612 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:12,612 INFO L357 BasicCegarLoop]: trace histogram [73, 1, 1] [2018-07-23 13:51:12,612 INFO L414 AbstractCegarLoop]: === Iteration 74 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:12,612 INFO L82 PathProgramCache]: Analyzing trace with hash 365428705, now seen corresponding path program 73 times [2018-07-23 13:51:12,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:12,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:12,876 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:12,876 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-23 13:51:12,876 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:12,876 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-23 13:51:12,877 INFO L185 omatonBuilderFactory]: Interpolants [14720#(<= main_x 34), 14721#(<= main_x 35), 14722#(<= main_x 36), 14723#(<= main_x 37), 14724#(<= main_x 38), 14725#(<= main_x 39), 14726#(<= main_x 40), 14727#(<= main_x 41), 14728#(<= main_x 42), 14729#(<= main_x 43), 14730#(<= main_x 44), 14731#(<= main_x 45), 14732#(<= main_x 46), 14733#(<= main_x 47), 14734#(<= main_x 48), 14735#(<= main_x 49), 14736#(<= main_x 50), 14737#(<= main_x 51), 14738#(<= main_x 52), 14739#(<= main_x 53), 14740#(<= main_x 54), 14741#(<= main_x 55), 14742#(<= main_x 56), 14743#(<= main_x 57), 14744#(<= main_x 58), 14745#(<= main_x 59), 14746#(<= main_x 60), 14747#(<= main_x 61), 14748#(<= main_x 62), 14749#(<= main_x 63), 14750#(<= main_x 64), 14751#(<= main_x 65), 14752#(<= main_x 66), 14753#(<= main_x 67), 14754#(<= main_x 68), 14755#(<= main_x 69), 14756#(<= main_x 70), 14757#(<= main_x 71), 14758#(<= main_x 72), 14759#(<= main_x 73), 14684#true, 14685#false, 14686#(<= main_x 0), 14687#(<= main_x 1), 14688#(<= main_x 2), 14689#(<= main_x 3), 14690#(<= main_x 4), 14691#(<= main_x 5), 14692#(<= main_x 6), 14693#(<= main_x 7), 14694#(<= main_x 8), 14695#(<= main_x 9), 14696#(<= main_x 10), 14697#(<= main_x 11), 14698#(<= main_x 12), 14699#(<= main_x 13), 14700#(<= main_x 14), 14701#(<= main_x 15), 14702#(<= main_x 16), 14703#(<= main_x 17), 14704#(<= main_x 18), 14705#(<= main_x 19), 14706#(<= main_x 20), 14707#(<= main_x 21), 14708#(<= main_x 22), 14709#(<= main_x 23), 14710#(<= main_x 24), 14711#(<= main_x 25), 14712#(<= main_x 26), 14713#(<= main_x 27), 14714#(<= main_x 28), 14715#(<= main_x 29), 14716#(<= main_x 30), 14717#(<= main_x 31), 14718#(<= main_x 32), 14719#(<= main_x 33)] [2018-07-23 13:51:12,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:12,877 INFO L450 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-23 13:51:12,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-23 13:51:12,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 13:51:12,879 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-07-23 13:51:12,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:12,914 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-23 13:51:12,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-23 13:51:12,914 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-07-23 13:51:12,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:12,915 INFO L225 Difference]: With dead ends: 78 [2018-07-23 13:51:12,915 INFO L226 Difference]: Without dead ends: 77 [2018-07-23 13:51:12,916 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 13:51:12,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-23 13:51:12,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-23 13:51:12,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-23 13:51:12,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-23 13:51:12,919 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-07-23 13:51:12,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:12,919 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-23 13:51:12,920 INFO L472 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-23 13:51:12,920 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-23 13:51:12,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-23 13:51:12,920 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:12,920 INFO L357 BasicCegarLoop]: trace histogram [74, 1, 1] [2018-07-23 13:51:12,921 INFO L414 AbstractCegarLoop]: === Iteration 75 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:12,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612089, now seen corresponding path program 74 times [2018-07-23 13:51:12,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:13,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:13,151 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:13,151 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-23 13:51:13,151 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:13,151 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-23 13:51:13,152 INFO L185 omatonBuilderFactory]: Interpolants [15104#(<= main_x 32), 15105#(<= main_x 33), 15106#(<= main_x 34), 15107#(<= main_x 35), 15108#(<= main_x 36), 15109#(<= main_x 37), 15110#(<= main_x 38), 15111#(<= main_x 39), 15112#(<= main_x 40), 15113#(<= main_x 41), 15114#(<= main_x 42), 15115#(<= main_x 43), 15116#(<= main_x 44), 15117#(<= main_x 45), 15118#(<= main_x 46), 15119#(<= main_x 47), 15120#(<= main_x 48), 15121#(<= main_x 49), 15122#(<= main_x 50), 15123#(<= main_x 51), 15124#(<= main_x 52), 15125#(<= main_x 53), 15126#(<= main_x 54), 15127#(<= main_x 55), 15128#(<= main_x 56), 15129#(<= main_x 57), 15130#(<= main_x 58), 15131#(<= main_x 59), 15132#(<= main_x 60), 15133#(<= main_x 61), 15134#(<= main_x 62), 15135#(<= main_x 63), 15136#(<= main_x 64), 15137#(<= main_x 65), 15138#(<= main_x 66), 15139#(<= main_x 67), 15140#(<= main_x 68), 15141#(<= main_x 69), 15142#(<= main_x 70), 15143#(<= main_x 71), 15144#(<= main_x 72), 15145#(<= main_x 73), 15146#(<= main_x 74), 15070#true, 15071#false, 15072#(<= main_x 0), 15073#(<= main_x 1), 15074#(<= main_x 2), 15075#(<= main_x 3), 15076#(<= main_x 4), 15077#(<= main_x 5), 15078#(<= main_x 6), 15079#(<= main_x 7), 15080#(<= main_x 8), 15081#(<= main_x 9), 15082#(<= main_x 10), 15083#(<= main_x 11), 15084#(<= main_x 12), 15085#(<= main_x 13), 15086#(<= main_x 14), 15087#(<= main_x 15), 15088#(<= main_x 16), 15089#(<= main_x 17), 15090#(<= main_x 18), 15091#(<= main_x 19), 15092#(<= main_x 20), 15093#(<= main_x 21), 15094#(<= main_x 22), 15095#(<= main_x 23), 15096#(<= main_x 24), 15097#(<= main_x 25), 15098#(<= main_x 26), 15099#(<= main_x 27), 15100#(<= main_x 28), 15101#(<= main_x 29), 15102#(<= main_x 30), 15103#(<= main_x 31)] [2018-07-23 13:51:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:13,152 INFO L450 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-23 13:51:13,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-23 13:51:13,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 13:51:13,154 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2018-07-23 13:51:13,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:13,192 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-23 13:51:13,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-23 13:51:13,192 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2018-07-23 13:51:13,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:13,193 INFO L225 Difference]: With dead ends: 79 [2018-07-23 13:51:13,193 INFO L226 Difference]: Without dead ends: 78 [2018-07-23 13:51:13,194 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 13:51:13,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-23 13:51:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-23 13:51:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-23 13:51:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-07-23 13:51:13,197 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-07-23 13:51:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:13,197 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-07-23 13:51:13,197 INFO L472 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-23 13:51:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-07-23 13:51:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-07-23 13:51:13,198 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:13,198 INFO L357 BasicCegarLoop]: trace histogram [75, 1, 1] [2018-07-23 13:51:13,198 INFO L414 AbstractCegarLoop]: === Iteration 76 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:13,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334559, now seen corresponding path program 75 times [2018-07-23 13:51:13,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:13,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:13,433 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:13,433 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-23 13:51:13,434 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:13,434 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-23 13:51:13,434 INFO L185 omatonBuilderFactory]: Interpolants [15488#(<= main_x 25), 15489#(<= main_x 26), 15490#(<= main_x 27), 15491#(<= main_x 28), 15492#(<= main_x 29), 15493#(<= main_x 30), 15494#(<= main_x 31), 15495#(<= main_x 32), 15496#(<= main_x 33), 15497#(<= main_x 34), 15498#(<= main_x 35), 15499#(<= main_x 36), 15500#(<= main_x 37), 15501#(<= main_x 38), 15502#(<= main_x 39), 15503#(<= main_x 40), 15504#(<= main_x 41), 15505#(<= main_x 42), 15506#(<= main_x 43), 15507#(<= main_x 44), 15508#(<= main_x 45), 15509#(<= main_x 46), 15510#(<= main_x 47), 15511#(<= main_x 48), 15512#(<= main_x 49), 15513#(<= main_x 50), 15514#(<= main_x 51), 15515#(<= main_x 52), 15516#(<= main_x 53), 15517#(<= main_x 54), 15518#(<= main_x 55), 15519#(<= main_x 56), 15520#(<= main_x 57), 15521#(<= main_x 58), 15522#(<= main_x 59), 15523#(<= main_x 60), 15524#(<= main_x 61), 15525#(<= main_x 62), 15526#(<= main_x 63), 15527#(<= main_x 64), 15528#(<= main_x 65), 15529#(<= main_x 66), 15530#(<= main_x 67), 15531#(<= main_x 68), 15532#(<= main_x 69), 15533#(<= main_x 70), 15534#(<= main_x 71), 15535#(<= main_x 72), 15536#(<= main_x 73), 15537#(<= main_x 74), 15538#(<= main_x 75), 15461#true, 15462#false, 15463#(<= main_x 0), 15464#(<= main_x 1), 15465#(<= main_x 2), 15466#(<= main_x 3), 15467#(<= main_x 4), 15468#(<= main_x 5), 15469#(<= main_x 6), 15470#(<= main_x 7), 15471#(<= main_x 8), 15472#(<= main_x 9), 15473#(<= main_x 10), 15474#(<= main_x 11), 15475#(<= main_x 12), 15476#(<= main_x 13), 15477#(<= main_x 14), 15478#(<= main_x 15), 15479#(<= main_x 16), 15480#(<= main_x 17), 15481#(<= main_x 18), 15482#(<= main_x 19), 15483#(<= main_x 20), 15484#(<= main_x 21), 15485#(<= main_x 22), 15486#(<= main_x 23), 15487#(<= main_x 24)] [2018-07-23 13:51:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:13,435 INFO L450 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-23 13:51:13,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-23 13:51:13,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 13:51:13,436 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-07-23 13:51:13,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:13,478 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-07-23 13:51:13,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-23 13:51:13,479 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-07-23 13:51:13,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:13,479 INFO L225 Difference]: With dead ends: 80 [2018-07-23 13:51:13,480 INFO L226 Difference]: Without dead ends: 79 [2018-07-23 13:51:13,480 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 13:51:13,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-23 13:51:13,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-23 13:51:13,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-23 13:51:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-23 13:51:13,484 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-07-23 13:51:13,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:13,484 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-23 13:51:13,484 INFO L472 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-23 13:51:13,484 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-23 13:51:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-23 13:51:13,485 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:13,485 INFO L357 BasicCegarLoop]: trace histogram [76, 1, 1] [2018-07-23 13:51:13,485 INFO L414 AbstractCegarLoop]: === Iteration 77 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:13,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600313, now seen corresponding path program 76 times [2018-07-23 13:51:13,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:13,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:13,731 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:13,732 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-23 13:51:13,732 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:13,732 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-23 13:51:13,732 INFO L185 omatonBuilderFactory]: Interpolants [15872#(<= main_x 13), 15873#(<= main_x 14), 15874#(<= main_x 15), 15875#(<= main_x 16), 15876#(<= main_x 17), 15877#(<= main_x 18), 15878#(<= main_x 19), 15879#(<= main_x 20), 15880#(<= main_x 21), 15881#(<= main_x 22), 15882#(<= main_x 23), 15883#(<= main_x 24), 15884#(<= main_x 25), 15885#(<= main_x 26), 15886#(<= main_x 27), 15887#(<= main_x 28), 15888#(<= main_x 29), 15889#(<= main_x 30), 15890#(<= main_x 31), 15891#(<= main_x 32), 15892#(<= main_x 33), 15893#(<= main_x 34), 15894#(<= main_x 35), 15895#(<= main_x 36), 15896#(<= main_x 37), 15897#(<= main_x 38), 15898#(<= main_x 39), 15899#(<= main_x 40), 15900#(<= main_x 41), 15901#(<= main_x 42), 15902#(<= main_x 43), 15903#(<= main_x 44), 15904#(<= main_x 45), 15905#(<= main_x 46), 15906#(<= main_x 47), 15907#(<= main_x 48), 15908#(<= main_x 49), 15909#(<= main_x 50), 15910#(<= main_x 51), 15911#(<= main_x 52), 15912#(<= main_x 53), 15913#(<= main_x 54), 15914#(<= main_x 55), 15915#(<= main_x 56), 15916#(<= main_x 57), 15917#(<= main_x 58), 15918#(<= main_x 59), 15919#(<= main_x 60), 15920#(<= main_x 61), 15921#(<= main_x 62), 15922#(<= main_x 63), 15923#(<= main_x 64), 15924#(<= main_x 65), 15925#(<= main_x 66), 15926#(<= main_x 67), 15927#(<= main_x 68), 15928#(<= main_x 69), 15929#(<= main_x 70), 15930#(<= main_x 71), 15931#(<= main_x 72), 15932#(<= main_x 73), 15933#(<= main_x 74), 15934#(<= main_x 75), 15935#(<= main_x 76), 15857#true, 15858#false, 15859#(<= main_x 0), 15860#(<= main_x 1), 15861#(<= main_x 2), 15862#(<= main_x 3), 15863#(<= main_x 4), 15864#(<= main_x 5), 15865#(<= main_x 6), 15866#(<= main_x 7), 15867#(<= main_x 8), 15868#(<= main_x 9), 15869#(<= main_x 10), 15870#(<= main_x 11), 15871#(<= main_x 12)] [2018-07-23 13:51:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:13,733 INFO L450 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-23 13:51:13,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-23 13:51:13,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 13:51:13,735 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2018-07-23 13:51:13,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:13,789 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-23 13:51:13,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-23 13:51:13,789 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2018-07-23 13:51:13,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:13,790 INFO L225 Difference]: With dead ends: 81 [2018-07-23 13:51:13,790 INFO L226 Difference]: Without dead ends: 80 [2018-07-23 13:51:13,791 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 13:51:13,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-23 13:51:13,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-23 13:51:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-23 13:51:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-07-23 13:51:13,795 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-07-23 13:51:13,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:13,795 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-07-23 13:51:13,795 INFO L472 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-23 13:51:13,796 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-07-23 13:51:13,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-23 13:51:13,797 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:13,797 INFO L357 BasicCegarLoop]: trace histogram [77, 1, 1] [2018-07-23 13:51:13,797 INFO L414 AbstractCegarLoop]: === Iteration 78 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:13,797 INFO L82 PathProgramCache]: Analyzing trace with hash -268904095, now seen corresponding path program 77 times [2018-07-23 13:51:13,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:14,024 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:14,024 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-23 13:51:14,024 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:14,024 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-23 13:51:14,024 INFO L185 omatonBuilderFactory]: Interpolants [16258#true, 16259#false, 16260#(<= main_x 0), 16261#(<= main_x 1), 16262#(<= main_x 2), 16263#(<= main_x 3), 16264#(<= main_x 4), 16265#(<= main_x 5), 16266#(<= main_x 6), 16267#(<= main_x 7), 16268#(<= main_x 8), 16269#(<= main_x 9), 16270#(<= main_x 10), 16271#(<= main_x 11), 16272#(<= main_x 12), 16273#(<= main_x 13), 16274#(<= main_x 14), 16275#(<= main_x 15), 16276#(<= main_x 16), 16277#(<= main_x 17), 16278#(<= main_x 18), 16279#(<= main_x 19), 16280#(<= main_x 20), 16281#(<= main_x 21), 16282#(<= main_x 22), 16283#(<= main_x 23), 16284#(<= main_x 24), 16285#(<= main_x 25), 16286#(<= main_x 26), 16287#(<= main_x 27), 16288#(<= main_x 28), 16289#(<= main_x 29), 16290#(<= main_x 30), 16291#(<= main_x 31), 16292#(<= main_x 32), 16293#(<= main_x 33), 16294#(<= main_x 34), 16295#(<= main_x 35), 16296#(<= main_x 36), 16297#(<= main_x 37), 16298#(<= main_x 38), 16299#(<= main_x 39), 16300#(<= main_x 40), 16301#(<= main_x 41), 16302#(<= main_x 42), 16303#(<= main_x 43), 16304#(<= main_x 44), 16305#(<= main_x 45), 16306#(<= main_x 46), 16307#(<= main_x 47), 16308#(<= main_x 48), 16309#(<= main_x 49), 16310#(<= main_x 50), 16311#(<= main_x 51), 16312#(<= main_x 52), 16313#(<= main_x 53), 16314#(<= main_x 54), 16315#(<= main_x 55), 16316#(<= main_x 56), 16317#(<= main_x 57), 16318#(<= main_x 58), 16319#(<= main_x 59), 16320#(<= main_x 60), 16321#(<= main_x 61), 16322#(<= main_x 62), 16323#(<= main_x 63), 16324#(<= main_x 64), 16325#(<= main_x 65), 16326#(<= main_x 66), 16327#(<= main_x 67), 16328#(<= main_x 68), 16329#(<= main_x 69), 16330#(<= main_x 70), 16331#(<= main_x 71), 16332#(<= main_x 72), 16333#(<= main_x 73), 16334#(<= main_x 74), 16335#(<= main_x 75), 16336#(<= main_x 76), 16337#(<= main_x 77)] [2018-07-23 13:51:14,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:14,025 INFO L450 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-23 13:51:14,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-23 13:51:14,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 13:51:14,027 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-07-23 13:51:14,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:14,093 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-07-23 13:51:14,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-23 13:51:14,094 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-07-23 13:51:14,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:14,095 INFO L225 Difference]: With dead ends: 82 [2018-07-23 13:51:14,095 INFO L226 Difference]: Without dead ends: 81 [2018-07-23 13:51:14,096 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 13:51:14,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-23 13:51:14,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-23 13:51:14,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-23 13:51:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-23 13:51:14,099 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-07-23 13:51:14,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:14,099 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-23 13:51:14,099 INFO L472 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-23 13:51:14,099 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-23 13:51:14,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-23 13:51:14,100 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:14,100 INFO L357 BasicCegarLoop]: trace histogram [78, 1, 1] [2018-07-23 13:51:14,100 INFO L414 AbstractCegarLoop]: === Iteration 79 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:14,101 INFO L82 PathProgramCache]: Analyzing trace with hash 253907591, now seen corresponding path program 78 times [2018-07-23 13:51:14,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:14,347 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:14,347 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-23 13:51:14,347 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:14,348 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-23 13:51:14,348 INFO L185 omatonBuilderFactory]: Interpolants [16664#true, 16665#false, 16666#(<= main_x 0), 16667#(<= main_x 1), 16668#(<= main_x 2), 16669#(<= main_x 3), 16670#(<= main_x 4), 16671#(<= main_x 5), 16672#(<= main_x 6), 16673#(<= main_x 7), 16674#(<= main_x 8), 16675#(<= main_x 9), 16676#(<= main_x 10), 16677#(<= main_x 11), 16678#(<= main_x 12), 16679#(<= main_x 13), 16680#(<= main_x 14), 16681#(<= main_x 15), 16682#(<= main_x 16), 16683#(<= main_x 17), 16684#(<= main_x 18), 16685#(<= main_x 19), 16686#(<= main_x 20), 16687#(<= main_x 21), 16688#(<= main_x 22), 16689#(<= main_x 23), 16690#(<= main_x 24), 16691#(<= main_x 25), 16692#(<= main_x 26), 16693#(<= main_x 27), 16694#(<= main_x 28), 16695#(<= main_x 29), 16696#(<= main_x 30), 16697#(<= main_x 31), 16698#(<= main_x 32), 16699#(<= main_x 33), 16700#(<= main_x 34), 16701#(<= main_x 35), 16702#(<= main_x 36), 16703#(<= main_x 37), 16704#(<= main_x 38), 16705#(<= main_x 39), 16706#(<= main_x 40), 16707#(<= main_x 41), 16708#(<= main_x 42), 16709#(<= main_x 43), 16710#(<= main_x 44), 16711#(<= main_x 45), 16712#(<= main_x 46), 16713#(<= main_x 47), 16714#(<= main_x 48), 16715#(<= main_x 49), 16716#(<= main_x 50), 16717#(<= main_x 51), 16718#(<= main_x 52), 16719#(<= main_x 53), 16720#(<= main_x 54), 16721#(<= main_x 55), 16722#(<= main_x 56), 16723#(<= main_x 57), 16724#(<= main_x 58), 16725#(<= main_x 59), 16726#(<= main_x 60), 16727#(<= main_x 61), 16728#(<= main_x 62), 16729#(<= main_x 63), 16730#(<= main_x 64), 16731#(<= main_x 65), 16732#(<= main_x 66), 16733#(<= main_x 67), 16734#(<= main_x 68), 16735#(<= main_x 69), 16736#(<= main_x 70), 16737#(<= main_x 71), 16738#(<= main_x 72), 16739#(<= main_x 73), 16740#(<= main_x 74), 16741#(<= main_x 75), 16742#(<= main_x 76), 16743#(<= main_x 77), 16744#(<= main_x 78)] [2018-07-23 13:51:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:14,349 INFO L450 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-23 13:51:14,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-23 13:51:14,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 13:51:14,350 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2018-07-23 13:51:14,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:14,415 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-23 13:51:14,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-23 13:51:14,415 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2018-07-23 13:51:14,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:14,416 INFO L225 Difference]: With dead ends: 83 [2018-07-23 13:51:14,416 INFO L226 Difference]: Without dead ends: 82 [2018-07-23 13:51:14,417 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 13:51:14,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-23 13:51:14,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-07-23 13:51:14,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-23 13:51:14,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-07-23 13:51:14,420 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-07-23 13:51:14,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:14,421 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-07-23 13:51:14,421 INFO L472 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-23 13:51:14,421 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-07-23 13:51:14,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-07-23 13:51:14,422 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:14,422 INFO L357 BasicCegarLoop]: trace histogram [79, 1, 1] [2018-07-23 13:51:14,422 INFO L414 AbstractCegarLoop]: === Iteration 80 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:14,422 INFO L82 PathProgramCache]: Analyzing trace with hash -718799327, now seen corresponding path program 79 times [2018-07-23 13:51:14,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:14,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:14,646 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:14,647 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-23 13:51:14,647 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:14,647 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-23 13:51:14,648 INFO L185 omatonBuilderFactory]: Interpolants [17152#(<= main_x 75), 17153#(<= main_x 76), 17154#(<= main_x 77), 17155#(<= main_x 78), 17156#(<= main_x 79), 17075#true, 17076#false, 17077#(<= main_x 0), 17078#(<= main_x 1), 17079#(<= main_x 2), 17080#(<= main_x 3), 17081#(<= main_x 4), 17082#(<= main_x 5), 17083#(<= main_x 6), 17084#(<= main_x 7), 17085#(<= main_x 8), 17086#(<= main_x 9), 17087#(<= main_x 10), 17088#(<= main_x 11), 17089#(<= main_x 12), 17090#(<= main_x 13), 17091#(<= main_x 14), 17092#(<= main_x 15), 17093#(<= main_x 16), 17094#(<= main_x 17), 17095#(<= main_x 18), 17096#(<= main_x 19), 17097#(<= main_x 20), 17098#(<= main_x 21), 17099#(<= main_x 22), 17100#(<= main_x 23), 17101#(<= main_x 24), 17102#(<= main_x 25), 17103#(<= main_x 26), 17104#(<= main_x 27), 17105#(<= main_x 28), 17106#(<= main_x 29), 17107#(<= main_x 30), 17108#(<= main_x 31), 17109#(<= main_x 32), 17110#(<= main_x 33), 17111#(<= main_x 34), 17112#(<= main_x 35), 17113#(<= main_x 36), 17114#(<= main_x 37), 17115#(<= main_x 38), 17116#(<= main_x 39), 17117#(<= main_x 40), 17118#(<= main_x 41), 17119#(<= main_x 42), 17120#(<= main_x 43), 17121#(<= main_x 44), 17122#(<= main_x 45), 17123#(<= main_x 46), 17124#(<= main_x 47), 17125#(<= main_x 48), 17126#(<= main_x 49), 17127#(<= main_x 50), 17128#(<= main_x 51), 17129#(<= main_x 52), 17130#(<= main_x 53), 17131#(<= main_x 54), 17132#(<= main_x 55), 17133#(<= main_x 56), 17134#(<= main_x 57), 17135#(<= main_x 58), 17136#(<= main_x 59), 17137#(<= main_x 60), 17138#(<= main_x 61), 17139#(<= main_x 62), 17140#(<= main_x 63), 17141#(<= main_x 64), 17142#(<= main_x 65), 17143#(<= main_x 66), 17144#(<= main_x 67), 17145#(<= main_x 68), 17146#(<= main_x 69), 17147#(<= main_x 70), 17148#(<= main_x 71), 17149#(<= main_x 72), 17150#(<= main_x 73), 17151#(<= main_x 74)] [2018-07-23 13:51:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:14,648 INFO L450 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-23 13:51:14,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-23 13:51:14,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 13:51:14,650 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-07-23 13:51:14,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:14,709 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-07-23 13:51:14,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-23 13:51:14,709 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-07-23 13:51:14,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:14,710 INFO L225 Difference]: With dead ends: 84 [2018-07-23 13:51:14,710 INFO L226 Difference]: Without dead ends: 83 [2018-07-23 13:51:14,711 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 13:51:14,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-23 13:51:14,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-23 13:51:14,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-23 13:51:14,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-23 13:51:14,714 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-07-23 13:51:14,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:14,715 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-23 13:51:14,715 INFO L472 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-23 13:51:14,715 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-23 13:51:14,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-23 13:51:14,716 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:14,716 INFO L357 BasicCegarLoop]: trace histogram [80, 1, 1] [2018-07-23 13:51:14,716 INFO L414 AbstractCegarLoop]: === Iteration 81 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:14,717 INFO L82 PathProgramCache]: Analyzing trace with hash -807942713, now seen corresponding path program 80 times [2018-07-23 13:51:14,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:15,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:15,024 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:15,025 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-23 13:51:15,025 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:15,025 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-23 13:51:15,025 INFO L185 omatonBuilderFactory]: Interpolants [17536#(<= main_x 43), 17537#(<= main_x 44), 17538#(<= main_x 45), 17539#(<= main_x 46), 17540#(<= main_x 47), 17541#(<= main_x 48), 17542#(<= main_x 49), 17543#(<= main_x 50), 17544#(<= main_x 51), 17545#(<= main_x 52), 17546#(<= main_x 53), 17547#(<= main_x 54), 17548#(<= main_x 55), 17549#(<= main_x 56), 17550#(<= main_x 57), 17551#(<= main_x 58), 17552#(<= main_x 59), 17553#(<= main_x 60), 17554#(<= main_x 61), 17555#(<= main_x 62), 17556#(<= main_x 63), 17557#(<= main_x 64), 17558#(<= main_x 65), 17559#(<= main_x 66), 17560#(<= main_x 67), 17561#(<= main_x 68), 17562#(<= main_x 69), 17563#(<= main_x 70), 17564#(<= main_x 71), 17565#(<= main_x 72), 17566#(<= main_x 73), 17567#(<= main_x 74), 17568#(<= main_x 75), 17569#(<= main_x 76), 17570#(<= main_x 77), 17571#(<= main_x 78), 17572#(<= main_x 79), 17573#(<= main_x 80), 17491#true, 17492#false, 17493#(<= main_x 0), 17494#(<= main_x 1), 17495#(<= main_x 2), 17496#(<= main_x 3), 17497#(<= main_x 4), 17498#(<= main_x 5), 17499#(<= main_x 6), 17500#(<= main_x 7), 17501#(<= main_x 8), 17502#(<= main_x 9), 17503#(<= main_x 10), 17504#(<= main_x 11), 17505#(<= main_x 12), 17506#(<= main_x 13), 17507#(<= main_x 14), 17508#(<= main_x 15), 17509#(<= main_x 16), 17510#(<= main_x 17), 17511#(<= main_x 18), 17512#(<= main_x 19), 17513#(<= main_x 20), 17514#(<= main_x 21), 17515#(<= main_x 22), 17516#(<= main_x 23), 17517#(<= main_x 24), 17518#(<= main_x 25), 17519#(<= main_x 26), 17520#(<= main_x 27), 17521#(<= main_x 28), 17522#(<= main_x 29), 17523#(<= main_x 30), 17524#(<= main_x 31), 17525#(<= main_x 32), 17526#(<= main_x 33), 17527#(<= main_x 34), 17528#(<= main_x 35), 17529#(<= main_x 36), 17530#(<= main_x 37), 17531#(<= main_x 38), 17532#(<= main_x 39), 17533#(<= main_x 40), 17534#(<= main_x 41), 17535#(<= main_x 42)] [2018-07-23 13:51:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:15,026 INFO L450 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-23 13:51:15,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-23 13:51:15,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 13:51:15,028 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2018-07-23 13:51:15,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:15,089 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-23 13:51:15,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-23 13:51:15,089 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 82 [2018-07-23 13:51:15,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:15,090 INFO L225 Difference]: With dead ends: 85 [2018-07-23 13:51:15,090 INFO L226 Difference]: Without dead ends: 84 [2018-07-23 13:51:15,090 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 13:51:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-23 13:51:15,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-07-23 13:51:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-23 13:51:15,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-07-23 13:51:15,093 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-07-23 13:51:15,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:15,093 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-07-23 13:51:15,093 INFO L472 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-23 13:51:15,093 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-07-23 13:51:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-23 13:51:15,094 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:15,094 INFO L357 BasicCegarLoop]: trace histogram [81, 1, 1] [2018-07-23 13:51:15,094 INFO L414 AbstractCegarLoop]: === Iteration 82 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:15,095 INFO L82 PathProgramCache]: Analyzing trace with hash 723579617, now seen corresponding path program 81 times [2018-07-23 13:51:15,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:15,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:15,348 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:15,348 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-23 13:51:15,348 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:15,348 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-23 13:51:15,349 INFO L185 omatonBuilderFactory]: Interpolants [17920#(<= main_x 6), 17921#(<= main_x 7), 17922#(<= main_x 8), 17923#(<= main_x 9), 17924#(<= main_x 10), 17925#(<= main_x 11), 17926#(<= main_x 12), 17927#(<= main_x 13), 17928#(<= main_x 14), 17929#(<= main_x 15), 17930#(<= main_x 16), 17931#(<= main_x 17), 17932#(<= main_x 18), 17933#(<= main_x 19), 17934#(<= main_x 20), 17935#(<= main_x 21), 17936#(<= main_x 22), 17937#(<= main_x 23), 17938#(<= main_x 24), 17939#(<= main_x 25), 17940#(<= main_x 26), 17941#(<= main_x 27), 17942#(<= main_x 28), 17943#(<= main_x 29), 17944#(<= main_x 30), 17945#(<= main_x 31), 17946#(<= main_x 32), 17947#(<= main_x 33), 17948#(<= main_x 34), 17949#(<= main_x 35), 17950#(<= main_x 36), 17951#(<= main_x 37), 17952#(<= main_x 38), 17953#(<= main_x 39), 17954#(<= main_x 40), 17955#(<= main_x 41), 17956#(<= main_x 42), 17957#(<= main_x 43), 17958#(<= main_x 44), 17959#(<= main_x 45), 17960#(<= main_x 46), 17961#(<= main_x 47), 17962#(<= main_x 48), 17963#(<= main_x 49), 17964#(<= main_x 50), 17965#(<= main_x 51), 17966#(<= main_x 52), 17967#(<= main_x 53), 17968#(<= main_x 54), 17969#(<= main_x 55), 17970#(<= main_x 56), 17971#(<= main_x 57), 17972#(<= main_x 58), 17973#(<= main_x 59), 17974#(<= main_x 60), 17975#(<= main_x 61), 17976#(<= main_x 62), 17977#(<= main_x 63), 17978#(<= main_x 64), 17979#(<= main_x 65), 17980#(<= main_x 66), 17981#(<= main_x 67), 17982#(<= main_x 68), 17983#(<= main_x 69), 17984#(<= main_x 70), 17985#(<= main_x 71), 17986#(<= main_x 72), 17987#(<= main_x 73), 17988#(<= main_x 74), 17989#(<= main_x 75), 17990#(<= main_x 76), 17991#(<= main_x 77), 17992#(<= main_x 78), 17993#(<= main_x 79), 17994#(<= main_x 80), 17995#(<= main_x 81), 17912#true, 17913#false, 17914#(<= main_x 0), 17915#(<= main_x 1), 17916#(<= main_x 2), 17917#(<= main_x 3), 17918#(<= main_x 4), 17919#(<= main_x 5)] [2018-07-23 13:51:15,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:15,349 INFO L450 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-23 13:51:15,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-23 13:51:15,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 13:51:15,351 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2018-07-23 13:51:15,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:15,413 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-07-23 13:51:15,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-23 13:51:15,413 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2018-07-23 13:51:15,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:15,414 INFO L225 Difference]: With dead ends: 86 [2018-07-23 13:51:15,414 INFO L226 Difference]: Without dead ends: 85 [2018-07-23 13:51:15,415 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 13:51:15,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-23 13:51:15,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-23 13:51:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-23 13:51:15,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-23 13:51:15,418 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-07-23 13:51:15,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:15,418 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-23 13:51:15,418 INFO L472 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-23 13:51:15,418 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-23 13:51:15,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-23 13:51:15,419 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:15,419 INFO L357 BasicCegarLoop]: trace histogram [82, 1, 1] [2018-07-23 13:51:15,419 INFO L414 AbstractCegarLoop]: === Iteration 83 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:15,419 INFO L82 PathProgramCache]: Analyzing trace with hash 956131591, now seen corresponding path program 82 times [2018-07-23 13:51:15,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:15,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:15,666 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:15,666 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-23 13:51:15,666 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:15,666 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-23 13:51:15,667 INFO L185 omatonBuilderFactory]: Interpolants [18338#true, 18339#false, 18340#(<= main_x 0), 18341#(<= main_x 1), 18342#(<= main_x 2), 18343#(<= main_x 3), 18344#(<= main_x 4), 18345#(<= main_x 5), 18346#(<= main_x 6), 18347#(<= main_x 7), 18348#(<= main_x 8), 18349#(<= main_x 9), 18350#(<= main_x 10), 18351#(<= main_x 11), 18352#(<= main_x 12), 18353#(<= main_x 13), 18354#(<= main_x 14), 18355#(<= main_x 15), 18356#(<= main_x 16), 18357#(<= main_x 17), 18358#(<= main_x 18), 18359#(<= main_x 19), 18360#(<= main_x 20), 18361#(<= main_x 21), 18362#(<= main_x 22), 18363#(<= main_x 23), 18364#(<= main_x 24), 18365#(<= main_x 25), 18366#(<= main_x 26), 18367#(<= main_x 27), 18368#(<= main_x 28), 18369#(<= main_x 29), 18370#(<= main_x 30), 18371#(<= main_x 31), 18372#(<= main_x 32), 18373#(<= main_x 33), 18374#(<= main_x 34), 18375#(<= main_x 35), 18376#(<= main_x 36), 18377#(<= main_x 37), 18378#(<= main_x 38), 18379#(<= main_x 39), 18380#(<= main_x 40), 18381#(<= main_x 41), 18382#(<= main_x 42), 18383#(<= main_x 43), 18384#(<= main_x 44), 18385#(<= main_x 45), 18386#(<= main_x 46), 18387#(<= main_x 47), 18388#(<= main_x 48), 18389#(<= main_x 49), 18390#(<= main_x 50), 18391#(<= main_x 51), 18392#(<= main_x 52), 18393#(<= main_x 53), 18394#(<= main_x 54), 18395#(<= main_x 55), 18396#(<= main_x 56), 18397#(<= main_x 57), 18398#(<= main_x 58), 18399#(<= main_x 59), 18400#(<= main_x 60), 18401#(<= main_x 61), 18402#(<= main_x 62), 18403#(<= main_x 63), 18404#(<= main_x 64), 18405#(<= main_x 65), 18406#(<= main_x 66), 18407#(<= main_x 67), 18408#(<= main_x 68), 18409#(<= main_x 69), 18410#(<= main_x 70), 18411#(<= main_x 71), 18412#(<= main_x 72), 18413#(<= main_x 73), 18414#(<= main_x 74), 18415#(<= main_x 75), 18416#(<= main_x 76), 18417#(<= main_x 77), 18418#(<= main_x 78), 18419#(<= main_x 79), 18420#(<= main_x 80), 18421#(<= main_x 81), 18422#(<= main_x 82)] [2018-07-23 13:51:15,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:15,667 INFO L450 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-23 13:51:15,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-23 13:51:15,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 13:51:15,668 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 85 states. [2018-07-23 13:51:15,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:15,741 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-23 13:51:15,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-23 13:51:15,742 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 84 [2018-07-23 13:51:15,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:15,743 INFO L225 Difference]: With dead ends: 87 [2018-07-23 13:51:15,743 INFO L226 Difference]: Without dead ends: 86 [2018-07-23 13:51:15,743 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 13:51:15,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-23 13:51:15,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-23 13:51:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-23 13:51:15,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-23 13:51:15,746 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-07-23 13:51:15,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:15,746 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-23 13:51:15,747 INFO L472 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-23 13:51:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-23 13:51:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-23 13:51:15,747 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:15,747 INFO L357 BasicCegarLoop]: trace histogram [83, 1, 1] [2018-07-23 13:51:15,747 INFO L414 AbstractCegarLoop]: === Iteration 84 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:15,748 INFO L82 PathProgramCache]: Analyzing trace with hash -424691807, now seen corresponding path program 83 times [2018-07-23 13:51:15,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:16,023 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:16,023 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-23 13:51:16,023 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:16,024 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-23 13:51:16,024 INFO L185 omatonBuilderFactory]: Interpolants [18816#(<= main_x 45), 18817#(<= main_x 46), 18818#(<= main_x 47), 18819#(<= main_x 48), 18820#(<= main_x 49), 18821#(<= main_x 50), 18822#(<= main_x 51), 18823#(<= main_x 52), 18824#(<= main_x 53), 18825#(<= main_x 54), 18826#(<= main_x 55), 18827#(<= main_x 56), 18828#(<= main_x 57), 18829#(<= main_x 58), 18830#(<= main_x 59), 18831#(<= main_x 60), 18832#(<= main_x 61), 18833#(<= main_x 62), 18834#(<= main_x 63), 18835#(<= main_x 64), 18836#(<= main_x 65), 18837#(<= main_x 66), 18838#(<= main_x 67), 18839#(<= main_x 68), 18840#(<= main_x 69), 18841#(<= main_x 70), 18842#(<= main_x 71), 18843#(<= main_x 72), 18844#(<= main_x 73), 18845#(<= main_x 74), 18846#(<= main_x 75), 18847#(<= main_x 76), 18848#(<= main_x 77), 18849#(<= main_x 78), 18850#(<= main_x 79), 18851#(<= main_x 80), 18852#(<= main_x 81), 18853#(<= main_x 82), 18854#(<= main_x 83), 18769#true, 18770#false, 18771#(<= main_x 0), 18772#(<= main_x 1), 18773#(<= main_x 2), 18774#(<= main_x 3), 18775#(<= main_x 4), 18776#(<= main_x 5), 18777#(<= main_x 6), 18778#(<= main_x 7), 18779#(<= main_x 8), 18780#(<= main_x 9), 18781#(<= main_x 10), 18782#(<= main_x 11), 18783#(<= main_x 12), 18784#(<= main_x 13), 18785#(<= main_x 14), 18786#(<= main_x 15), 18787#(<= main_x 16), 18788#(<= main_x 17), 18789#(<= main_x 18), 18790#(<= main_x 19), 18791#(<= main_x 20), 18792#(<= main_x 21), 18793#(<= main_x 22), 18794#(<= main_x 23), 18795#(<= main_x 24), 18796#(<= main_x 25), 18797#(<= main_x 26), 18798#(<= main_x 27), 18799#(<= main_x 28), 18800#(<= main_x 29), 18801#(<= main_x 30), 18802#(<= main_x 31), 18803#(<= main_x 32), 18804#(<= main_x 33), 18805#(<= main_x 34), 18806#(<= main_x 35), 18807#(<= main_x 36), 18808#(<= main_x 37), 18809#(<= main_x 38), 18810#(<= main_x 39), 18811#(<= main_x 40), 18812#(<= main_x 41), 18813#(<= main_x 42), 18814#(<= main_x 43), 18815#(<= main_x 44)] [2018-07-23 13:51:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:16,025 INFO L450 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-23 13:51:16,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-23 13:51:16,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 13:51:16,026 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2018-07-23 13:51:16,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:16,070 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-07-23 13:51:16,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-23 13:51:16,070 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 85 [2018-07-23 13:51:16,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:16,071 INFO L225 Difference]: With dead ends: 88 [2018-07-23 13:51:16,071 INFO L226 Difference]: Without dead ends: 87 [2018-07-23 13:51:16,072 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 13:51:16,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-23 13:51:16,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-23 13:51:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-23 13:51:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-23 13:51:16,075 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-07-23 13:51:16,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:16,075 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-23 13:51:16,075 INFO L472 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-23 13:51:16,075 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-23 13:51:16,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-23 13:51:16,076 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:16,076 INFO L357 BasicCegarLoop]: trace histogram [84, 1, 1] [2018-07-23 13:51:16,076 INFO L414 AbstractCegarLoop]: === Iteration 85 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:16,077 INFO L82 PathProgramCache]: Analyzing trace with hash -280544185, now seen corresponding path program 84 times [2018-07-23 13:51:16,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:16,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:16,391 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:16,391 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-23 13:51:16,391 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:16,392 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-23 13:51:16,392 INFO L185 omatonBuilderFactory]: Interpolants [19205#true, 19206#false, 19207#(<= main_x 0), 19208#(<= main_x 1), 19209#(<= main_x 2), 19210#(<= main_x 3), 19211#(<= main_x 4), 19212#(<= main_x 5), 19213#(<= main_x 6), 19214#(<= main_x 7), 19215#(<= main_x 8), 19216#(<= main_x 9), 19217#(<= main_x 10), 19218#(<= main_x 11), 19219#(<= main_x 12), 19220#(<= main_x 13), 19221#(<= main_x 14), 19222#(<= main_x 15), 19223#(<= main_x 16), 19224#(<= main_x 17), 19225#(<= main_x 18), 19226#(<= main_x 19), 19227#(<= main_x 20), 19228#(<= main_x 21), 19229#(<= main_x 22), 19230#(<= main_x 23), 19231#(<= main_x 24), 19232#(<= main_x 25), 19233#(<= main_x 26), 19234#(<= main_x 27), 19235#(<= main_x 28), 19236#(<= main_x 29), 19237#(<= main_x 30), 19238#(<= main_x 31), 19239#(<= main_x 32), 19240#(<= main_x 33), 19241#(<= main_x 34), 19242#(<= main_x 35), 19243#(<= main_x 36), 19244#(<= main_x 37), 19245#(<= main_x 38), 19246#(<= main_x 39), 19247#(<= main_x 40), 19248#(<= main_x 41), 19249#(<= main_x 42), 19250#(<= main_x 43), 19251#(<= main_x 44), 19252#(<= main_x 45), 19253#(<= main_x 46), 19254#(<= main_x 47), 19255#(<= main_x 48), 19256#(<= main_x 49), 19257#(<= main_x 50), 19258#(<= main_x 51), 19259#(<= main_x 52), 19260#(<= main_x 53), 19261#(<= main_x 54), 19262#(<= main_x 55), 19263#(<= main_x 56), 19264#(<= main_x 57), 19265#(<= main_x 58), 19266#(<= main_x 59), 19267#(<= main_x 60), 19268#(<= main_x 61), 19269#(<= main_x 62), 19270#(<= main_x 63), 19271#(<= main_x 64), 19272#(<= main_x 65), 19273#(<= main_x 66), 19274#(<= main_x 67), 19275#(<= main_x 68), 19276#(<= main_x 69), 19277#(<= main_x 70), 19278#(<= main_x 71), 19279#(<= main_x 72), 19280#(<= main_x 73), 19281#(<= main_x 74), 19282#(<= main_x 75), 19283#(<= main_x 76), 19284#(<= main_x 77), 19285#(<= main_x 78), 19286#(<= main_x 79), 19287#(<= main_x 80), 19288#(<= main_x 81), 19289#(<= main_x 82), 19290#(<= main_x 83), 19291#(<= main_x 84)] [2018-07-23 13:51:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:16,392 INFO L450 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-23 13:51:16,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-23 13:51:16,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 13:51:16,394 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 87 states. [2018-07-23 13:51:16,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:16,510 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-23 13:51:16,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-23 13:51:16,510 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 86 [2018-07-23 13:51:16,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:16,511 INFO L225 Difference]: With dead ends: 89 [2018-07-23 13:51:16,511 INFO L226 Difference]: Without dead ends: 88 [2018-07-23 13:51:16,512 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 13:51:16,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-23 13:51:16,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-07-23 13:51:16,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-23 13:51:16,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-07-23 13:51:16,514 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-07-23 13:51:16,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:16,515 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-07-23 13:51:16,515 INFO L472 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-23 13:51:16,515 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-07-23 13:51:16,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-23 13:51:16,518 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:16,518 INFO L357 BasicCegarLoop]: trace histogram [85, 1, 1] [2018-07-23 13:51:16,518 INFO L414 AbstractCegarLoop]: === Iteration 86 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:16,518 INFO L82 PathProgramCache]: Analyzing trace with hash -106935199, now seen corresponding path program 85 times [2018-07-23 13:51:16,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:16,816 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:16,816 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-23 13:51:16,817 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:16,817 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-23 13:51:16,817 INFO L185 omatonBuilderFactory]: Interpolants [19712#(<= main_x 64), 19713#(<= main_x 65), 19714#(<= main_x 66), 19715#(<= main_x 67), 19716#(<= main_x 68), 19717#(<= main_x 69), 19718#(<= main_x 70), 19719#(<= main_x 71), 19720#(<= main_x 72), 19721#(<= main_x 73), 19722#(<= main_x 74), 19723#(<= main_x 75), 19724#(<= main_x 76), 19725#(<= main_x 77), 19726#(<= main_x 78), 19727#(<= main_x 79), 19728#(<= main_x 80), 19729#(<= main_x 81), 19730#(<= main_x 82), 19731#(<= main_x 83), 19732#(<= main_x 84), 19733#(<= main_x 85), 19646#true, 19647#false, 19648#(<= main_x 0), 19649#(<= main_x 1), 19650#(<= main_x 2), 19651#(<= main_x 3), 19652#(<= main_x 4), 19653#(<= main_x 5), 19654#(<= main_x 6), 19655#(<= main_x 7), 19656#(<= main_x 8), 19657#(<= main_x 9), 19658#(<= main_x 10), 19659#(<= main_x 11), 19660#(<= main_x 12), 19661#(<= main_x 13), 19662#(<= main_x 14), 19663#(<= main_x 15), 19664#(<= main_x 16), 19665#(<= main_x 17), 19666#(<= main_x 18), 19667#(<= main_x 19), 19668#(<= main_x 20), 19669#(<= main_x 21), 19670#(<= main_x 22), 19671#(<= main_x 23), 19672#(<= main_x 24), 19673#(<= main_x 25), 19674#(<= main_x 26), 19675#(<= main_x 27), 19676#(<= main_x 28), 19677#(<= main_x 29), 19678#(<= main_x 30), 19679#(<= main_x 31), 19680#(<= main_x 32), 19681#(<= main_x 33), 19682#(<= main_x 34), 19683#(<= main_x 35), 19684#(<= main_x 36), 19685#(<= main_x 37), 19686#(<= main_x 38), 19687#(<= main_x 39), 19688#(<= main_x 40), 19689#(<= main_x 41), 19690#(<= main_x 42), 19691#(<= main_x 43), 19692#(<= main_x 44), 19693#(<= main_x 45), 19694#(<= main_x 46), 19695#(<= main_x 47), 19696#(<= main_x 48), 19697#(<= main_x 49), 19698#(<= main_x 50), 19699#(<= main_x 51), 19700#(<= main_x 52), 19701#(<= main_x 53), 19702#(<= main_x 54), 19703#(<= main_x 55), 19704#(<= main_x 56), 19705#(<= main_x 57), 19706#(<= main_x 58), 19707#(<= main_x 59), 19708#(<= main_x 60), 19709#(<= main_x 61), 19710#(<= main_x 62), 19711#(<= main_x 63)] [2018-07-23 13:51:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:16,818 INFO L450 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-23 13:51:16,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-23 13:51:16,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 13:51:16,819 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2018-07-23 13:51:16,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:16,860 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-23 13:51:16,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-23 13:51:16,860 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 87 [2018-07-23 13:51:16,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:16,862 INFO L225 Difference]: With dead ends: 90 [2018-07-23 13:51:16,862 INFO L226 Difference]: Without dead ends: 89 [2018-07-23 13:51:16,862 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 13:51:16,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-23 13:51:16,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-23 13:51:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-23 13:51:16,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-23 13:51:16,866 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-07-23 13:51:16,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:16,866 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-23 13:51:16,867 INFO L472 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-23 13:51:16,867 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-23 13:51:16,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-23 13:51:16,867 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:16,867 INFO L357 BasicCegarLoop]: trace histogram [86, 1, 1] [2018-07-23 13:51:16,868 INFO L414 AbstractCegarLoop]: === Iteration 87 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:16,868 INFO L82 PathProgramCache]: Analyzing trace with hash 979976071, now seen corresponding path program 86 times [2018-07-23 13:51:16,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:17,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:17,142 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:17,142 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-23 13:51:17,142 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:17,143 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-23 13:51:17,143 INFO L185 omatonBuilderFactory]: Interpolants [20096#(<= main_x 2), 20097#(<= main_x 3), 20098#(<= main_x 4), 20099#(<= main_x 5), 20100#(<= main_x 6), 20101#(<= main_x 7), 20102#(<= main_x 8), 20103#(<= main_x 9), 20104#(<= main_x 10), 20105#(<= main_x 11), 20106#(<= main_x 12), 20107#(<= main_x 13), 20108#(<= main_x 14), 20109#(<= main_x 15), 20110#(<= main_x 16), 20111#(<= main_x 17), 20112#(<= main_x 18), 20113#(<= main_x 19), 20114#(<= main_x 20), 20115#(<= main_x 21), 20116#(<= main_x 22), 20117#(<= main_x 23), 20118#(<= main_x 24), 20119#(<= main_x 25), 20120#(<= main_x 26), 20121#(<= main_x 27), 20122#(<= main_x 28), 20123#(<= main_x 29), 20124#(<= main_x 30), 20125#(<= main_x 31), 20126#(<= main_x 32), 20127#(<= main_x 33), 20128#(<= main_x 34), 20129#(<= main_x 35), 20130#(<= main_x 36), 20131#(<= main_x 37), 20132#(<= main_x 38), 20133#(<= main_x 39), 20134#(<= main_x 40), 20135#(<= main_x 41), 20136#(<= main_x 42), 20137#(<= main_x 43), 20138#(<= main_x 44), 20139#(<= main_x 45), 20140#(<= main_x 46), 20141#(<= main_x 47), 20142#(<= main_x 48), 20143#(<= main_x 49), 20144#(<= main_x 50), 20145#(<= main_x 51), 20146#(<= main_x 52), 20147#(<= main_x 53), 20148#(<= main_x 54), 20149#(<= main_x 55), 20150#(<= main_x 56), 20151#(<= main_x 57), 20152#(<= main_x 58), 20153#(<= main_x 59), 20154#(<= main_x 60), 20155#(<= main_x 61), 20156#(<= main_x 62), 20157#(<= main_x 63), 20158#(<= main_x 64), 20159#(<= main_x 65), 20160#(<= main_x 66), 20161#(<= main_x 67), 20162#(<= main_x 68), 20163#(<= main_x 69), 20164#(<= main_x 70), 20165#(<= main_x 71), 20166#(<= main_x 72), 20167#(<= main_x 73), 20168#(<= main_x 74), 20169#(<= main_x 75), 20170#(<= main_x 76), 20171#(<= main_x 77), 20172#(<= main_x 78), 20173#(<= main_x 79), 20174#(<= main_x 80), 20175#(<= main_x 81), 20176#(<= main_x 82), 20177#(<= main_x 83), 20178#(<= main_x 84), 20179#(<= main_x 85), 20180#(<= main_x 86), 20092#true, 20093#false, 20094#(<= main_x 0), 20095#(<= main_x 1)] [2018-07-23 13:51:17,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:17,144 INFO L450 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-23 13:51:17,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-23 13:51:17,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 13:51:17,145 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 89 states. [2018-07-23 13:51:17,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:17,240 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-23 13:51:17,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-23 13:51:17,241 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 88 [2018-07-23 13:51:17,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:17,241 INFO L225 Difference]: With dead ends: 91 [2018-07-23 13:51:17,242 INFO L226 Difference]: Without dead ends: 90 [2018-07-23 13:51:17,242 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 13:51:17,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-23 13:51:17,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-07-23 13:51:17,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-23 13:51:17,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-07-23 13:51:17,245 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-07-23 13:51:17,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:17,246 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-07-23 13:51:17,246 INFO L472 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-23 13:51:17,246 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-07-23 13:51:17,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-07-23 13:51:17,247 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:17,247 INFO L357 BasicCegarLoop]: trace histogram [87, 1, 1] [2018-07-23 13:51:17,247 INFO L414 AbstractCegarLoop]: === Iteration 88 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:17,247 INFO L82 PathProgramCache]: Analyzing trace with hash 314487073, now seen corresponding path program 87 times [2018-07-23 13:51:17,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:17,554 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:17,554 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-23 13:51:17,554 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:17,555 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-23 13:51:17,555 INFO L185 omatonBuilderFactory]: Interpolants [20608#(<= main_x 63), 20609#(<= main_x 64), 20610#(<= main_x 65), 20611#(<= main_x 66), 20612#(<= main_x 67), 20613#(<= main_x 68), 20614#(<= main_x 69), 20615#(<= main_x 70), 20616#(<= main_x 71), 20617#(<= main_x 72), 20618#(<= main_x 73), 20619#(<= main_x 74), 20620#(<= main_x 75), 20621#(<= main_x 76), 20622#(<= main_x 77), 20623#(<= main_x 78), 20624#(<= main_x 79), 20625#(<= main_x 80), 20626#(<= main_x 81), 20627#(<= main_x 82), 20628#(<= main_x 83), 20629#(<= main_x 84), 20630#(<= main_x 85), 20631#(<= main_x 86), 20632#(<= main_x 87), 20543#true, 20544#false, 20545#(<= main_x 0), 20546#(<= main_x 1), 20547#(<= main_x 2), 20548#(<= main_x 3), 20549#(<= main_x 4), 20550#(<= main_x 5), 20551#(<= main_x 6), 20552#(<= main_x 7), 20553#(<= main_x 8), 20554#(<= main_x 9), 20555#(<= main_x 10), 20556#(<= main_x 11), 20557#(<= main_x 12), 20558#(<= main_x 13), 20559#(<= main_x 14), 20560#(<= main_x 15), 20561#(<= main_x 16), 20562#(<= main_x 17), 20563#(<= main_x 18), 20564#(<= main_x 19), 20565#(<= main_x 20), 20566#(<= main_x 21), 20567#(<= main_x 22), 20568#(<= main_x 23), 20569#(<= main_x 24), 20570#(<= main_x 25), 20571#(<= main_x 26), 20572#(<= main_x 27), 20573#(<= main_x 28), 20574#(<= main_x 29), 20575#(<= main_x 30), 20576#(<= main_x 31), 20577#(<= main_x 32), 20578#(<= main_x 33), 20579#(<= main_x 34), 20580#(<= main_x 35), 20581#(<= main_x 36), 20582#(<= main_x 37), 20583#(<= main_x 38), 20584#(<= main_x 39), 20585#(<= main_x 40), 20586#(<= main_x 41), 20587#(<= main_x 42), 20588#(<= main_x 43), 20589#(<= main_x 44), 20590#(<= main_x 45), 20591#(<= main_x 46), 20592#(<= main_x 47), 20593#(<= main_x 48), 20594#(<= main_x 49), 20595#(<= main_x 50), 20596#(<= main_x 51), 20597#(<= main_x 52), 20598#(<= main_x 53), 20599#(<= main_x 54), 20600#(<= main_x 55), 20601#(<= main_x 56), 20602#(<= main_x 57), 20603#(<= main_x 58), 20604#(<= main_x 59), 20605#(<= main_x 60), 20606#(<= main_x 61), 20607#(<= main_x 62)] [2018-07-23 13:51:17,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:17,556 INFO L450 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-23 13:51:17,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-23 13:51:17,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 13:51:17,557 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 90 states. [2018-07-23 13:51:17,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:17,602 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-07-23 13:51:17,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-23 13:51:17,603 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 89 [2018-07-23 13:51:17,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:17,603 INFO L225 Difference]: With dead ends: 92 [2018-07-23 13:51:17,604 INFO L226 Difference]: Without dead ends: 91 [2018-07-23 13:51:17,604 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 13:51:17,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-23 13:51:17,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-23 13:51:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-23 13:51:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-23 13:51:17,609 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-07-23 13:51:17,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:17,609 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-23 13:51:17,609 INFO L472 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-23 13:51:17,609 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-23 13:51:17,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-23 13:51:17,610 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:17,610 INFO L357 BasicCegarLoop]: trace histogram [88, 1, 1] [2018-07-23 13:51:17,610 INFO L414 AbstractCegarLoop]: === Iteration 89 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:17,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164615, now seen corresponding path program 88 times [2018-07-23 13:51:17,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:17,876 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:17,876 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-23 13:51:17,877 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:17,877 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-23 13:51:17,877 INFO L185 omatonBuilderFactory]: Interpolants [20999#true, 21000#false, 21001#(<= main_x 0), 21002#(<= main_x 1), 21003#(<= main_x 2), 21004#(<= main_x 3), 21005#(<= main_x 4), 21006#(<= main_x 5), 21007#(<= main_x 6), 21008#(<= main_x 7), 21009#(<= main_x 8), 21010#(<= main_x 9), 21011#(<= main_x 10), 21012#(<= main_x 11), 21013#(<= main_x 12), 21014#(<= main_x 13), 21015#(<= main_x 14), 21016#(<= main_x 15), 21017#(<= main_x 16), 21018#(<= main_x 17), 21019#(<= main_x 18), 21020#(<= main_x 19), 21021#(<= main_x 20), 21022#(<= main_x 21), 21023#(<= main_x 22), 21024#(<= main_x 23), 21025#(<= main_x 24), 21026#(<= main_x 25), 21027#(<= main_x 26), 21028#(<= main_x 27), 21029#(<= main_x 28), 21030#(<= main_x 29), 21031#(<= main_x 30), 21032#(<= main_x 31), 21033#(<= main_x 32), 21034#(<= main_x 33), 21035#(<= main_x 34), 21036#(<= main_x 35), 21037#(<= main_x 36), 21038#(<= main_x 37), 21039#(<= main_x 38), 21040#(<= main_x 39), 21041#(<= main_x 40), 21042#(<= main_x 41), 21043#(<= main_x 42), 21044#(<= main_x 43), 21045#(<= main_x 44), 21046#(<= main_x 45), 21047#(<= main_x 46), 21048#(<= main_x 47), 21049#(<= main_x 48), 21050#(<= main_x 49), 21051#(<= main_x 50), 21052#(<= main_x 51), 21053#(<= main_x 52), 21054#(<= main_x 53), 21055#(<= main_x 54), 21056#(<= main_x 55), 21057#(<= main_x 56), 21058#(<= main_x 57), 21059#(<= main_x 58), 21060#(<= main_x 59), 21061#(<= main_x 60), 21062#(<= main_x 61), 21063#(<= main_x 62), 21064#(<= main_x 63), 21065#(<= main_x 64), 21066#(<= main_x 65), 21067#(<= main_x 66), 21068#(<= main_x 67), 21069#(<= main_x 68), 21070#(<= main_x 69), 21071#(<= main_x 70), 21072#(<= main_x 71), 21073#(<= main_x 72), 21074#(<= main_x 73), 21075#(<= main_x 74), 21076#(<= main_x 75), 21077#(<= main_x 76), 21078#(<= main_x 77), 21079#(<= main_x 78), 21080#(<= main_x 79), 21081#(<= main_x 80), 21082#(<= main_x 81), 21083#(<= main_x 82), 21084#(<= main_x 83), 21085#(<= main_x 84), 21086#(<= main_x 85), 21087#(<= main_x 86), 21088#(<= main_x 87), 21089#(<= main_x 88)] [2018-07-23 13:51:17,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:17,878 INFO L450 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-23 13:51:17,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-23 13:51:17,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 13:51:17,879 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 91 states. [2018-07-23 13:51:17,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:17,963 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-23 13:51:17,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-23 13:51:17,963 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 90 [2018-07-23 13:51:17,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:17,965 INFO L225 Difference]: With dead ends: 93 [2018-07-23 13:51:17,965 INFO L226 Difference]: Without dead ends: 92 [2018-07-23 13:51:17,965 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 13:51:17,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-23 13:51:17,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-23 13:51:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-23 13:51:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-07-23 13:51:17,969 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-07-23 13:51:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:17,970 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-07-23 13:51:17,970 INFO L472 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-23 13:51:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-07-23 13:51:17,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-23 13:51:17,971 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:17,971 INFO L357 BasicCegarLoop]: trace histogram [89, 1, 1] [2018-07-23 13:51:17,971 INFO L414 AbstractCegarLoop]: === Iteration 90 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:17,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364641, now seen corresponding path program 89 times [2018-07-23 13:51:17,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:18,281 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:18,282 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-23 13:51:18,282 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:18,282 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-23 13:51:18,282 INFO L185 omatonBuilderFactory]: Interpolants [21504#(<= main_x 42), 21505#(<= main_x 43), 21506#(<= main_x 44), 21507#(<= main_x 45), 21508#(<= main_x 46), 21509#(<= main_x 47), 21510#(<= main_x 48), 21511#(<= main_x 49), 21512#(<= main_x 50), 21513#(<= main_x 51), 21514#(<= main_x 52), 21515#(<= main_x 53), 21516#(<= main_x 54), 21517#(<= main_x 55), 21518#(<= main_x 56), 21519#(<= main_x 57), 21520#(<= main_x 58), 21521#(<= main_x 59), 21522#(<= main_x 60), 21523#(<= main_x 61), 21524#(<= main_x 62), 21525#(<= main_x 63), 21526#(<= main_x 64), 21527#(<= main_x 65), 21528#(<= main_x 66), 21529#(<= main_x 67), 21530#(<= main_x 68), 21531#(<= main_x 69), 21532#(<= main_x 70), 21533#(<= main_x 71), 21534#(<= main_x 72), 21535#(<= main_x 73), 21536#(<= main_x 74), 21537#(<= main_x 75), 21538#(<= main_x 76), 21539#(<= main_x 77), 21540#(<= main_x 78), 21541#(<= main_x 79), 21542#(<= main_x 80), 21543#(<= main_x 81), 21544#(<= main_x 82), 21545#(<= main_x 83), 21546#(<= main_x 84), 21547#(<= main_x 85), 21548#(<= main_x 86), 21549#(<= main_x 87), 21550#(<= main_x 88), 21551#(<= main_x 89), 21460#true, 21461#false, 21462#(<= main_x 0), 21463#(<= main_x 1), 21464#(<= main_x 2), 21465#(<= main_x 3), 21466#(<= main_x 4), 21467#(<= main_x 5), 21468#(<= main_x 6), 21469#(<= main_x 7), 21470#(<= main_x 8), 21471#(<= main_x 9), 21472#(<= main_x 10), 21473#(<= main_x 11), 21474#(<= main_x 12), 21475#(<= main_x 13), 21476#(<= main_x 14), 21477#(<= main_x 15), 21478#(<= main_x 16), 21479#(<= main_x 17), 21480#(<= main_x 18), 21481#(<= main_x 19), 21482#(<= main_x 20), 21483#(<= main_x 21), 21484#(<= main_x 22), 21485#(<= main_x 23), 21486#(<= main_x 24), 21487#(<= main_x 25), 21488#(<= main_x 26), 21489#(<= main_x 27), 21490#(<= main_x 28), 21491#(<= main_x 29), 21492#(<= main_x 30), 21493#(<= main_x 31), 21494#(<= main_x 32), 21495#(<= main_x 33), 21496#(<= main_x 34), 21497#(<= main_x 35), 21498#(<= main_x 36), 21499#(<= main_x 37), 21500#(<= main_x 38), 21501#(<= main_x 39), 21502#(<= main_x 40), 21503#(<= main_x 41)] [2018-07-23 13:51:18,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:18,283 INFO L450 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-23 13:51:18,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-23 13:51:18,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 13:51:18,285 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 92 states. [2018-07-23 13:51:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:18,329 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-07-23 13:51:18,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-23 13:51:18,330 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 91 [2018-07-23 13:51:18,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:18,330 INFO L225 Difference]: With dead ends: 94 [2018-07-23 13:51:18,331 INFO L226 Difference]: Without dead ends: 93 [2018-07-23 13:51:18,331 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 13:51:18,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-23 13:51:18,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-23 13:51:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-23 13:51:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-23 13:51:18,335 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-07-23 13:51:18,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:18,335 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-23 13:51:18,335 INFO L472 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-23 13:51:18,336 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-23 13:51:18,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-23 13:51:18,336 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:18,336 INFO L357 BasicCegarLoop]: trace histogram [90, 1, 1] [2018-07-23 13:51:18,336 INFO L414 AbstractCegarLoop]: === Iteration 91 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:18,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663559, now seen corresponding path program 90 times [2018-07-23 13:51:18,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:18,583 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:18,583 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-23 13:51:18,583 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:18,583 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-23 13:51:18,584 INFO L185 omatonBuilderFactory]: Interpolants [22016#(<= main_x 88), 22017#(<= main_x 89), 22018#(<= main_x 90), 21926#true, 21927#false, 21928#(<= main_x 0), 21929#(<= main_x 1), 21930#(<= main_x 2), 21931#(<= main_x 3), 21932#(<= main_x 4), 21933#(<= main_x 5), 21934#(<= main_x 6), 21935#(<= main_x 7), 21936#(<= main_x 8), 21937#(<= main_x 9), 21938#(<= main_x 10), 21939#(<= main_x 11), 21940#(<= main_x 12), 21941#(<= main_x 13), 21942#(<= main_x 14), 21943#(<= main_x 15), 21944#(<= main_x 16), 21945#(<= main_x 17), 21946#(<= main_x 18), 21947#(<= main_x 19), 21948#(<= main_x 20), 21949#(<= main_x 21), 21950#(<= main_x 22), 21951#(<= main_x 23), 21952#(<= main_x 24), 21953#(<= main_x 25), 21954#(<= main_x 26), 21955#(<= main_x 27), 21956#(<= main_x 28), 21957#(<= main_x 29), 21958#(<= main_x 30), 21959#(<= main_x 31), 21960#(<= main_x 32), 21961#(<= main_x 33), 21962#(<= main_x 34), 21963#(<= main_x 35), 21964#(<= main_x 36), 21965#(<= main_x 37), 21966#(<= main_x 38), 21967#(<= main_x 39), 21968#(<= main_x 40), 21969#(<= main_x 41), 21970#(<= main_x 42), 21971#(<= main_x 43), 21972#(<= main_x 44), 21973#(<= main_x 45), 21974#(<= main_x 46), 21975#(<= main_x 47), 21976#(<= main_x 48), 21977#(<= main_x 49), 21978#(<= main_x 50), 21979#(<= main_x 51), 21980#(<= main_x 52), 21981#(<= main_x 53), 21982#(<= main_x 54), 21983#(<= main_x 55), 21984#(<= main_x 56), 21985#(<= main_x 57), 21986#(<= main_x 58), 21987#(<= main_x 59), 21988#(<= main_x 60), 21989#(<= main_x 61), 21990#(<= main_x 62), 21991#(<= main_x 63), 21992#(<= main_x 64), 21993#(<= main_x 65), 21994#(<= main_x 66), 21995#(<= main_x 67), 21996#(<= main_x 68), 21997#(<= main_x 69), 21998#(<= main_x 70), 21999#(<= main_x 71), 22000#(<= main_x 72), 22001#(<= main_x 73), 22002#(<= main_x 74), 22003#(<= main_x 75), 22004#(<= main_x 76), 22005#(<= main_x 77), 22006#(<= main_x 78), 22007#(<= main_x 79), 22008#(<= main_x 80), 22009#(<= main_x 81), 22010#(<= main_x 82), 22011#(<= main_x 83), 22012#(<= main_x 84), 22013#(<= main_x 85), 22014#(<= main_x 86), 22015#(<= main_x 87)] [2018-07-23 13:51:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:18,584 INFO L450 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-23 13:51:18,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-23 13:51:18,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 13:51:18,586 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 93 states. [2018-07-23 13:51:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:18,641 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-23 13:51:18,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-23 13:51:18,641 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 92 [2018-07-23 13:51:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:18,642 INFO L225 Difference]: With dead ends: 95 [2018-07-23 13:51:18,642 INFO L226 Difference]: Without dead ends: 94 [2018-07-23 13:51:18,643 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 13:51:18,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-23 13:51:18,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-23 13:51:18,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-23 13:51:18,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-07-23 13:51:18,646 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-07-23 13:51:18,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:18,647 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-07-23 13:51:18,647 INFO L472 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-23 13:51:18,647 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-07-23 13:51:18,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-23 13:51:18,647 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:18,648 INFO L357 BasicCegarLoop]: trace histogram [91, 1, 1] [2018-07-23 13:51:18,648 INFO L414 AbstractCegarLoop]: === Iteration 92 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:18,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930017, now seen corresponding path program 91 times [2018-07-23 13:51:18,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:18,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:18,927 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:18,927 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-23 13:51:18,927 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:18,927 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-23 13:51:18,928 INFO L185 omatonBuilderFactory]: Interpolants [22400#(<= main_x 1), 22401#(<= main_x 2), 22402#(<= main_x 3), 22403#(<= main_x 4), 22404#(<= main_x 5), 22405#(<= main_x 6), 22406#(<= main_x 7), 22407#(<= main_x 8), 22408#(<= main_x 9), 22409#(<= main_x 10), 22410#(<= main_x 11), 22411#(<= main_x 12), 22412#(<= main_x 13), 22413#(<= main_x 14), 22414#(<= main_x 15), 22415#(<= main_x 16), 22416#(<= main_x 17), 22417#(<= main_x 18), 22418#(<= main_x 19), 22419#(<= main_x 20), 22420#(<= main_x 21), 22421#(<= main_x 22), 22422#(<= main_x 23), 22423#(<= main_x 24), 22424#(<= main_x 25), 22425#(<= main_x 26), 22426#(<= main_x 27), 22427#(<= main_x 28), 22428#(<= main_x 29), 22429#(<= main_x 30), 22430#(<= main_x 31), 22431#(<= main_x 32), 22432#(<= main_x 33), 22433#(<= main_x 34), 22434#(<= main_x 35), 22435#(<= main_x 36), 22436#(<= main_x 37), 22437#(<= main_x 38), 22438#(<= main_x 39), 22439#(<= main_x 40), 22440#(<= main_x 41), 22441#(<= main_x 42), 22442#(<= main_x 43), 22443#(<= main_x 44), 22444#(<= main_x 45), 22445#(<= main_x 46), 22446#(<= main_x 47), 22447#(<= main_x 48), 22448#(<= main_x 49), 22449#(<= main_x 50), 22450#(<= main_x 51), 22451#(<= main_x 52), 22452#(<= main_x 53), 22453#(<= main_x 54), 22454#(<= main_x 55), 22455#(<= main_x 56), 22456#(<= main_x 57), 22457#(<= main_x 58), 22458#(<= main_x 59), 22459#(<= main_x 60), 22460#(<= main_x 61), 22461#(<= main_x 62), 22462#(<= main_x 63), 22463#(<= main_x 64), 22464#(<= main_x 65), 22465#(<= main_x 66), 22466#(<= main_x 67), 22467#(<= main_x 68), 22468#(<= main_x 69), 22469#(<= main_x 70), 22470#(<= main_x 71), 22471#(<= main_x 72), 22472#(<= main_x 73), 22473#(<= main_x 74), 22474#(<= main_x 75), 22475#(<= main_x 76), 22476#(<= main_x 77), 22477#(<= main_x 78), 22478#(<= main_x 79), 22479#(<= main_x 80), 22480#(<= main_x 81), 22481#(<= main_x 82), 22482#(<= main_x 83), 22483#(<= main_x 84), 22484#(<= main_x 85), 22485#(<= main_x 86), 22486#(<= main_x 87), 22487#(<= main_x 88), 22488#(<= main_x 89), 22489#(<= main_x 90), 22490#(<= main_x 91), 22397#true, 22398#false, 22399#(<= main_x 0)] [2018-07-23 13:51:18,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:18,928 INFO L450 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-23 13:51:18,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-23 13:51:18,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 13:51:18,930 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 94 states. [2018-07-23 13:51:19,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:19,000 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-07-23 13:51:19,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-23 13:51:19,000 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 93 [2018-07-23 13:51:19,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:19,001 INFO L225 Difference]: With dead ends: 96 [2018-07-23 13:51:19,001 INFO L226 Difference]: Without dead ends: 95 [2018-07-23 13:51:19,001 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 13:51:19,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-23 13:51:19,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-23 13:51:19,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-23 13:51:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-23 13:51:19,004 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-07-23 13:51:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:19,004 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-23 13:51:19,004 INFO L472 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-23 13:51:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-23 13:51:19,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-23 13:51:19,005 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:19,005 INFO L357 BasicCegarLoop]: trace histogram [92, 1, 1] [2018-07-23 13:51:19,005 INFO L414 AbstractCegarLoop]: === Iteration 93 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:19,005 INFO L82 PathProgramCache]: Analyzing trace with hash 854092103, now seen corresponding path program 92 times [2018-07-23 13:51:19,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:19,228 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:19,228 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-23 13:51:19,228 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:19,228 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-23 13:51:19,229 INFO L185 omatonBuilderFactory]: Interpolants [22912#(<= main_x 37), 22913#(<= main_x 38), 22914#(<= main_x 39), 22915#(<= main_x 40), 22916#(<= main_x 41), 22917#(<= main_x 42), 22918#(<= main_x 43), 22919#(<= main_x 44), 22920#(<= main_x 45), 22921#(<= main_x 46), 22922#(<= main_x 47), 22923#(<= main_x 48), 22924#(<= main_x 49), 22925#(<= main_x 50), 22926#(<= main_x 51), 22927#(<= main_x 52), 22928#(<= main_x 53), 22929#(<= main_x 54), 22930#(<= main_x 55), 22931#(<= main_x 56), 22932#(<= main_x 57), 22933#(<= main_x 58), 22934#(<= main_x 59), 22935#(<= main_x 60), 22936#(<= main_x 61), 22937#(<= main_x 62), 22938#(<= main_x 63), 22939#(<= main_x 64), 22940#(<= main_x 65), 22941#(<= main_x 66), 22942#(<= main_x 67), 22943#(<= main_x 68), 22944#(<= main_x 69), 22945#(<= main_x 70), 22946#(<= main_x 71), 22947#(<= main_x 72), 22948#(<= main_x 73), 22949#(<= main_x 74), 22950#(<= main_x 75), 22951#(<= main_x 76), 22952#(<= main_x 77), 22953#(<= main_x 78), 22954#(<= main_x 79), 22955#(<= main_x 80), 22956#(<= main_x 81), 22957#(<= main_x 82), 22958#(<= main_x 83), 22959#(<= main_x 84), 22960#(<= main_x 85), 22961#(<= main_x 86), 22962#(<= main_x 87), 22963#(<= main_x 88), 22964#(<= main_x 89), 22965#(<= main_x 90), 22966#(<= main_x 91), 22967#(<= main_x 92), 22873#true, 22874#false, 22875#(<= main_x 0), 22876#(<= main_x 1), 22877#(<= main_x 2), 22878#(<= main_x 3), 22879#(<= main_x 4), 22880#(<= main_x 5), 22881#(<= main_x 6), 22882#(<= main_x 7), 22883#(<= main_x 8), 22884#(<= main_x 9), 22885#(<= main_x 10), 22886#(<= main_x 11), 22887#(<= main_x 12), 22888#(<= main_x 13), 22889#(<= main_x 14), 22890#(<= main_x 15), 22891#(<= main_x 16), 22892#(<= main_x 17), 22893#(<= main_x 18), 22894#(<= main_x 19), 22895#(<= main_x 20), 22896#(<= main_x 21), 22897#(<= main_x 22), 22898#(<= main_x 23), 22899#(<= main_x 24), 22900#(<= main_x 25), 22901#(<= main_x 26), 22902#(<= main_x 27), 22903#(<= main_x 28), 22904#(<= main_x 29), 22905#(<= main_x 30), 22906#(<= main_x 31), 22907#(<= main_x 32), 22908#(<= main_x 33), 22909#(<= main_x 34), 22910#(<= main_x 35), 22911#(<= main_x 36)] [2018-07-23 13:51:19,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:19,229 INFO L450 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-23 13:51:19,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-23 13:51:19,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 13:51:19,231 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 95 states. [2018-07-23 13:51:19,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:19,273 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-23 13:51:19,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-23 13:51:19,274 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 94 [2018-07-23 13:51:19,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:19,274 INFO L225 Difference]: With dead ends: 97 [2018-07-23 13:51:19,274 INFO L226 Difference]: Without dead ends: 96 [2018-07-23 13:51:19,275 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 13:51:19,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-23 13:51:19,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-23 13:51:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-23 13:51:19,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-07-23 13:51:19,277 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-07-23 13:51:19,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:19,277 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-07-23 13:51:19,278 INFO L472 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-23 13:51:19,278 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-07-23 13:51:19,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-23 13:51:19,278 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:19,278 INFO L357 BasicCegarLoop]: trace histogram [93, 1, 1] [2018-07-23 13:51:19,278 INFO L414 AbstractCegarLoop]: === Iteration 94 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:19,278 INFO L82 PathProgramCache]: Analyzing trace with hash 707051361, now seen corresponding path program 93 times [2018-07-23 13:51:19,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:19,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:19,604 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:19,604 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-23 13:51:19,604 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:19,605 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-23 13:51:19,605 INFO L185 omatonBuilderFactory]: Interpolants [23424#(<= main_x 68), 23425#(<= main_x 69), 23426#(<= main_x 70), 23427#(<= main_x 71), 23428#(<= main_x 72), 23429#(<= main_x 73), 23430#(<= main_x 74), 23431#(<= main_x 75), 23432#(<= main_x 76), 23433#(<= main_x 77), 23434#(<= main_x 78), 23435#(<= main_x 79), 23436#(<= main_x 80), 23437#(<= main_x 81), 23438#(<= main_x 82), 23439#(<= main_x 83), 23440#(<= main_x 84), 23441#(<= main_x 85), 23442#(<= main_x 86), 23443#(<= main_x 87), 23444#(<= main_x 88), 23445#(<= main_x 89), 23446#(<= main_x 90), 23447#(<= main_x 91), 23448#(<= main_x 92), 23449#(<= main_x 93), 23354#true, 23355#false, 23356#(<= main_x 0), 23357#(<= main_x 1), 23358#(<= main_x 2), 23359#(<= main_x 3), 23360#(<= main_x 4), 23361#(<= main_x 5), 23362#(<= main_x 6), 23363#(<= main_x 7), 23364#(<= main_x 8), 23365#(<= main_x 9), 23366#(<= main_x 10), 23367#(<= main_x 11), 23368#(<= main_x 12), 23369#(<= main_x 13), 23370#(<= main_x 14), 23371#(<= main_x 15), 23372#(<= main_x 16), 23373#(<= main_x 17), 23374#(<= main_x 18), 23375#(<= main_x 19), 23376#(<= main_x 20), 23377#(<= main_x 21), 23378#(<= main_x 22), 23379#(<= main_x 23), 23380#(<= main_x 24), 23381#(<= main_x 25), 23382#(<= main_x 26), 23383#(<= main_x 27), 23384#(<= main_x 28), 23385#(<= main_x 29), 23386#(<= main_x 30), 23387#(<= main_x 31), 23388#(<= main_x 32), 23389#(<= main_x 33), 23390#(<= main_x 34), 23391#(<= main_x 35), 23392#(<= main_x 36), 23393#(<= main_x 37), 23394#(<= main_x 38), 23395#(<= main_x 39), 23396#(<= main_x 40), 23397#(<= main_x 41), 23398#(<= main_x 42), 23399#(<= main_x 43), 23400#(<= main_x 44), 23401#(<= main_x 45), 23402#(<= main_x 46), 23403#(<= main_x 47), 23404#(<= main_x 48), 23405#(<= main_x 49), 23406#(<= main_x 50), 23407#(<= main_x 51), 23408#(<= main_x 52), 23409#(<= main_x 53), 23410#(<= main_x 54), 23411#(<= main_x 55), 23412#(<= main_x 56), 23413#(<= main_x 57), 23414#(<= main_x 58), 23415#(<= main_x 59), 23416#(<= main_x 60), 23417#(<= main_x 61), 23418#(<= main_x 62), 23419#(<= main_x 63), 23420#(<= main_x 64), 23421#(<= main_x 65), 23422#(<= main_x 66), 23423#(<= main_x 67)] [2018-07-23 13:51:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:19,606 INFO L450 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-23 13:51:19,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-23 13:51:19,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 13:51:19,607 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 96 states. [2018-07-23 13:51:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:19,649 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-07-23 13:51:19,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-23 13:51:19,650 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 95 [2018-07-23 13:51:19,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:19,650 INFO L225 Difference]: With dead ends: 98 [2018-07-23 13:51:19,650 INFO L226 Difference]: Without dead ends: 97 [2018-07-23 13:51:19,651 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 13:51:19,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-23 13:51:19,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-23 13:51:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-23 13:51:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-23 13:51:19,653 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-07-23 13:51:19,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:19,654 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-23 13:51:19,654 INFO L472 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-23 13:51:19,654 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-23 13:51:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-23 13:51:19,654 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:19,654 INFO L357 BasicCegarLoop]: trace histogram [94, 1, 1] [2018-07-23 13:51:19,655 INFO L414 AbstractCegarLoop]: === Iteration 95 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:19,655 INFO L82 PathProgramCache]: Analyzing trace with hash 443755655, now seen corresponding path program 94 times [2018-07-23 13:51:19,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:19,942 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:19,942 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-23 13:51:19,942 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:19,942 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-23 13:51:19,942 INFO L185 omatonBuilderFactory]: Interpolants [23840#true, 23841#false, 23842#(<= main_x 0), 23843#(<= main_x 1), 23844#(<= main_x 2), 23845#(<= main_x 3), 23846#(<= main_x 4), 23847#(<= main_x 5), 23848#(<= main_x 6), 23849#(<= main_x 7), 23850#(<= main_x 8), 23851#(<= main_x 9), 23852#(<= main_x 10), 23853#(<= main_x 11), 23854#(<= main_x 12), 23855#(<= main_x 13), 23856#(<= main_x 14), 23857#(<= main_x 15), 23858#(<= main_x 16), 23859#(<= main_x 17), 23860#(<= main_x 18), 23861#(<= main_x 19), 23862#(<= main_x 20), 23863#(<= main_x 21), 23864#(<= main_x 22), 23865#(<= main_x 23), 23866#(<= main_x 24), 23867#(<= main_x 25), 23868#(<= main_x 26), 23869#(<= main_x 27), 23870#(<= main_x 28), 23871#(<= main_x 29), 23872#(<= main_x 30), 23873#(<= main_x 31), 23874#(<= main_x 32), 23875#(<= main_x 33), 23876#(<= main_x 34), 23877#(<= main_x 35), 23878#(<= main_x 36), 23879#(<= main_x 37), 23880#(<= main_x 38), 23881#(<= main_x 39), 23882#(<= main_x 40), 23883#(<= main_x 41), 23884#(<= main_x 42), 23885#(<= main_x 43), 23886#(<= main_x 44), 23887#(<= main_x 45), 23888#(<= main_x 46), 23889#(<= main_x 47), 23890#(<= main_x 48), 23891#(<= main_x 49), 23892#(<= main_x 50), 23893#(<= main_x 51), 23894#(<= main_x 52), 23895#(<= main_x 53), 23896#(<= main_x 54), 23897#(<= main_x 55), 23898#(<= main_x 56), 23899#(<= main_x 57), 23900#(<= main_x 58), 23901#(<= main_x 59), 23902#(<= main_x 60), 23903#(<= main_x 61), 23904#(<= main_x 62), 23905#(<= main_x 63), 23906#(<= main_x 64), 23907#(<= main_x 65), 23908#(<= main_x 66), 23909#(<= main_x 67), 23910#(<= main_x 68), 23911#(<= main_x 69), 23912#(<= main_x 70), 23913#(<= main_x 71), 23914#(<= main_x 72), 23915#(<= main_x 73), 23916#(<= main_x 74), 23917#(<= main_x 75), 23918#(<= main_x 76), 23919#(<= main_x 77), 23920#(<= main_x 78), 23921#(<= main_x 79), 23922#(<= main_x 80), 23923#(<= main_x 81), 23924#(<= main_x 82), 23925#(<= main_x 83), 23926#(<= main_x 84), 23927#(<= main_x 85), 23928#(<= main_x 86), 23929#(<= main_x 87), 23930#(<= main_x 88), 23931#(<= main_x 89), 23932#(<= main_x 90), 23933#(<= main_x 91), 23934#(<= main_x 92), 23935#(<= main_x 93), 23936#(<= main_x 94)] [2018-07-23 13:51:19,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:19,943 INFO L450 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-23 13:51:19,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-23 13:51:19,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 13:51:19,944 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 97 states. [2018-07-23 13:51:20,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:20,005 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-23 13:51:20,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-23 13:51:20,006 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 96 [2018-07-23 13:51:20,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:20,006 INFO L225 Difference]: With dead ends: 99 [2018-07-23 13:51:20,006 INFO L226 Difference]: Without dead ends: 98 [2018-07-23 13:51:20,007 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 13:51:20,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-23 13:51:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-07-23 13:51:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-23 13:51:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-07-23 13:51:20,009 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-07-23 13:51:20,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:20,010 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-07-23 13:51:20,010 INFO L472 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-23 13:51:20,010 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-07-23 13:51:20,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-07-23 13:51:20,010 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:20,011 INFO L357 BasicCegarLoop]: trace histogram [95, 1, 1] [2018-07-23 13:51:20,011 INFO L414 AbstractCegarLoop]: === Iteration 96 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:20,011 INFO L82 PathProgramCache]: Analyzing trace with hash 871523361, now seen corresponding path program 95 times [2018-07-23 13:51:20,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:20,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:20,219 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:20,219 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-23 13:51:20,219 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:20,220 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-23 13:51:20,220 INFO L185 omatonBuilderFactory]: Interpolants [24331#true, 24332#false, 24333#(<= main_x 0), 24334#(<= main_x 1), 24335#(<= main_x 2), 24336#(<= main_x 3), 24337#(<= main_x 4), 24338#(<= main_x 5), 24339#(<= main_x 6), 24340#(<= main_x 7), 24341#(<= main_x 8), 24342#(<= main_x 9), 24343#(<= main_x 10), 24344#(<= main_x 11), 24345#(<= main_x 12), 24346#(<= main_x 13), 24347#(<= main_x 14), 24348#(<= main_x 15), 24349#(<= main_x 16), 24350#(<= main_x 17), 24351#(<= main_x 18), 24352#(<= main_x 19), 24353#(<= main_x 20), 24354#(<= main_x 21), 24355#(<= main_x 22), 24356#(<= main_x 23), 24357#(<= main_x 24), 24358#(<= main_x 25), 24359#(<= main_x 26), 24360#(<= main_x 27), 24361#(<= main_x 28), 24362#(<= main_x 29), 24363#(<= main_x 30), 24364#(<= main_x 31), 24365#(<= main_x 32), 24366#(<= main_x 33), 24367#(<= main_x 34), 24368#(<= main_x 35), 24369#(<= main_x 36), 24370#(<= main_x 37), 24371#(<= main_x 38), 24372#(<= main_x 39), 24373#(<= main_x 40), 24374#(<= main_x 41), 24375#(<= main_x 42), 24376#(<= main_x 43), 24377#(<= main_x 44), 24378#(<= main_x 45), 24379#(<= main_x 46), 24380#(<= main_x 47), 24381#(<= main_x 48), 24382#(<= main_x 49), 24383#(<= main_x 50), 24384#(<= main_x 51), 24385#(<= main_x 52), 24386#(<= main_x 53), 24387#(<= main_x 54), 24388#(<= main_x 55), 24389#(<= main_x 56), 24390#(<= main_x 57), 24391#(<= main_x 58), 24392#(<= main_x 59), 24393#(<= main_x 60), 24394#(<= main_x 61), 24395#(<= main_x 62), 24396#(<= main_x 63), 24397#(<= main_x 64), 24398#(<= main_x 65), 24399#(<= main_x 66), 24400#(<= main_x 67), 24401#(<= main_x 68), 24402#(<= main_x 69), 24403#(<= main_x 70), 24404#(<= main_x 71), 24405#(<= main_x 72), 24406#(<= main_x 73), 24407#(<= main_x 74), 24408#(<= main_x 75), 24409#(<= main_x 76), 24410#(<= main_x 77), 24411#(<= main_x 78), 24412#(<= main_x 79), 24413#(<= main_x 80), 24414#(<= main_x 81), 24415#(<= main_x 82), 24416#(<= main_x 83), 24417#(<= main_x 84), 24418#(<= main_x 85), 24419#(<= main_x 86), 24420#(<= main_x 87), 24421#(<= main_x 88), 24422#(<= main_x 89), 24423#(<= main_x 90), 24424#(<= main_x 91), 24425#(<= main_x 92), 24426#(<= main_x 93), 24427#(<= main_x 94), 24428#(<= main_x 95)] [2018-07-23 13:51:20,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:20,220 INFO L450 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-23 13:51:20,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-23 13:51:20,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 13:51:20,222 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 98 states. [2018-07-23 13:51:20,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:20,298 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-07-23 13:51:20,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-23 13:51:20,299 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 97 [2018-07-23 13:51:20,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:20,300 INFO L225 Difference]: With dead ends: 100 [2018-07-23 13:51:20,300 INFO L226 Difference]: Without dead ends: 99 [2018-07-23 13:51:20,301 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 13:51:20,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-23 13:51:20,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-23 13:51:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-23 13:51:20,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-23 13:51:20,304 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-07-23 13:51:20,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:20,305 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-23 13:51:20,305 INFO L472 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-23 13:51:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-23 13:51:20,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-23 13:51:20,305 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:20,305 INFO L357 BasicCegarLoop]: trace histogram [96, 1, 1] [2018-07-23 13:51:20,306 INFO L414 AbstractCegarLoop]: === Iteration 97 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:20,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420359, now seen corresponding path program 96 times [2018-07-23 13:51:20,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:20,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:20,551 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:20,551 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-23 13:51:20,551 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:20,552 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-23 13:51:20,552 INFO L185 omatonBuilderFactory]: Interpolants [24832#(<= main_x 3), 24833#(<= main_x 4), 24834#(<= main_x 5), 24835#(<= main_x 6), 24836#(<= main_x 7), 24837#(<= main_x 8), 24838#(<= main_x 9), 24839#(<= main_x 10), 24840#(<= main_x 11), 24841#(<= main_x 12), 24842#(<= main_x 13), 24843#(<= main_x 14), 24844#(<= main_x 15), 24845#(<= main_x 16), 24846#(<= main_x 17), 24847#(<= main_x 18), 24848#(<= main_x 19), 24849#(<= main_x 20), 24850#(<= main_x 21), 24851#(<= main_x 22), 24852#(<= main_x 23), 24853#(<= main_x 24), 24854#(<= main_x 25), 24855#(<= main_x 26), 24856#(<= main_x 27), 24857#(<= main_x 28), 24858#(<= main_x 29), 24859#(<= main_x 30), 24860#(<= main_x 31), 24861#(<= main_x 32), 24862#(<= main_x 33), 24863#(<= main_x 34), 24864#(<= main_x 35), 24865#(<= main_x 36), 24866#(<= main_x 37), 24867#(<= main_x 38), 24868#(<= main_x 39), 24869#(<= main_x 40), 24870#(<= main_x 41), 24871#(<= main_x 42), 24872#(<= main_x 43), 24873#(<= main_x 44), 24874#(<= main_x 45), 24875#(<= main_x 46), 24876#(<= main_x 47), 24877#(<= main_x 48), 24878#(<= main_x 49), 24879#(<= main_x 50), 24880#(<= main_x 51), 24881#(<= main_x 52), 24882#(<= main_x 53), 24883#(<= main_x 54), 24884#(<= main_x 55), 24885#(<= main_x 56), 24886#(<= main_x 57), 24887#(<= main_x 58), 24888#(<= main_x 59), 24889#(<= main_x 60), 24890#(<= main_x 61), 24891#(<= main_x 62), 24892#(<= main_x 63), 24893#(<= main_x 64), 24894#(<= main_x 65), 24895#(<= main_x 66), 24896#(<= main_x 67), 24897#(<= main_x 68), 24898#(<= main_x 69), 24899#(<= main_x 70), 24900#(<= main_x 71), 24901#(<= main_x 72), 24902#(<= main_x 73), 24903#(<= main_x 74), 24904#(<= main_x 75), 24905#(<= main_x 76), 24906#(<= main_x 77), 24907#(<= main_x 78), 24908#(<= main_x 79), 24909#(<= main_x 80), 24910#(<= main_x 81), 24911#(<= main_x 82), 24912#(<= main_x 83), 24913#(<= main_x 84), 24914#(<= main_x 85), 24915#(<= main_x 86), 24916#(<= main_x 87), 24917#(<= main_x 88), 24918#(<= main_x 89), 24919#(<= main_x 90), 24920#(<= main_x 91), 24921#(<= main_x 92), 24922#(<= main_x 93), 24923#(<= main_x 94), 24924#(<= main_x 95), 24925#(<= main_x 96), 24827#true, 24828#false, 24829#(<= main_x 0), 24830#(<= main_x 1), 24831#(<= main_x 2)] [2018-07-23 13:51:20,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:20,552 INFO L450 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-23 13:51:20,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-23 13:51:20,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 13:51:20,553 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 99 states. [2018-07-23 13:51:20,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:20,629 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-23 13:51:20,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-23 13:51:20,629 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 98 [2018-07-23 13:51:20,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:20,629 INFO L225 Difference]: With dead ends: 101 [2018-07-23 13:51:20,630 INFO L226 Difference]: Without dead ends: 100 [2018-07-23 13:51:20,630 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 13:51:20,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-23 13:51:20,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-07-23 13:51:20,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-23 13:51:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-07-23 13:51:20,633 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-07-23 13:51:20,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:20,633 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-07-23 13:51:20,633 INFO L472 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-23 13:51:20,634 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-07-23 13:51:20,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-07-23 13:51:20,634 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:20,634 INFO L357 BasicCegarLoop]: trace histogram [97, 1, 1] [2018-07-23 13:51:20,634 INFO L414 AbstractCegarLoop]: === Iteration 98 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:20,635 INFO L82 PathProgramCache]: Analyzing trace with hash 15325409, now seen corresponding path program 97 times [2018-07-23 13:51:20,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:20,903 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:20,904 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-23 13:51:20,904 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:20,904 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-23 13:51:20,904 INFO L185 omatonBuilderFactory]: Interpolants [25344#(<= main_x 14), 25345#(<= main_x 15), 25346#(<= main_x 16), 25347#(<= main_x 17), 25348#(<= main_x 18), 25349#(<= main_x 19), 25350#(<= main_x 20), 25351#(<= main_x 21), 25352#(<= main_x 22), 25353#(<= main_x 23), 25354#(<= main_x 24), 25355#(<= main_x 25), 25356#(<= main_x 26), 25357#(<= main_x 27), 25358#(<= main_x 28), 25359#(<= main_x 29), 25360#(<= main_x 30), 25361#(<= main_x 31), 25362#(<= main_x 32), 25363#(<= main_x 33), 25364#(<= main_x 34), 25365#(<= main_x 35), 25366#(<= main_x 36), 25367#(<= main_x 37), 25368#(<= main_x 38), 25369#(<= main_x 39), 25370#(<= main_x 40), 25371#(<= main_x 41), 25372#(<= main_x 42), 25373#(<= main_x 43), 25374#(<= main_x 44), 25375#(<= main_x 45), 25376#(<= main_x 46), 25377#(<= main_x 47), 25378#(<= main_x 48), 25379#(<= main_x 49), 25380#(<= main_x 50), 25381#(<= main_x 51), 25382#(<= main_x 52), 25383#(<= main_x 53), 25384#(<= main_x 54), 25385#(<= main_x 55), 25386#(<= main_x 56), 25387#(<= main_x 57), 25388#(<= main_x 58), 25389#(<= main_x 59), 25390#(<= main_x 60), 25391#(<= main_x 61), 25392#(<= main_x 62), 25393#(<= main_x 63), 25394#(<= main_x 64), 25395#(<= main_x 65), 25396#(<= main_x 66), 25397#(<= main_x 67), 25398#(<= main_x 68), 25399#(<= main_x 69), 25400#(<= main_x 70), 25401#(<= main_x 71), 25402#(<= main_x 72), 25403#(<= main_x 73), 25404#(<= main_x 74), 25405#(<= main_x 75), 25406#(<= main_x 76), 25407#(<= main_x 77), 25408#(<= main_x 78), 25409#(<= main_x 79), 25410#(<= main_x 80), 25411#(<= main_x 81), 25412#(<= main_x 82), 25413#(<= main_x 83), 25414#(<= main_x 84), 25415#(<= main_x 85), 25416#(<= main_x 86), 25417#(<= main_x 87), 25418#(<= main_x 88), 25419#(<= main_x 89), 25420#(<= main_x 90), 25421#(<= main_x 91), 25422#(<= main_x 92), 25423#(<= main_x 93), 25424#(<= main_x 94), 25425#(<= main_x 95), 25426#(<= main_x 96), 25427#(<= main_x 97), 25328#true, 25329#false, 25330#(<= main_x 0), 25331#(<= main_x 1), 25332#(<= main_x 2), 25333#(<= main_x 3), 25334#(<= main_x 4), 25335#(<= main_x 5), 25336#(<= main_x 6), 25337#(<= main_x 7), 25338#(<= main_x 8), 25339#(<= main_x 9), 25340#(<= main_x 10), 25341#(<= main_x 11), 25342#(<= main_x 12), 25343#(<= main_x 13)] [2018-07-23 13:51:20,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:20,905 INFO L450 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-23 13:51:20,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-23 13:51:20,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 13:51:20,906 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 100 states. [2018-07-23 13:51:20,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:20,991 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-07-23 13:51:20,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-23 13:51:20,991 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 99 [2018-07-23 13:51:20,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:20,992 INFO L225 Difference]: With dead ends: 102 [2018-07-23 13:51:20,992 INFO L226 Difference]: Without dead ends: 101 [2018-07-23 13:51:20,993 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 13:51:20,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-23 13:51:20,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-23 13:51:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-23 13:51:20,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-23 13:51:20,995 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-07-23 13:51:20,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:20,995 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-23 13:51:20,995 INFO L472 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-23 13:51:20,995 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-23 13:51:20,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-23 13:51:20,996 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:20,996 INFO L357 BasicCegarLoop]: trace histogram [98, 1, 1] [2018-07-23 13:51:20,996 INFO L414 AbstractCegarLoop]: === Iteration 99 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:20,996 INFO L82 PathProgramCache]: Analyzing trace with hash 475087623, now seen corresponding path program 98 times [2018-07-23 13:51:20,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:21,227 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:21,227 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-23 13:51:21,227 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:21,227 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-23 13:51:21,227 INFO L185 omatonBuilderFactory]: Interpolants [25856#(<= main_x 20), 25857#(<= main_x 21), 25858#(<= main_x 22), 25859#(<= main_x 23), 25860#(<= main_x 24), 25861#(<= main_x 25), 25862#(<= main_x 26), 25863#(<= main_x 27), 25864#(<= main_x 28), 25865#(<= main_x 29), 25866#(<= main_x 30), 25867#(<= main_x 31), 25868#(<= main_x 32), 25869#(<= main_x 33), 25870#(<= main_x 34), 25871#(<= main_x 35), 25872#(<= main_x 36), 25873#(<= main_x 37), 25874#(<= main_x 38), 25875#(<= main_x 39), 25876#(<= main_x 40), 25877#(<= main_x 41), 25878#(<= main_x 42), 25879#(<= main_x 43), 25880#(<= main_x 44), 25881#(<= main_x 45), 25882#(<= main_x 46), 25883#(<= main_x 47), 25884#(<= main_x 48), 25885#(<= main_x 49), 25886#(<= main_x 50), 25887#(<= main_x 51), 25888#(<= main_x 52), 25889#(<= main_x 53), 25890#(<= main_x 54), 25891#(<= main_x 55), 25892#(<= main_x 56), 25893#(<= main_x 57), 25894#(<= main_x 58), 25895#(<= main_x 59), 25896#(<= main_x 60), 25897#(<= main_x 61), 25898#(<= main_x 62), 25899#(<= main_x 63), 25900#(<= main_x 64), 25901#(<= main_x 65), 25902#(<= main_x 66), 25903#(<= main_x 67), 25904#(<= main_x 68), 25905#(<= main_x 69), 25906#(<= main_x 70), 25907#(<= main_x 71), 25908#(<= main_x 72), 25909#(<= main_x 73), 25910#(<= main_x 74), 25911#(<= main_x 75), 25912#(<= main_x 76), 25913#(<= main_x 77), 25914#(<= main_x 78), 25915#(<= main_x 79), 25916#(<= main_x 80), 25917#(<= main_x 81), 25918#(<= main_x 82), 25919#(<= main_x 83), 25920#(<= main_x 84), 25921#(<= main_x 85), 25922#(<= main_x 86), 25923#(<= main_x 87), 25924#(<= main_x 88), 25925#(<= main_x 89), 25926#(<= main_x 90), 25927#(<= main_x 91), 25928#(<= main_x 92), 25929#(<= main_x 93), 25930#(<= main_x 94), 25931#(<= main_x 95), 25932#(<= main_x 96), 25933#(<= main_x 97), 25934#(<= main_x 98), 25834#true, 25835#false, 25836#(<= main_x 0), 25837#(<= main_x 1), 25838#(<= main_x 2), 25839#(<= main_x 3), 25840#(<= main_x 4), 25841#(<= main_x 5), 25842#(<= main_x 6), 25843#(<= main_x 7), 25844#(<= main_x 8), 25845#(<= main_x 9), 25846#(<= main_x 10), 25847#(<= main_x 11), 25848#(<= main_x 12), 25849#(<= main_x 13), 25850#(<= main_x 14), 25851#(<= main_x 15), 25852#(<= main_x 16), 25853#(<= main_x 17), 25854#(<= main_x 18), 25855#(<= main_x 19)] [2018-07-23 13:51:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:21,228 INFO L450 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-23 13:51:21,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-23 13:51:21,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 13:51:21,229 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 101 states. [2018-07-23 13:51:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:21,303 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-23 13:51:21,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-23 13:51:21,304 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 100 [2018-07-23 13:51:21,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:21,304 INFO L225 Difference]: With dead ends: 103 [2018-07-23 13:51:21,304 INFO L226 Difference]: Without dead ends: 102 [2018-07-23 13:51:21,305 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 13:51:21,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-23 13:51:21,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-07-23 13:51:21,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-07-23 13:51:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-07-23 13:51:21,308 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-07-23 13:51:21,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:21,309 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-07-23 13:51:21,309 INFO L472 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-23 13:51:21,309 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-07-23 13:51:21,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-07-23 13:51:21,310 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:21,310 INFO L357 BasicCegarLoop]: trace histogram [99, 1, 1] [2018-07-23 13:51:21,310 INFO L414 AbstractCegarLoop]: === Iteration 100 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:21,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814369, now seen corresponding path program 99 times [2018-07-23 13:51:21,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:21,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:21,607 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:21,607 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-23 13:51:21,607 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:21,607 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-23 13:51:21,607 INFO L185 omatonBuilderFactory]: Interpolants [26368#(<= main_x 21), 26369#(<= main_x 22), 26370#(<= main_x 23), 26371#(<= main_x 24), 26372#(<= main_x 25), 26373#(<= main_x 26), 26374#(<= main_x 27), 26375#(<= main_x 28), 26376#(<= main_x 29), 26377#(<= main_x 30), 26378#(<= main_x 31), 26379#(<= main_x 32), 26380#(<= main_x 33), 26381#(<= main_x 34), 26382#(<= main_x 35), 26383#(<= main_x 36), 26384#(<= main_x 37), 26385#(<= main_x 38), 26386#(<= main_x 39), 26387#(<= main_x 40), 26388#(<= main_x 41), 26389#(<= main_x 42), 26390#(<= main_x 43), 26391#(<= main_x 44), 26392#(<= main_x 45), 26393#(<= main_x 46), 26394#(<= main_x 47), 26395#(<= main_x 48), 26396#(<= main_x 49), 26397#(<= main_x 50), 26398#(<= main_x 51), 26399#(<= main_x 52), 26400#(<= main_x 53), 26401#(<= main_x 54), 26402#(<= main_x 55), 26403#(<= main_x 56), 26404#(<= main_x 57), 26405#(<= main_x 58), 26406#(<= main_x 59), 26407#(<= main_x 60), 26408#(<= main_x 61), 26409#(<= main_x 62), 26410#(<= main_x 63), 26411#(<= main_x 64), 26412#(<= main_x 65), 26413#(<= main_x 66), 26414#(<= main_x 67), 26415#(<= main_x 68), 26416#(<= main_x 69), 26417#(<= main_x 70), 26418#(<= main_x 71), 26419#(<= main_x 72), 26420#(<= main_x 73), 26421#(<= main_x 74), 26422#(<= main_x 75), 26423#(<= main_x 76), 26424#(<= main_x 77), 26425#(<= main_x 78), 26426#(<= main_x 79), 26427#(<= main_x 80), 26428#(<= main_x 81), 26429#(<= main_x 82), 26430#(<= main_x 83), 26431#(<= main_x 84), 26432#(<= main_x 85), 26433#(<= main_x 86), 26434#(<= main_x 87), 26435#(<= main_x 88), 26436#(<= main_x 89), 26437#(<= main_x 90), 26438#(<= main_x 91), 26439#(<= main_x 92), 26440#(<= main_x 93), 26441#(<= main_x 94), 26442#(<= main_x 95), 26443#(<= main_x 96), 26444#(<= main_x 97), 26445#(<= main_x 98), 26446#(<= main_x 99), 26345#true, 26346#false, 26347#(<= main_x 0), 26348#(<= main_x 1), 26349#(<= main_x 2), 26350#(<= main_x 3), 26351#(<= main_x 4), 26352#(<= main_x 5), 26353#(<= main_x 6), 26354#(<= main_x 7), 26355#(<= main_x 8), 26356#(<= main_x 9), 26357#(<= main_x 10), 26358#(<= main_x 11), 26359#(<= main_x 12), 26360#(<= main_x 13), 26361#(<= main_x 14), 26362#(<= main_x 15), 26363#(<= main_x 16), 26364#(<= main_x 17), 26365#(<= main_x 18), 26366#(<= main_x 19), 26367#(<= main_x 20)] [2018-07-23 13:51:21,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:21,608 INFO L450 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-23 13:51:21,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-23 13:51:21,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 13:51:21,609 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 102 states. [2018-07-23 13:51:21,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:21,670 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-07-23 13:51:21,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-23 13:51:21,670 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 101 [2018-07-23 13:51:21,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:21,671 INFO L225 Difference]: With dead ends: 104 [2018-07-23 13:51:21,671 INFO L226 Difference]: Without dead ends: 103 [2018-07-23 13:51:21,672 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 13:51:21,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-23 13:51:21,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-23 13:51:21,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-23 13:51:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-23 13:51:21,674 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-07-23 13:51:21,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:21,674 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-23 13:51:21,674 INFO L472 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-23 13:51:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-23 13:51:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-23 13:51:21,675 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:21,675 INFO L357 BasicCegarLoop]: trace histogram [100, 1, 1] [2018-07-23 13:51:21,675 INFO L414 AbstractCegarLoop]: === Iteration 101 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:21,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670535, now seen corresponding path program 100 times [2018-07-23 13:51:21,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:23,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:23,139 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:51:23,140 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-23 13:51:23,140 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:23,140 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-23 13:51:23,141 INFO L185 omatonBuilderFactory]: Interpolants [26880#(and (<= main_y 17) (<= 17 main_y)), 26881#(and (<= 18 main_y) (<= main_y 18)), 26882#(and (<= main_y 19) (<= 19 main_y)), 26883#(and (<= 20 main_y) (<= main_y 20)), 26884#(and (<= 21 main_y) (<= main_y 21)), 26885#(and (<= main_y 22) (<= 22 main_y)), 26886#(and (<= 23 main_y) (<= main_y 23)), 26887#(and (<= 24 main_y) (<= main_y 24)), 26888#(and (<= main_y 25) (<= 25 main_y)), 26889#(and (<= 26 main_y) (<= main_y 26)), 26890#(and (<= main_y 27) (<= 27 main_y)), 26891#(and (<= 28 main_y) (<= main_y 28)), 26892#(and (<= 29 main_y) (<= main_y 29)), 26893#(and (<= 30 main_y) (<= main_y 30)), 26894#(and (<= 31 main_y) (<= main_y 31)), 26895#(and (<= 32 main_y) (<= main_y 32)), 26896#(and (<= main_y 33) (<= 33 main_y)), 26897#(and (<= main_y 34) (<= 34 main_y)), 26898#(and (<= 35 main_y) (<= main_y 35)), 26899#(and (<= main_y 36) (<= 36 main_y)), 26900#(and (<= 37 main_y) (<= main_y 37)), 26901#(and (<= 38 main_y) (<= main_y 38)), 26902#(and (<= 39 main_y) (<= main_y 39)), 26903#(and (<= main_y 40) (<= 40 main_y)), 26904#(and (<= main_y 41) (<= 41 main_y)), 26905#(and (<= main_y 42) (<= 42 main_y)), 26906#(and (<= main_y 43) (<= 43 main_y)), 26907#(and (<= main_y 44) (<= 44 main_y)), 26908#(and (<= 45 main_y) (<= main_y 45)), 26909#(and (<= main_y 46) (<= 46 main_y)), 26910#(and (<= 47 main_y) (<= main_y 47)), 26911#(and (<= main_y 48) (<= 48 main_y)), 26912#(and (<= main_y 49) (<= 49 main_y)), 26913#(and (<= main_y 50) (<= 50 main_y)), 26914#(and (<= 51 main_y) (<= main_y 51)), 26915#(and (<= 52 main_y) (<= main_y 52)), 26916#(and (<= main_y 53) (<= 53 main_y)), 26917#(and (<= 54 main_y) (<= main_y 54)), 26918#(and (<= 55 main_y) (<= main_y 55)), 26919#(and (<= 56 main_y) (<= main_y 56)), 26920#(and (<= 57 main_y) (<= main_y 57)), 26921#(and (<= main_y 58) (<= 58 main_y)), 26922#(and (<= 59 main_y) (<= main_y 59)), 26923#(and (<= main_y 60) (<= 60 main_y)), 26924#(and (<= 61 main_y) (<= main_y 61)), 26925#(and (<= 62 main_y) (<= main_y 62)), 26926#(and (<= 63 main_y) (<= main_y 63)), 26927#(and (<= main_y 64) (<= 64 main_y)), 26928#(and (<= main_y 65) (<= 65 main_y)), 26929#(and (<= main_y 66) (<= 66 main_y)), 26930#(and (<= 67 main_y) (<= main_y 67)), 26931#(and (<= 68 main_y) (<= main_y 68)), 26932#(and (<= 69 main_y) (<= main_y 69)), 26933#(and (<= main_y 70) (<= 70 main_y)), 26934#(and (<= 71 main_y) (<= main_y 71)), 26935#(and (<= 72 main_y) (<= main_y 72)), 26936#(and (<= main_y 73) (<= 73 main_y)), 26937#(and (<= 74 main_y) (<= main_y 74)), 26938#(and (<= main_y 75) (<= 75 main_y)), 26939#(and (<= main_y 76) (<= 76 main_y)), 26940#(and (<= 77 main_y) (<= main_y 77)), 26941#(and (<= main_y 78) (<= 78 main_y)), 26942#(and (<= main_y 79) (<= 79 main_y)), 26943#(and (<= 80 main_y) (<= main_y 80)), 26944#(and (<= main_y 81) (<= 81 main_y)), 26945#(and (<= 82 main_y) (<= main_y 82)), 26946#(and (<= main_y 83) (<= 83 main_y)), 26947#(and (<= 84 main_y) (<= main_y 84)), 26948#(and (<= 85 main_y) (<= main_y 85)), 26949#(and (<= 86 main_y) (<= main_y 86)), 26950#(and (<= 87 main_y) (<= main_y 87)), 26951#(and (<= 88 main_y) (<= main_y 88)), 26952#(and (<= main_y 89) (<= 89 main_y)), 26953#(and (<= main_y 90) (<= 90 main_y)), 26954#(and (<= 91 main_y) (<= main_y 91)), 26955#(and (<= 92 main_y) (<= main_y 92)), 26956#(and (<= main_y 93) (<= 93 main_y)), 26957#(and (<= 94 main_y) (<= main_y 94)), 26958#(and (<= main_y 95) (<= 95 main_y)), 26959#(and (<= main_y 96) (<= 96 main_y)), 26960#(and (<= 97 main_y) (<= main_y 97)), 26961#(and (<= main_y 98) (<= 98 main_y)), 26962#(and (<= main_y 99) (<= 99 main_y)), 26963#(and (<= main_y 100) (< 99 main_y)), 26861#true, 26862#false, 26863#(and (<= 0 main_y) (<= main_y 0)), 26864#(and (<= main_y 1) (<= 1 main_y)), 26865#(and (<= 2 main_y) (<= main_y 2)), 26866#(and (<= main_y 3) (<= 3 main_y)), 26867#(and (<= 4 main_y) (<= main_y 4)), 26868#(and (<= main_y 5) (<= 5 main_y)), 26869#(and (<= 6 main_y) (<= main_y 6)), 26870#(and (<= 7 main_y) (<= main_y 7)), 26871#(and (<= 8 main_y) (<= main_y 8)), 26872#(and (<= 9 main_y) (<= main_y 9)), 26873#(and (<= 10 main_y) (<= main_y 10)), 26874#(and (<= 11 main_y) (<= main_y 11)), 26875#(and (<= 12 main_y) (<= main_y 12)), 26876#(and (<= main_y 13) (<= 13 main_y)), 26877#(and (<= 14 main_y) (<= main_y 14)), 26878#(and (<= 15 main_y) (<= main_y 15)), 26879#(and (<= main_y 16) (<= 16 main_y))] [2018-07-23 13:51:23,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:23,142 INFO L450 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-23 13:51:23,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-23 13:51:23,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:51:23,144 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 103 states. [2018-07-23 13:51:24,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:24,361 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-23 13:51:24,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-23 13:51:24,361 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 102 [2018-07-23 13:51:24,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:24,362 INFO L225 Difference]: With dead ends: 105 [2018-07-23 13:51:24,363 INFO L226 Difference]: Without dead ends: 104 [2018-07-23 13:51:24,364 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:51:24,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-23 13:51:24,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-23 13:51:24,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-23 13:51:24,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-07-23 13:51:24,372 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-07-23 13:51:24,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:24,372 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-07-23 13:51:24,372 INFO L472 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-23 13:51:24,372 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-07-23 13:51:24,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-07-23 13:51:24,373 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:51:24,373 INFO L357 BasicCegarLoop]: trace histogram [101, 1, 1] [2018-07-23 13:51:24,373 INFO L414 AbstractCegarLoop]: === Iteration 102 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:51:24,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080865, now seen corresponding path program 101 times [2018-07-23 13:51:24,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:51:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:51:24,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 5151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:24,962 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:51:24,963 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-07-23 13:51:24,963 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:51:24,963 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-23 13:51:24,964 INFO L185 omatonBuilderFactory]: Interpolants [27392#(<= 8 main_x), 27393#(<= 9 main_x), 27394#(<= 10 main_x), 27395#(<= 11 main_x), 27396#(<= 12 main_x), 27397#(<= 13 main_x), 27398#(<= 14 main_x), 27399#(<= 15 main_x), 27400#(<= 16 main_x), 27401#(<= 17 main_x), 27402#(<= 18 main_x), 27403#(<= 19 main_x), 27404#(<= 20 main_x), 27405#(<= 21 main_x), 27406#(<= 22 main_x), 27407#(<= 23 main_x), 27408#(<= 24 main_x), 27409#(<= 25 main_x), 27410#(<= 26 main_x), 27411#(<= 27 main_x), 27412#(<= 28 main_x), 27413#(<= 29 main_x), 27414#(<= 30 main_x), 27415#(<= 31 main_x), 27416#(<= 32 main_x), 27417#(<= 33 main_x), 27418#(<= 34 main_x), 27419#(<= 35 main_x), 27420#(<= 36 main_x), 27421#(<= 37 main_x), 27422#(<= 38 main_x), 27423#(<= 39 main_x), 27424#(<= 40 main_x), 27425#(<= 41 main_x), 27426#(<= 42 main_x), 27427#(<= 43 main_x), 27428#(<= 44 main_x), 27429#(<= 45 main_x), 27430#(<= 46 main_x), 27431#(<= 47 main_x), 27432#(<= 48 main_x), 27433#(<= 49 main_x), 27434#(<= 50 main_x), 27435#(<= 51 main_x), 27436#(<= 52 main_x), 27437#(<= 53 main_x), 27438#(<= 54 main_x), 27439#(<= 55 main_x), 27440#(<= 56 main_x), 27441#(<= 57 main_x), 27442#(<= 58 main_x), 27443#(<= 59 main_x), 27444#(<= 60 main_x), 27445#(<= 61 main_x), 27446#(<= 62 main_x), 27447#(<= 63 main_x), 27448#(<= 64 main_x), 27449#(<= 65 main_x), 27450#(<= 66 main_x), 27451#(<= 67 main_x), 27452#(<= 68 main_x), 27453#(<= 69 main_x), 27454#(<= 70 main_x), 27455#(<= 71 main_x), 27456#(<= 72 main_x), 27457#(<= 73 main_x), 27458#(<= 74 main_x), 27459#(<= 75 main_x), 27460#(<= 76 main_x), 27461#(<= 77 main_x), 27462#(<= 78 main_x), 27463#(<= 79 main_x), 27464#(<= 80 main_x), 27465#(<= 81 main_x), 27466#(<= 82 main_x), 27467#(<= 83 main_x), 27468#(<= 84 main_x), 27469#(<= 85 main_x), 27470#(<= 86 main_x), 27471#(<= 87 main_x), 27472#(<= 88 main_x), 27473#(<= 89 main_x), 27474#(<= 90 main_x), 27475#(<= 91 main_x), 27476#(<= 92 main_x), 27477#(<= 93 main_x), 27478#(<= 94 main_x), 27479#(<= 95 main_x), 27480#(<= 96 main_x), 27481#(<= 97 main_x), 27482#(<= 98 main_x), 27483#(<= 99 main_x), 27484#(<= 100 main_x), 27485#(<= 101 main_x), 27382#true, 27383#false, 27384#(<= 0 main_x), 27385#(<= 1 main_x), 27386#(<= 2 main_x), 27387#(<= 3 main_x), 27388#(<= 4 main_x), 27389#(<= 5 main_x), 27390#(<= 6 main_x), 27391#(<= 7 main_x)] [2018-07-23 13:51:24,964 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 5151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:51:24,965 INFO L450 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-23 13:51:24,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-23 13:51:24,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 13:51:24,966 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 104 states. [2018-07-23 13:51:25,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:51:25,030 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-07-23 13:51:25,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-23 13:51:25,030 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 103 [2018-07-23 13:51:25,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:51:25,031 INFO L225 Difference]: With dead ends: 104 [2018-07-23 13:51:25,031 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:51:25,032 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 13:51:25,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:51:25,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:51:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:51:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:51:25,033 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2018-07-23 13:51:25,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:51:25,033 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:51:25,034 INFO L472 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-23 13:51:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:51:25,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:51:25,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:51:25,187 WARN L169 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 610 [2018-07-23 13:51:26,012 WARN L169 SmtUtils]: Spent 819.00 ms on a formula simplification that was a NOOP. DAG size: 610 [2018-07-23 13:51:26,024 INFO L424 ceAbstractionStarter]: At program point mainENTRY(lines 17 31) the Hoare annotation is: true [2018-07-23 13:51:26,025 INFO L417 ceAbstractionStarter]: At program point mainErr0AssertViolationASSERT(line 29) the Hoare annotation is: false [2018-07-23 13:51:26,025 INFO L421 ceAbstractionStarter]: For program point mainFINAL(lines 17 31) no Hoare annotation was computed. [2018-07-23 13:51:26,039 INFO L417 ceAbstractionStarter]: At program point L24(lines 24 27) the Hoare annotation is: (or (and (<= 8 main_y) (<= main_y 8) (<= main_x 8) (<= 8 main_x)) (and (<= main_x 49) (<= main_y 49) (<= 49 main_x) (<= 49 main_y)) (and (<= 99 main_x) (<= main_y 99) (<= 99 main_y) (<= main_x 99)) (and (<= 42 main_x) (<= main_y 42) (<= main_x 42) (<= 42 main_y)) (and (<= 9 main_y) (<= 9 main_x) (<= main_x 9) (<= main_y 9)) (and (<= 59 main_x) (<= 59 main_y) (<= main_y 59) (<= main_x 59)) (and (<= 55 main_y) (<= main_y 55) (<= 55 main_x) (<= main_x 55)) (and (<= main_x 97) (<= 97 main_y) (<= main_y 97) (<= 97 main_x)) (and (<= 74 main_x) (<= main_x 74) (<= 74 main_y) (<= main_y 74)) (and (<= 12 main_x) (<= 12 main_y) (<= main_y 12) (<= main_x 12)) (and (<= main_x 65) (<= main_y 65) (<= 65 main_x) (<= 65 main_y)) (and (<= 32 main_x) (<= main_x 32) (<= 32 main_y) (<= main_y 32)) (and (<= main_y 73) (<= main_x 73) (<= 73 main_x) (<= 73 main_y)) (and (<= 6 main_x) (<= main_x 6) (<= 6 main_y) (<= main_y 6)) (and (<= 14 main_x) (<= 14 main_y) (<= main_y 14) (<= main_x 14)) (and (<= main_x 0) (<= 0 main_y) (<= 0 main_x) (<= main_y 0)) (and (<= main_y 44) (<= main_x 44) (<= 44 main_y) (<= 44 main_x)) (and (<= 38 main_x) (<= 38 main_y) (<= main_y 38) (<= main_x 38)) (and (<= 43 main_x) (<= main_x 43) (<= main_y 43) (<= 43 main_y)) (and (<= 21 main_y) (<= 21 main_x) (<= main_x 21) (<= main_y 21)) (and (<= 94 main_x) (<= 94 main_y) (<= main_x 94) (<= main_y 94)) (and (<= 52 main_x) (<= 52 main_y) (<= main_y 52) (<= main_x 52)) (and (<= main_y 46) (<= 46 main_x) (<= main_x 46) (<= 46 main_y)) (and (<= main_x 18) (<= 18 main_y) (<= 18 main_x) (<= main_y 18)) (<= 101 main_x) (and (<= 61 main_y) (<= main_x 61) (<= main_y 61) (<= 61 main_x)) (and (<= 88 main_y) (<= main_y 88) (<= 88 main_x) (<= main_x 88)) (and (<= 80 main_y) (<= main_x 80) (<= main_y 80) (<= 80 main_x)) (and (<= main_x 92) (<= 92 main_y) (<= main_y 92) (<= 92 main_x)) (and (<= 87 main_x) (<= main_x 87) (<= 87 main_y) (<= main_y 87)) (and (<= 35 main_y) (<= main_y 35) (<= main_x 35) (<= 35 main_x)) (and (<= 85 main_x) (<= main_x 85) (<= 85 main_y) (<= main_y 85)) (and (<= 63 main_x) (<= 63 main_y) (<= main_y 63) (<= main_x 63)) (and (<= 15 main_y) (<= main_y 15) (<= 15 main_x) (<= main_x 15)) (and (<= main_y 64) (<= 64 main_x) (<= main_x 64) (<= 64 main_y)) (and (<= 4 main_y) (<= main_y 4) (<= main_x 4) (<= 4 main_x)) (and (<= 47 main_x) (<= 47 main_y) (<= main_y 47) (<= main_x 47)) (and (<= 51 main_y) (<= main_x 51) (<= 51 main_x) (<= main_y 51)) (and (<= 54 main_y) (<= main_y 54) (<= 54 main_x) (<= main_x 54)) (and (<= main_x 33) (<= 33 main_x) (<= main_y 33) (<= 33 main_y)) (and (<= 37 main_x) (<= 37 main_y) (<= main_y 37) (<= main_x 37)) (and (<= 20 main_y) (<= 20 main_x) (<= main_y 20) (<= main_x 20)) (and (<= 26 main_y) (<= main_x 26) (<= 26 main_x) (<= main_y 26)) (and (<= 86 main_x) (<= 86 main_y) (<= main_x 86) (<= main_y 86)) (and (<= main_x 27) (<= main_y 27) (<= 27 main_y) (<= 27 main_x)) (and (<= main_y 95) (<= 95 main_x) (<= 95 main_y) (<= main_x 95)) (and (<= 1 main_x) (<= main_x 1) (<= main_y 1) (<= 1 main_y)) (and (<= main_x 56) (<= 56 main_x) (<= 56 main_y) (<= main_y 56)) (and (<= main_y 75) (<= main_x 75) (<= 75 main_y) (<= 75 main_x)) (and (<= main_x 62) (<= 62 main_x) (<= 62 main_y) (<= main_y 62)) (and (<= 68 main_y) (<= main_x 68) (<= main_y 68) (<= 68 main_x)) (and (<= main_y 78) (<= 78 main_x) (<= 78 main_y) (<= main_x 78)) (and (<= main_y 3) (<= 3 main_y) (<= 3 main_x) (<= main_x 3)) (and (<= main_x 25) (<= main_y 25) (<= 25 main_x) (<= 25 main_y)) (and (<= main_x 36) (<= main_y 36) (<= 36 main_x) (<= 36 main_y)) (and (<= 57 main_y) (<= main_x 57) (<= main_y 57) (<= 57 main_x)) (and (<= 5 main_x) (<= main_x 5) (<= main_y 5) (<= 5 main_y)) (and (<= 82 main_x) (<= 82 main_y) (<= main_x 82) (<= main_y 82)) (and (<= main_y 17) (<= 17 main_y) (<= 17 main_x) (<= main_x 17)) (and (<= main_y 83) (<= 83 main_x) (<= main_x 83) (<= 83 main_y)) (and (<= 77 main_x) (<= 77 main_y) (<= main_x 77) (<= main_y 77)) (and (<= 31 main_x) (<= 31 main_y) (<= main_y 31) (<= main_x 31)) (and (<= main_y 98) (<= main_x 98) (<= 98 main_y) (<= 98 main_x)) (and (<= 71 main_y) (<= 71 main_x) (<= main_y 71) (<= main_x 71)) (and (<= main_y 41) (<= 41 main_x) (<= 41 main_y) (<= main_x 41)) (and (<= 30 main_x) (<= 30 main_y) (<= main_x 30) (<= main_y 30)) (and (<= 24 main_y) (<= main_x 24) (<= main_y 24) (<= 24 main_x)) (and (<= main_y 50) (<= 50 main_y) (<= main_x 50) (<= 50 main_x)) (and (<= 84 main_y) (<= main_y 84) (<= main_x 84) (<= 84 main_x)) (and (<= main_y 93) (<= 93 main_y) (<= 93 main_x) (<= main_x 93)) (and (<= main_y 60) (<= main_x 60) (<= 60 main_y) (<= 60 main_x)) (and (<= 29 main_y) (<= main_x 29) (<= 29 main_x) (<= main_y 29)) (and (<= main_y 40) (<= main_x 40) (<= 40 main_y) (<= 40 main_x)) (and (<= main_y 53) (<= 53 main_y) (<= main_x 53) (<= 53 main_x)) (and (<= main_y 58) (<= 58 main_y) (<= 58 main_x) (<= main_x 58)) (and (<= 67 main_x) (<= 67 main_y) (<= main_y 67) (<= main_x 67)) (and (<= main_y 22) (<= main_x 22) (<= 22 main_x) (<= 22 main_y)) (and (<= 39 main_y) (<= 39 main_x) (<= main_x 39) (<= main_y 39)) (and (<= 13 main_x) (<= main_x 13) (<= main_y 13) (<= 13 main_y)) (and (<= main_y 79) (<= 79 main_x) (<= main_x 79) (<= 79 main_y)) (and (<= 69 main_x) (<= main_x 69) (<= 69 main_y) (<= main_y 69)) (and (<= 81 main_x) (<= main_y 81) (<= main_x 81) (<= 81 main_y)) (and (<= 28 main_y) (<= main_x 28) (<= 28 main_x) (<= main_y 28)) (and (<= main_x 91) (<= 91 main_y) (<= 91 main_x) (<= main_y 91)) (and (<= main_y 66) (<= main_x 66) (<= 66 main_x) (<= 66 main_y)) (and (<= 34 main_x) (<= main_y 34) (<= main_x 34) (<= 34 main_y)) (and (<= 89 main_x) (<= main_y 89) (<= main_x 89) (<= 89 main_y)) (and (<= 10 main_y) (<= main_x 10) (<= main_y 10) (<= 10 main_x)) (and (<= main_x 16) (<= main_y 16) (<= 16 main_x) (<= 16 main_y)) (and (<= 100 main_x) (<= main_y 100) (< 99 main_y)) (and (<= 2 main_y) (<= 2 main_x) (<= main_y 2) (<= main_x 2)) (and (<= main_x 7) (<= 7 main_y) (<= 7 main_x) (<= main_y 7)) (and (<= main_x 72) (<= 72 main_x) (<= 72 main_y) (<= main_y 72)) (and (<= 48 main_x) (<= main_x 48) (<= main_y 48) (<= 48 main_y)) (and (<= main_y 76) (<= main_x 76) (<= 76 main_y) (<= 76 main_x)) (and (<= 96 main_x) (<= main_y 96) (<= 96 main_y) (<= main_x 96)) (and (<= 45 main_x) (<= 45 main_y) (<= main_y 45) (<= main_x 45)) (and (<= 11 main_x) (<= main_x 11) (<= 11 main_y) (<= main_y 11)) (and (<= 90 main_x) (<= main_y 90) (<= 90 main_y) (<= main_x 90)) (and (<= main_x 19) (<= main_y 19) (<= 19 main_x) (<= 19 main_y)) (and (<= main_x 70) (<= main_y 70) (<= 70 main_x) (<= 70 main_y)) (and (<= 23 main_x) (<= 23 main_y) (<= main_y 23) (<= main_x 23))) [2018-07-23 13:51:26,039 INFO L424 ceAbstractionStarter]: At program point mainEXIT(lines 17 31) the Hoare annotation is: true [2018-07-23 13:51:26,085 INFO L202 PluginConnector]: Adding new model HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:51:26 BoogieIcfgContainer [2018-07-23 13:51:26,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:51:26,086 INFO L168 Benchmark]: Toolchain (without parser) took 27373.05 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 912.8 MB). Free memory was 1.5 GB in the beginning and 974.5 MB in the end (delta: 493.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-07-23 13:51:26,088 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-23 13:51:26,088 INFO L168 Benchmark]: Boogie Preprocessor took 53.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:51:26,088 INFO L168 Benchmark]: RCFGBuilder took 225.62 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-23 13:51:26,089 INFO L168 Benchmark]: TraceAbstraction took 27089.89 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 912.8 MB). Free memory was 1.5 GB in the beginning and 974.5 MB in the end (delta: 483.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-07-23 13:51:26,092 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 Preprocessor took 53.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 225.62 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 27089.89 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 912.8 MB). Free memory was 1.5 GB in the beginning and 974.5 MB in the end (delta: 483.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 29]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((8 <= y && y <= 8) && x <= 8) && 8 <= x) || (((x <= 49 && y <= 49) && 49 <= x) && 49 <= y)) || (((99 <= x && y <= 99) && 99 <= y) && x <= 99)) || (((42 <= x && y <= 42) && x <= 42) && 42 <= y)) || (((9 <= y && 9 <= x) && x <= 9) && y <= 9)) || (((59 <= x && 59 <= y) && y <= 59) && x <= 59)) || (((55 <= y && y <= 55) && 55 <= x) && x <= 55)) || (((x <= 97 && 97 <= y) && y <= 97) && 97 <= x)) || (((74 <= x && x <= 74) && 74 <= y) && y <= 74)) || (((12 <= x && 12 <= y) && y <= 12) && x <= 12)) || (((x <= 65 && y <= 65) && 65 <= x) && 65 <= y)) || (((32 <= x && x <= 32) && 32 <= y) && y <= 32)) || (((y <= 73 && x <= 73) && 73 <= x) && 73 <= y)) || (((6 <= x && x <= 6) && 6 <= y) && y <= 6)) || (((14 <= x && 14 <= y) && y <= 14) && x <= 14)) || (((x <= 0 && 0 <= y) && 0 <= x) && y <= 0)) || (((y <= 44 && x <= 44) && 44 <= y) && 44 <= x)) || (((38 <= x && 38 <= y) && y <= 38) && x <= 38)) || (((43 <= x && x <= 43) && y <= 43) && 43 <= y)) || (((21 <= y && 21 <= x) && x <= 21) && y <= 21)) || (((94 <= x && 94 <= y) && x <= 94) && y <= 94)) || (((52 <= x && 52 <= y) && y <= 52) && x <= 52)) || (((y <= 46 && 46 <= x) && x <= 46) && 46 <= y)) || (((x <= 18 && 18 <= y) && 18 <= x) && y <= 18)) || 101 <= x) || (((61 <= y && x <= 61) && y <= 61) && 61 <= x)) || (((88 <= y && y <= 88) && 88 <= x) && x <= 88)) || (((80 <= y && x <= 80) && y <= 80) && 80 <= x)) || (((x <= 92 && 92 <= y) && y <= 92) && 92 <= x)) || (((87 <= x && x <= 87) && 87 <= y) && y <= 87)) || (((35 <= y && y <= 35) && x <= 35) && 35 <= x)) || (((85 <= x && x <= 85) && 85 <= y) && y <= 85)) || (((63 <= x && 63 <= y) && y <= 63) && x <= 63)) || (((15 <= y && y <= 15) && 15 <= x) && x <= 15)) || (((y <= 64 && 64 <= x) && x <= 64) && 64 <= y)) || (((4 <= y && y <= 4) && x <= 4) && 4 <= x)) || (((47 <= x && 47 <= y) && y <= 47) && x <= 47)) || (((51 <= y && x <= 51) && 51 <= x) && y <= 51)) || (((54 <= y && y <= 54) && 54 <= x) && x <= 54)) || (((x <= 33 && 33 <= x) && y <= 33) && 33 <= y)) || (((37 <= x && 37 <= y) && y <= 37) && x <= 37)) || (((20 <= y && 20 <= x) && y <= 20) && x <= 20)) || (((26 <= y && x <= 26) && 26 <= x) && y <= 26)) || (((86 <= x && 86 <= y) && x <= 86) && y <= 86)) || (((x <= 27 && y <= 27) && 27 <= y) && 27 <= x)) || (((y <= 95 && 95 <= x) && 95 <= y) && x <= 95)) || (((1 <= x && x <= 1) && y <= 1) && 1 <= y)) || (((x <= 56 && 56 <= x) && 56 <= y) && y <= 56)) || (((y <= 75 && x <= 75) && 75 <= y) && 75 <= x)) || (((x <= 62 && 62 <= x) && 62 <= y) && y <= 62)) || (((68 <= y && x <= 68) && y <= 68) && 68 <= x)) || (((y <= 78 && 78 <= x) && 78 <= y) && x <= 78)) || (((y <= 3 && 3 <= y) && 3 <= x) && x <= 3)) || (((x <= 25 && y <= 25) && 25 <= x) && 25 <= y)) || (((x <= 36 && y <= 36) && 36 <= x) && 36 <= y)) || (((57 <= y && x <= 57) && y <= 57) && 57 <= x)) || (((5 <= x && x <= 5) && y <= 5) && 5 <= y)) || (((82 <= x && 82 <= y) && x <= 82) && y <= 82)) || (((y <= 17 && 17 <= y) && 17 <= x) && x <= 17)) || (((y <= 83 && 83 <= x) && x <= 83) && 83 <= y)) || (((77 <= x && 77 <= y) && x <= 77) && y <= 77)) || (((31 <= x && 31 <= y) && y <= 31) && x <= 31)) || (((y <= 98 && x <= 98) && 98 <= y) && 98 <= x)) || (((71 <= y && 71 <= x) && y <= 71) && x <= 71)) || (((y <= 41 && 41 <= x) && 41 <= y) && x <= 41)) || (((30 <= x && 30 <= y) && x <= 30) && y <= 30)) || (((24 <= y && x <= 24) && y <= 24) && 24 <= x)) || (((y <= 50 && 50 <= y) && x <= 50) && 50 <= x)) || (((84 <= y && y <= 84) && x <= 84) && 84 <= x)) || (((y <= 93 && 93 <= y) && 93 <= x) && x <= 93)) || (((y <= 60 && x <= 60) && 60 <= y) && 60 <= x)) || (((29 <= y && x <= 29) && 29 <= x) && y <= 29)) || (((y <= 40 && x <= 40) && 40 <= y) && 40 <= x)) || (((y <= 53 && 53 <= y) && x <= 53) && 53 <= x)) || (((y <= 58 && 58 <= y) && 58 <= x) && x <= 58)) || (((67 <= x && 67 <= y) && y <= 67) && x <= 67)) || (((y <= 22 && x <= 22) && 22 <= x) && 22 <= y)) || (((39 <= y && 39 <= x) && x <= 39) && y <= 39)) || (((13 <= x && x <= 13) && y <= 13) && 13 <= y)) || (((y <= 79 && 79 <= x) && x <= 79) && 79 <= y)) || (((69 <= x && x <= 69) && 69 <= y) && y <= 69)) || (((81 <= x && y <= 81) && x <= 81) && 81 <= y)) || (((28 <= y && x <= 28) && 28 <= x) && y <= 28)) || (((x <= 91 && 91 <= y) && 91 <= x) && y <= 91)) || (((y <= 66 && x <= 66) && 66 <= x) && 66 <= y)) || (((34 <= x && y <= 34) && x <= 34) && 34 <= y)) || (((89 <= x && y <= 89) && x <= 89) && 89 <= y)) || (((10 <= y && x <= 10) && y <= 10) && 10 <= x)) || (((x <= 16 && y <= 16) && 16 <= x) && 16 <= y)) || ((100 <= x && y <= 100) && 99 < y)) || (((2 <= y && 2 <= x) && y <= 2) && x <= 2)) || (((x <= 7 && 7 <= y) && 7 <= x) && y <= 7)) || (((x <= 72 && 72 <= x) && 72 <= y) && y <= 72)) || (((48 <= x && x <= 48) && y <= 48) && 48 <= y)) || (((y <= 76 && x <= 76) && 76 <= y) && 76 <= x)) || (((96 <= x && y <= 96) && 96 <= y) && x <= 96)) || (((45 <= x && 45 <= y) && y <= 45) && x <= 45)) || (((11 <= x && x <= 11) && 11 <= y) && y <= 11)) || (((90 <= x && y <= 90) && 90 <= y) && x <= 90)) || (((x <= 19 && y <= 19) && 19 <= x) && 19 <= y)) || (((x <= 70 && y <= 70) && 70 <= x) && 70 <= y)) || (((23 <= x && 23 <= y) && y <= 23) && x <= 23) - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: true - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. SAFE Result, 26.9s OverallTime, 102 OverallIterations, 101 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 203 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 19439 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5253 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4s Time, 0.1s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 5151/176851 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 102 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 106 NumberOfFragments, 1317 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 5355 NumberOfCodeBlocks, 5355 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 5253 ConstructedInterpolants, 0 QuantifiedInterpolants, 1117669 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 102 InterpolantComputations, 2 PerfectInterpolantSequences, 5151/176851 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/HiddenEquality-Safe.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-51-26-103.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/HiddenEquality-Safe.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-51-26-103.csv Received shutdown request...