java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/RailwayCrossing.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:06:03,893 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:06:03,895 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:06:03,907 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:06:03,907 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:06:03,908 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:06:03,909 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:06:03,911 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:06:03,913 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:06:03,914 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:06:03,915 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:06:03,915 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:06:03,916 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:06:03,917 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:06:03,918 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:06:03,919 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:06:03,920 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:06:03,922 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:06:03,924 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:06:03,925 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:06:03,927 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:06:03,928 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:06:03,931 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:06:03,931 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:06:03,931 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:06:03,932 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:06:03,933 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:06:03,934 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:06:03,935 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:06:03,936 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:06:03,937 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:06:03,938 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:06:03,938 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:06:03,938 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:06:03,939 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:06:03,940 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:06:03,940 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:06:03,948 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:06:03,949 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:06:03,950 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:06:03,950 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:06:03,951 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:06:03,951 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:06:03,951 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:06:03,951 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:06:04,007 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:06:04,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:06:04,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:06:04,025 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:06:04,026 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:06:04,027 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/RailwayCrossing.bpl [2018-09-26 08:06:04,027 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/RailwayCrossing.bpl' [2018-09-26 08:06:04,075 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:06:04,078 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:06:04,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:04,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:06:04,079 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:06:04,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,112 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,116 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:06:04,117 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:06:04,117 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:06:04,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:04,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:06:04,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:06:04,120 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:06:04,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:06:04,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:06:04,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:06:04,143 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:06:04,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,233 INFO L124 BoogieDeclarations]: Specification and implementation of procedure GateController given in one single declaration [2018-09-26 08:06:04,233 INFO L130 BoogieDeclarations]: Found specification of procedure GateController [2018-09-26 08:06:04,233 INFO L138 BoogieDeclarations]: Found implementation of procedure GateController [2018-09-26 08:06:04,444 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:06:04,444 INFO L202 PluginConnector]: Adding new model RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:04 BoogieIcfgContainer [2018-09-26 08:06:04,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:06:04,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:06:04,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:06:04,450 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:06:04,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/2) ... [2018-09-26 08:06:04,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da09649 and model type RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:06:04, skipping insertion in model container [2018-09-26 08:06:04,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:04" (2/2) ... [2018-09-26 08:06:04,455 INFO L112 eAbstractionObserver]: Analyzing ICFG RailwayCrossing.bpl [2018-09-26 08:06:04,466 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:06:04,478 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:06:04,533 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:06:04,534 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:06:04,535 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:06:04,535 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:06:04,535 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:06:04,535 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:06:04,536 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:06:04,536 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:06:04,536 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:06:04,552 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-09-26 08:06:04,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 08:06:04,561 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:04,563 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 08:06:04,564 INFO L423 AbstractCegarLoop]: === Iteration 1 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:04,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:04,571 INFO L82 PathProgramCache]: Analyzing trace with hash 30496, now seen corresponding path program 1 times [2018-09-26 08:06:04,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:04,665 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:04,665 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:06:04,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:06:04,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:06:04,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:06:04,686 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-09-26 08:06:04,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:04,715 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 08:06:04,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:06:04,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-26 08:06:04,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:04,731 INFO L225 Difference]: With dead ends: 9 [2018-09-26 08:06:04,732 INFO L226 Difference]: Without dead ends: 5 [2018-09-26 08:06:04,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:06:04,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-09-26 08:06:04,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-09-26 08:06:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-09-26 08:06:04,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-26 08:06:04,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-09-26 08:06:04,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:04,777 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-09-26 08:06:04,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:06:04,778 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-26 08:06:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:06:04,778 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:04,779 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:06:04,779 INFO L423 AbstractCegarLoop]: === Iteration 2 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:04,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:04,780 INFO L82 PathProgramCache]: Analyzing trace with hash 955939, now seen corresponding path program 1 times [2018-09-26 08:06:04,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:04,821 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:04,821 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:06:04,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:06:04,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:06:04,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:06:04,828 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-09-26 08:06:04,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:04,857 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-09-26 08:06:04,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:06:04,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-26 08:06:04,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:04,859 INFO L225 Difference]: With dead ends: 8 [2018-09-26 08:06:04,859 INFO L226 Difference]: Without dead ends: 6 [2018-09-26 08:06:04,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:06:04,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-26 08:06:04,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-26 08:06:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 08:06:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-26 08:06:04,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-09-26 08:06:04,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:04,865 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-26 08:06:04,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:06:04,866 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-26 08:06:04,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:06:04,866 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:04,866 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-26 08:06:04,867 INFO L423 AbstractCegarLoop]: === Iteration 3 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:04,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:04,867 INFO L82 PathProgramCache]: Analyzing trace with hash 29644672, now seen corresponding path program 2 times [2018-09-26 08:06:04,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:04,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:04,915 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:04,918 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:06:04,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:06:04,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:06:04,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:04,919 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-09-26 08:06:04,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:04,958 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 08:06:04,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:06:04,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-26 08:06:04,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:04,959 INFO L225 Difference]: With dead ends: 9 [2018-09-26 08:06:04,960 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:06:04,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:04,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:06:04,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:06:04,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:06:04,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:06:04,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-09-26 08:06:04,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:04,966 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:06:04,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:06:04,967 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:06:04,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:04,968 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:04,968 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-09-26 08:06:04,968 INFO L423 AbstractCegarLoop]: === Iteration 4 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:04,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:04,969 INFO L82 PathProgramCache]: Analyzing trace with hash 918995395, now seen corresponding path program 3 times [2018-09-26 08:06:04,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:05,049 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:06:05,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:05,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:05,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:05,057 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-09-26 08:06:05,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,087 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-26 08:06:05,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:06:05,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-09-26 08:06:05,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,089 INFO L225 Difference]: With dead ends: 10 [2018-09-26 08:06:05,090 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:06:05,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:05,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:06:05,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:06:05,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:06:05,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 08:06:05,098 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-09-26 08:06:05,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,098 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 08:06:05,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:05,098 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 08:06:05,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:06:05,099 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,099 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-09-26 08:06:05,102 INFO L423 AbstractCegarLoop]: === Iteration 5 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1575903264, now seen corresponding path program 4 times [2018-09-26 08:06:05,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:05,152 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,152 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:05,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:05,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:05,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:05,153 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-09-26 08:06:05,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,173 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:06:05,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:06:05,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-09-26 08:06:05,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,174 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:06:05,174 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:06:05,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:05,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:06:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:06:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:06:05,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:06:05,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-09-26 08:06:05,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,181 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:06:05,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:05,185 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:06:05,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:05,185 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,185 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-09-26 08:06:05,186 INFO L423 AbstractCegarLoop]: === Iteration 6 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1608350365, now seen corresponding path program 5 times [2018-09-26 08:06:05,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,253 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:05,253 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,253 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:05,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:05,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:05,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:05,255 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-09-26 08:06:05,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,271 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-26 08:06:05,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:06:05,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:06:05,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,274 INFO L225 Difference]: With dead ends: 12 [2018-09-26 08:06:05,274 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:06:05,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:05,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:06:05,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-26 08:06:05,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 08:06:05,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-26 08:06:05,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-09-26 08:06:05,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,279 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-26 08:06:05,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:05,279 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-26 08:06:05,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:06:05,280 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,280 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-09-26 08:06:05,280 INFO L423 AbstractCegarLoop]: === Iteration 7 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1680756800, now seen corresponding path program 6 times [2018-09-26 08:06:05,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,376 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:05,376 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,376 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:05,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:05,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:05,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:05,377 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-09-26 08:06:05,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,391 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:06:05,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:06:05,391 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-26 08:06:05,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,392 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:06:05,392 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:06:05,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:05,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:06:05,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:06:05,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:06:05,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:06:05,396 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-09-26 08:06:05,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,397 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:06:05,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:05,397 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:06:05,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:06:05,398 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,398 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-09-26 08:06:05,398 INFO L423 AbstractCegarLoop]: === Iteration 8 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,399 INFO L82 PathProgramCache]: Analyzing trace with hash 563863811, now seen corresponding path program 7 times [2018-09-26 08:06:05,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,454 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:05,455 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,455 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:06:05,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:06:05,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:06:05,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:05,457 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-09-26 08:06:05,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,486 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-26 08:06:05,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:05,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-09-26 08:06:05,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,487 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:06:05,487 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:06:05,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:05,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:06:05,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 08:06:05,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:06:05,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-26 08:06:05,493 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-26 08:06:05,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,494 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-26 08:06:05,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:06:05,494 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-26 08:06:05,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:06:05,495 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,495 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-09-26 08:06:05,495 INFO L423 AbstractCegarLoop]: === Iteration 9 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,499 INFO L82 PathProgramCache]: Analyzing trace with hash 299919520, now seen corresponding path program 8 times [2018-09-26 08:06:05,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:05,598 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,598 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:06:05,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:06:05,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:06:05,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:05,603 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-09-26 08:06:05,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,636 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:06:05,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:05,637 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-09-26 08:06:05,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,638 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:06:05,638 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:06:05,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:05,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:06:05,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:06:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:06:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:06:05,652 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-09-26 08:06:05,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,653 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:06:05,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:06:05,653 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:06:05,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:05,654 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,654 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-09-26 08:06:05,654 INFO L423 AbstractCegarLoop]: === Iteration 10 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,655 INFO L82 PathProgramCache]: Analyzing trace with hash 707581091, now seen corresponding path program 9 times [2018-09-26 08:06:05,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:05,729 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,729 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:06:05,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:06:05,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:06:05,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:06:05,730 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-09-26 08:06:05,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,758 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-26 08:06:05,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:05,759 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-09-26 08:06:05,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,759 INFO L225 Difference]: With dead ends: 16 [2018-09-26 08:06:05,761 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:06:05,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:06:05,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:06:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-26 08:06:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:06:05,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-26 08:06:05,766 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-09-26 08:06:05,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,766 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-26 08:06:05,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:06:05,767 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-26 08:06:05,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:05,767 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,767 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-09-26 08:06:05,768 INFO L423 AbstractCegarLoop]: === Iteration 11 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,768 INFO L82 PathProgramCache]: Analyzing trace with hash 460187904, now seen corresponding path program 10 times [2018-09-26 08:06:05,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,828 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:05,828 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,828 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:06:05,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:06:05,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:06:05,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:06:05,830 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-09-26 08:06:05,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,844 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:06:05,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:05,845 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-09-26 08:06:05,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,845 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:06:05,845 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:06:05,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:06:05,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:06:05,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:06:05,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:06:05,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:06:05,850 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-09-26 08:06:05,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,851 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:06:05,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:06:05,851 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:06:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:06:05,852 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,852 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-09-26 08:06:05,852 INFO L423 AbstractCegarLoop]: === Iteration 12 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1380933699, now seen corresponding path program 11 times [2018-09-26 08:06:05,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,928 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:05,928 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:06:05,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:06:05,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:06:05,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:05,931 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-09-26 08:06:05,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,955 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-26 08:06:05,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:06:05,956 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-09-26 08:06:05,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,957 INFO L225 Difference]: With dead ends: 18 [2018-09-26 08:06:05,957 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:06:05,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:05,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:06:05,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:06:05,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:06:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-26 08:06:05,962 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-09-26 08:06:05,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,963 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-26 08:06:05,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:06:05,963 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-26 08:06:05,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:05,965 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,965 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-09-26 08:06:05,965 INFO L423 AbstractCegarLoop]: === Iteration 13 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,966 INFO L82 PathProgramCache]: Analyzing trace with hash -140717728, now seen corresponding path program 12 times [2018-09-26 08:06:05,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:06,049 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:06,049 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:06:06,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:06:06,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:06:06,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:06,051 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-09-26 08:06:06,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:06,067 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 08:06:06,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:06,067 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-26 08:06:06,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:06,068 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:06:06,068 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:06:06,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:06:06,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:06:06,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:06:06,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:06:06,073 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-09-26 08:06:06,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:06,074 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:06:06,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:06:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:06:06,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:06:06,075 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:06,075 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-09-26 08:06:06,075 INFO L423 AbstractCegarLoop]: === Iteration 14 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:06,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:06,076 INFO L82 PathProgramCache]: Analyzing trace with hash -67271709, now seen corresponding path program 13 times [2018-09-26 08:06:06,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:06,156 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:06,156 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:06,157 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:06:06,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:06:06,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:06:06,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:06,158 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-09-26 08:06:06,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:06,175 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-26 08:06:06,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:06:06,175 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-09-26 08:06:06,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:06,176 INFO L225 Difference]: With dead ends: 20 [2018-09-26 08:06:06,176 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 08:06:06,177 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:06,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 08:06:06,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-26 08:06:06,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-26 08:06:06,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-26 08:06:06,184 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-09-26 08:06:06,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:06,185 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-26 08:06:06,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:06:06,185 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-26 08:06:06,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:06:06,186 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:06,186 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-09-26 08:06:06,187 INFO L423 AbstractCegarLoop]: === Iteration 15 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:06,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:06,187 INFO L82 PathProgramCache]: Analyzing trace with hash -2085412416, now seen corresponding path program 14 times [2018-09-26 08:06:06,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:06,277 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:06,278 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:06,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:06:06,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:06:06,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:06:06,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:06,279 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-09-26 08:06:06,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:06,303 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-26 08:06:06,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:06:06,303 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-09-26 08:06:06,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:06,304 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:06:06,304 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:06:06,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:06:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:06:06,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:06:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-26 08:06:06,311 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-09-26 08:06:06,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:06,312 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-26 08:06:06,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:06:06,312 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-26 08:06:06,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:06:06,315 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:06,315 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-09-26 08:06:06,315 INFO L423 AbstractCegarLoop]: === Iteration 16 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:06,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:06,317 INFO L82 PathProgramCache]: Analyzing trace with hash -223264893, now seen corresponding path program 15 times [2018-09-26 08:06:06,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:06,412 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:06,412 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:06:06,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:06:06,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:06:06,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:06:06,417 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-09-26 08:06:06,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:06,443 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-26 08:06:06,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:06:06,443 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-26 08:06:06,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:06,444 INFO L225 Difference]: With dead ends: 22 [2018-09-26 08:06:06,446 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 08:06:06,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:06:06,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 08:06:06,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-26 08:06:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 08:06:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-26 08:06:06,450 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-09-26 08:06:06,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:06,454 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-26 08:06:06,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:06:06,455 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-26 08:06:06,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:06:06,455 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:06,456 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-09-26 08:06:06,456 INFO L423 AbstractCegarLoop]: === Iteration 17 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:06,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:06,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1668733472, now seen corresponding path program 16 times [2018-09-26 08:06:06,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:06,562 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:06,562 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:06,563 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:06:06,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:06:06,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:06:06,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:06,564 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-09-26 08:06:06,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:06,580 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 08:06:06,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:06:06,581 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-09-26 08:06:06,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:06,581 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:06:06,582 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:06:06,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:06,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:06:06,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:06:06,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:06:06,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 08:06:06,587 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-09-26 08:06:06,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:06,587 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 08:06:06,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:06:06,587 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 08:06:06,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:06:06,588 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:06,588 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-09-26 08:06:06,589 INFO L423 AbstractCegarLoop]: === Iteration 18 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:06,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:06,589 INFO L82 PathProgramCache]: Analyzing trace with hash 191140643, now seen corresponding path program 17 times [2018-09-26 08:06:06,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:06,696 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:06,696 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:06,696 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:06:06,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:06:06,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:06:06,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:06:06,698 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-09-26 08:06:06,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:06,724 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-26 08:06:06,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:06:06,725 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-09-26 08:06:06,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:06,726 INFO L225 Difference]: With dead ends: 24 [2018-09-26 08:06:06,726 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 08:06:06,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:06:06,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 08:06:06,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-26 08:06:06,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:06:06,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-26 08:06:06,736 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-09-26 08:06:06,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:06,736 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-26 08:06:06,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:06:06,739 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-26 08:06:06,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:06:06,740 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:06,740 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-09-26 08:06:06,741 INFO L423 AbstractCegarLoop]: === Iteration 19 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:06,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:06,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1630403200, now seen corresponding path program 18 times [2018-09-26 08:06:06,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:06,902 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:06,902 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:06:06,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:06:06,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:06:06,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:06:06,905 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-09-26 08:06:06,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:06,925 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-26 08:06:06,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:06:06,925 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-09-26 08:06:06,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:06,926 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:06:06,926 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:06:06,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:06:06,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:06:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:06:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:06:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:06:06,934 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-09-26 08:06:06,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:06,935 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:06:06,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:06:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:06:06,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:06:06,936 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:06,936 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-09-26 08:06:06,936 INFO L423 AbstractCegarLoop]: === Iteration 20 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:06,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:06,937 INFO L82 PathProgramCache]: Analyzing trace with hash -997097789, now seen corresponding path program 19 times [2018-09-26 08:06:06,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:07,057 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:07,057 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:07,058 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:06:07,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:06:07,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:06:07,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:06:07,060 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-09-26 08:06:07,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:07,082 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-26 08:06:07,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:06:07,083 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-09-26 08:06:07,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:07,083 INFO L225 Difference]: With dead ends: 26 [2018-09-26 08:06:07,083 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 08:06:07,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:06:07,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 08:06:07,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-26 08:06:07,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 08:06:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-26 08:06:07,091 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-09-26 08:06:07,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:07,092 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-26 08:06:07,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:06:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-26 08:06:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:06:07,093 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:07,094 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-09-26 08:06:07,094 INFO L423 AbstractCegarLoop]: === Iteration 21 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:07,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:07,097 INFO L82 PathProgramCache]: Analyzing trace with hash -845249824, now seen corresponding path program 20 times [2018-09-26 08:06:07,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:07,259 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:07,260 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:07,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:06:07,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:06:07,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:06:07,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:06:07,264 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-09-26 08:06:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:07,294 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-26 08:06:07,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:06:07,294 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-09-26 08:06:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:07,295 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:06:07,296 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:06:07,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:06:07,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:06:07,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:06:07,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:06:07,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 08:06:07,307 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-09-26 08:06:07,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:07,308 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 08:06:07,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:06:07,308 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 08:06:07,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:06:07,309 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:07,309 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-09-26 08:06:07,309 INFO L423 AbstractCegarLoop]: === Iteration 22 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:07,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:07,310 INFO L82 PathProgramCache]: Analyzing trace with hash -432930205, now seen corresponding path program 21 times [2018-09-26 08:06:07,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:07,463 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:07,464 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:06:07,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:06:07,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:06:07,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:06:07,466 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-09-26 08:06:07,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:07,497 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-26 08:06:07,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:06:07,497 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-09-26 08:06:07,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:07,498 INFO L225 Difference]: With dead ends: 28 [2018-09-26 08:06:07,498 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 08:06:07,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:06:07,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 08:06:07,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-26 08:06:07,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 08:06:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-26 08:06:07,508 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-09-26 08:06:07,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:07,509 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-26 08:06:07,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:06:07,509 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-26 08:06:07,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:06:07,510 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:07,510 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-09-26 08:06:07,510 INFO L423 AbstractCegarLoop]: === Iteration 23 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:07,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:07,511 INFO L82 PathProgramCache]: Analyzing trace with hash -535923904, now seen corresponding path program 22 times [2018-09-26 08:06:07,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:07,650 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:07,650 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:06:07,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:06:07,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:06:07,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:06:07,652 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-09-26 08:06:07,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:07,683 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-26 08:06:07,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:06:07,684 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-09-26 08:06:07,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:07,684 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:06:07,684 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:06:07,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:06:07,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:06:07,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:06:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:06:07,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-26 08:06:07,691 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-09-26 08:06:07,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:07,692 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-26 08:06:07,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:06:07,692 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-26 08:06:07,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:06:07,693 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:07,693 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-09-26 08:06:07,693 INFO L423 AbstractCegarLoop]: === Iteration 24 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:07,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:07,694 INFO L82 PathProgramCache]: Analyzing trace with hash 566238723, now seen corresponding path program 23 times [2018-09-26 08:06:07,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:07,852 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:07,852 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:06:07,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:06:07,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:06:07,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:06:07,854 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-09-26 08:06:07,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:07,878 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-26 08:06:07,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:06:07,878 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-09-26 08:06:07,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:07,879 INFO L225 Difference]: With dead ends: 30 [2018-09-26 08:06:07,879 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 08:06:07,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 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-09-26 08:06:07,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 08:06:07,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-09-26 08:06:07,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-26 08:06:07,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-09-26 08:06:07,890 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-09-26 08:06:07,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:07,890 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-09-26 08:06:07,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:06:07,891 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-09-26 08:06:07,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-26 08:06:07,893 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:07,894 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-09-26 08:06:07,894 INFO L423 AbstractCegarLoop]: === Iteration 25 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:07,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:07,894 INFO L82 PathProgramCache]: Analyzing trace with hash 373541792, now seen corresponding path program 24 times [2018-09-26 08:06:07,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:08,051 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:08,051 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:08,052 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:06:08,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:06:08,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:06:08,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:06:08,053 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-09-26 08:06:08,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:08,077 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 08:06:08,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:06:08,078 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-09-26 08:06:08,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:08,078 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:06:08,079 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:06:08,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:06:08,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:06:08,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:06:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:06:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:06:08,084 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-09-26 08:06:08,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:08,084 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:06:08,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:06:08,085 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:06:08,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:06:08,085 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:08,086 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-09-26 08:06:08,086 INFO L423 AbstractCegarLoop]: === Iteration 26 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:08,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:08,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1305095773, now seen corresponding path program 25 times [2018-09-26 08:06:08,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:08,260 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:08,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:06:08,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:06:08,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:06:08,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:06:08,264 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-09-26 08:06:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:08,293 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-26 08:06:08,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:06:08,294 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-09-26 08:06:08,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:08,297 INFO L225 Difference]: With dead ends: 32 [2018-09-26 08:06:08,297 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 08:06:08,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:06:08,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 08:06:08,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-26 08:06:08,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 08:06:08,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-26 08:06:08,302 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-09-26 08:06:08,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:08,303 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-26 08:06:08,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:06:08,303 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-26 08:06:08,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:06:08,304 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:08,304 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-09-26 08:06:08,304 INFO L423 AbstractCegarLoop]: === Iteration 27 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:08,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:08,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1803252736, now seen corresponding path program 26 times [2018-09-26 08:06:08,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:08,489 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:08,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:06:08,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:06:08,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:06:08,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:06:08,491 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-09-26 08:06:08,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:08,519 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-26 08:06:08,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:06:08,519 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-09-26 08:06:08,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:08,520 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:06:08,520 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:06:08,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:06:08,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:06:08,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:06:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:06:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 08:06:08,526 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-09-26 08:06:08,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:08,526 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 08:06:08,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:06:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 08:06:08,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:06:08,527 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:08,527 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-09-26 08:06:08,528 INFO L423 AbstractCegarLoop]: === Iteration 28 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:08,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:08,529 INFO L82 PathProgramCache]: Analyzing trace with hash -66249405, now seen corresponding path program 27 times [2018-09-26 08:06:08,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:08,773 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:08,773 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:06:08,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:06:08,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:06:08,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:06:08,775 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-09-26 08:06:08,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:08,795 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-26 08:06:08,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:06:08,795 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-09-26 08:06:08,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:08,796 INFO L225 Difference]: With dead ends: 34 [2018-09-26 08:06:08,796 INFO L226 Difference]: Without dead ends: 32 [2018-09-26 08:06:08,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:06:08,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-26 08:06:08,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-26 08:06:08,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-26 08:06:08,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-26 08:06:08,803 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-09-26 08:06:08,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:08,803 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-26 08:06:08,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:06:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-26 08:06:08,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 08:06:08,808 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:08,808 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-09-26 08:06:08,808 INFO L423 AbstractCegarLoop]: === Iteration 29 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:08,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:08,810 INFO L82 PathProgramCache]: Analyzing trace with hash -2053720992, now seen corresponding path program 28 times [2018-09-26 08:06:08,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:08,981 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:08,981 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:06:08,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:06:08,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:06:08,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:06:08,982 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-09-26 08:06:08,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:08,998 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 08:06:08,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:06:08,998 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-09-26 08:06:08,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:08,998 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:06:08,998 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:06:08,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:06:09,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:06:09,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 08:06:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:06:09,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 08:06:09,009 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-09-26 08:06:09,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:09,009 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 08:06:09,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:06:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 08:06:09,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:06:09,010 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:09,010 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-09-26 08:06:09,012 INFO L423 AbstractCegarLoop]: === Iteration 30 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:09,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:09,012 INFO L82 PathProgramCache]: Analyzing trace with hash 759169251, now seen corresponding path program 29 times [2018-09-26 08:06:09,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:09,176 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:09,176 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:06:09,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:06:09,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:06:09,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:06:09,178 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-09-26 08:06:09,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:09,200 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-26 08:06:09,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:06:09,200 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-09-26 08:06:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:09,201 INFO L225 Difference]: With dead ends: 36 [2018-09-26 08:06:09,201 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 08:06:09,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:06:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 08:06:09,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-26 08:06:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 08:06:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-09-26 08:06:09,207 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-09-26 08:06:09,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:09,207 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-09-26 08:06:09,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:06:09,207 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-09-26 08:06:09,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-26 08:06:09,208 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:09,208 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-09-26 08:06:09,208 INFO L423 AbstractCegarLoop]: === Iteration 31 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:09,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:09,208 INFO L82 PathProgramCache]: Analyzing trace with hash 2059420864, now seen corresponding path program 30 times [2018-09-26 08:06:09,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:09,387 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:09,387 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:06:09,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:06:09,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:06:09,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:06:09,388 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-09-26 08:06:09,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:09,410 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-26 08:06:09,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:06:09,410 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-09-26 08:06:09,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:09,411 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:06:09,411 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:06:09,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:06:09,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:06:09,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:06:09,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:06:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 08:06:09,416 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-09-26 08:06:09,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:09,417 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 08:06:09,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:06:09,417 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 08:06:09,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:06:09,417 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:09,418 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-09-26 08:06:09,418 INFO L423 AbstractCegarLoop]: === Iteration 32 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:09,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:09,418 INFO L82 PathProgramCache]: Analyzing trace with hash -582452093, now seen corresponding path program 31 times [2018-09-26 08:06:09,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:09,615 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:09,615 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:09,616 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:06:09,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:06:09,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:06:09,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:06:09,617 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-09-26 08:06:09,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:09,637 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-26 08:06:09,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:06:09,637 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-09-26 08:06:09,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:09,638 INFO L225 Difference]: With dead ends: 38 [2018-09-26 08:06:09,638 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 08:06:09,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:06:09,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 08:06:09,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-26 08:06:09,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 08:06:09,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-26 08:06:09,649 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-09-26 08:06:09,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:09,649 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-26 08:06:09,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:06:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-26 08:06:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 08:06:09,653 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:09,653 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-09-26 08:06:09,653 INFO L423 AbstractCegarLoop]: === Iteration 33 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:09,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:09,654 INFO L82 PathProgramCache]: Analyzing trace with hash -876135136, now seen corresponding path program 32 times [2018-09-26 08:06:09,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:09,855 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:09,855 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:06:09,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:06:09,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:06:09,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:06:09,859 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-09-26 08:06:09,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:09,882 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-26 08:06:09,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:06:09,882 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-09-26 08:06:09,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:09,883 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:06:09,883 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:06:09,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:06:09,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:06:09,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:06:09,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:06:09,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 08:06:09,892 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-09-26 08:06:09,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:09,892 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 08:06:09,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:06:09,892 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 08:06:09,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:06:09,893 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:09,893 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-09-26 08:06:09,893 INFO L423 AbstractCegarLoop]: === Iteration 34 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:09,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:09,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1390374877, now seen corresponding path program 33 times [2018-09-26 08:06:09,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:10,085 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:10,086 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:10,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:06:10,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:06:10,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:06:10,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:06:10,088 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-09-26 08:06:10,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:10,113 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-26 08:06:10,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:06:10,114 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-09-26 08:06:10,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:10,114 INFO L225 Difference]: With dead ends: 40 [2018-09-26 08:06:10,114 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 08:06:10,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:06:10,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 08:06:10,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-09-26 08:06:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 08:06:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-26 08:06:10,119 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-09-26 08:06:10,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:10,119 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-26 08:06:10,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:06:10,119 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-26 08:06:10,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 08:06:10,120 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:10,120 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-09-26 08:06:10,120 INFO L423 AbstractCegarLoop]: === Iteration 35 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:10,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:10,120 INFO L82 PathProgramCache]: Analyzing trace with hash -151937664, now seen corresponding path program 34 times [2018-09-26 08:06:10,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:10,345 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:10,345 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:10,345 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:06:10,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:06:10,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:06:10,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:06:10,349 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-09-26 08:06:10,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:10,373 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-26 08:06:10,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:06:10,374 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-09-26 08:06:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:10,374 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:06:10,374 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:06:10,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:06:10,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:06:10,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:06:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:06:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-26 08:06:10,380 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-09-26 08:06:10,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:10,380 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-26 08:06:10,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:06:10,380 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-26 08:06:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:06:10,387 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:10,387 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-09-26 08:06:10,387 INFO L423 AbstractCegarLoop]: === Iteration 36 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:10,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:10,388 INFO L82 PathProgramCache]: Analyzing trace with hash -415089725, now seen corresponding path program 35 times [2018-09-26 08:06:10,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:10,620 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:10,621 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:10,621 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:06:10,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:06:10,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:06:10,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:06:10,623 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-09-26 08:06:10,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:10,645 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-26 08:06:10,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:06:10,645 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-09-26 08:06:10,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:10,645 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:06:10,646 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 08:06:10,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:06:10,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 08:06:10,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-26 08:06:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 08:06:10,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-09-26 08:06:10,650 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-09-26 08:06:10,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:10,651 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-09-26 08:06:10,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:06:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-09-26 08:06:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 08:06:10,651 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:10,652 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-09-26 08:06:10,652 INFO L423 AbstractCegarLoop]: === Iteration 37 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:10,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:10,652 INFO L82 PathProgramCache]: Analyzing trace with hash 17130976, now seen corresponding path program 36 times [2018-09-26 08:06:10,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:10,882 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:10,883 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:06:10,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:06:10,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:06:10,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:06:10,884 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-09-26 08:06:10,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:10,909 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-26 08:06:10,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:06:10,909 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-09-26 08:06:10,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:10,909 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:06:10,910 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:06:10,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:06:10,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:06:10,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:06:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:06:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:06:10,914 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-09-26 08:06:10,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:10,914 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:06:10,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:06:10,914 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:06:10,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:06:10,915 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:10,915 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-09-26 08:06:10,915 INFO L423 AbstractCegarLoop]: === Iteration 38 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:10,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:10,916 INFO L82 PathProgramCache]: Analyzing trace with hash 531070819, now seen corresponding path program 37 times [2018-09-26 08:06:10,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:11,209 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:11,209 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:06:11,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:06:11,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:06:11,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:06:11,211 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-09-26 08:06:11,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:11,240 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-26 08:06:11,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:06:11,240 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-09-26 08:06:11,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:11,241 INFO L225 Difference]: With dead ends: 44 [2018-09-26 08:06:11,241 INFO L226 Difference]: Without dead ends: 42 [2018-09-26 08:06:11,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:06:11,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-26 08:06:11,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-09-26 08:06:11,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-26 08:06:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-26 08:06:11,247 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-09-26 08:06:11,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:11,247 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-26 08:06:11,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:06:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-26 08:06:11,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 08:06:11,248 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:11,248 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-09-26 08:06:11,248 INFO L423 AbstractCegarLoop]: === Iteration 39 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:11,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:11,249 INFO L82 PathProgramCache]: Analyzing trace with hash -716663232, now seen corresponding path program 38 times [2018-09-26 08:06:11,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:11,630 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:11,631 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:11,631 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:06:11,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:06:11,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:06:11,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:06:11,633 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-09-26 08:06:11,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:11,663 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 08:06:11,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:06:11,663 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-09-26 08:06:11,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:11,664 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:06:11,664 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:06:11,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:06:11,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:06:11,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:06:11,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:06:11,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-26 08:06:11,668 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-09-26 08:06:11,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:11,669 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-26 08:06:11,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:06:11,669 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-26 08:06:11,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:06:11,669 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:11,670 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-09-26 08:06:11,670 INFO L423 AbstractCegarLoop]: === Iteration 40 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:11,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:11,670 INFO L82 PathProgramCache]: Analyzing trace with hash -741713149, now seen corresponding path program 39 times [2018-09-26 08:06:11,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:11,947 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:11,947 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:11,948 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:06:11,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:06:11,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:06:11,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:06:11,949 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-09-26 08:06:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:11,975 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-26 08:06:11,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:06:11,975 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-09-26 08:06:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:11,976 INFO L225 Difference]: With dead ends: 46 [2018-09-26 08:06:11,976 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 08:06:11,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:06:11,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 08:06:11,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-09-26 08:06:11,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-26 08:06:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-26 08:06:11,980 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-09-26 08:06:11,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:11,981 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-26 08:06:11,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:06:11,981 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-26 08:06:11,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 08:06:11,981 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:11,982 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-09-26 08:06:11,982 INFO L423 AbstractCegarLoop]: === Iteration 41 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:11,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:11,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1518260576, now seen corresponding path program 40 times [2018-09-26 08:06:11,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:12,312 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:12,312 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:12,312 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:06:12,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:06:12,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:06:12,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:06:12,318 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-09-26 08:06:12,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:12,354 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-26 08:06:12,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:06:12,355 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-09-26 08:06:12,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:12,355 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:06:12,355 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:06:12,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:06:12,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:06:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:06:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:06:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 08:06:12,359 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-09-26 08:06:12,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:12,359 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 08:06:12,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:06:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 08:06:12,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:06:12,360 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:12,360 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-09-26 08:06:12,360 INFO L423 AbstractCegarLoop]: === Iteration 42 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:12,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:12,361 INFO L82 PathProgramCache]: Analyzing trace with hash 178572963, now seen corresponding path program 41 times [2018-09-26 08:06:12,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:12,639 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:12,640 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:12,640 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:06:12,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:06:12,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:06:12,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:06:12,642 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-09-26 08:06:12,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:12,669 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-26 08:06:12,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:06:12,670 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-09-26 08:06:12,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:12,670 INFO L225 Difference]: With dead ends: 48 [2018-09-26 08:06:12,670 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 08:06:12,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:06:12,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 08:06:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-26 08:06:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-26 08:06:12,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-26 08:06:12,675 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-09-26 08:06:12,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:12,675 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-26 08:06:12,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:06:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-26 08:06:12,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-26 08:06:12,676 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:12,676 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-09-26 08:06:12,676 INFO L423 AbstractCegarLoop]: === Iteration 43 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:12,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:12,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1240805120, now seen corresponding path program 42 times [2018-09-26 08:06:12,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:12,960 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:12,960 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:12,960 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:06:12,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:06:12,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:06:12,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:06:12,963 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-09-26 08:06:12,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:12,996 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-09-26 08:06:12,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:06:12,996 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-09-26 08:06:12,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:12,997 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:06:12,997 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:06:12,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:06:12,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:06:13,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 08:06:13,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:06:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-26 08:06:13,001 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-09-26 08:06:13,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:13,002 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-26 08:06:13,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:06:13,002 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-26 08:06:13,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:06:13,002 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:13,003 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-09-26 08:06:13,003 INFO L423 AbstractCegarLoop]: === Iteration 44 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:13,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:13,003 INFO L82 PathProgramCache]: Analyzing trace with hash -189736381, now seen corresponding path program 43 times [2018-09-26 08:06:13,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:13,298 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:13,298 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:13,298 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:06:13,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:06:13,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:06:13,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:06:13,300 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-09-26 08:06:13,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:13,330 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-26 08:06:13,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:06:13,330 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-09-26 08:06:13,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:13,331 INFO L225 Difference]: With dead ends: 50 [2018-09-26 08:06:13,331 INFO L226 Difference]: Without dead ends: 48 [2018-09-26 08:06:13,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:06:13,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-26 08:06:13,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-09-26 08:06:13,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-26 08:06:13,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-09-26 08:06:13,335 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-09-26 08:06:13,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:13,335 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-09-26 08:06:13,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:06:13,336 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-09-26 08:06:13,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-26 08:06:13,336 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:13,336 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-09-26 08:06:13,336 INFO L423 AbstractCegarLoop]: === Iteration 45 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:13,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:13,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1586849952, now seen corresponding path program 44 times [2018-09-26 08:06:13,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:13,669 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:13,669 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:06:13,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:06:13,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:06:13,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:06:13,671 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-09-26 08:06:13,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:13,707 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-26 08:06:13,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:06:13,707 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-09-26 08:06:13,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:13,708 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:06:13,708 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:06:13,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:06:13,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:06:13,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 08:06:13,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:06:13,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-26 08:06:13,712 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-09-26 08:06:13,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:13,712 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-26 08:06:13,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:06:13,713 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-26 08:06:13,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:06:13,713 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:13,713 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-09-26 08:06:13,713 INFO L423 AbstractCegarLoop]: === Iteration 46 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:13,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:13,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1947697693, now seen corresponding path program 45 times [2018-09-26 08:06:13,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:14,023 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:14,023 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:06:14,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:06:14,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:06:14,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:06:14,025 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-09-26 08:06:14,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:14,054 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-26 08:06:14,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:06:14,054 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-09-26 08:06:14,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:14,055 INFO L225 Difference]: With dead ends: 52 [2018-09-26 08:06:14,055 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 08:06:14,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:06:14,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 08:06:14,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-26 08:06:14,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-26 08:06:14,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-09-26 08:06:14,059 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-09-26 08:06:14,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:14,060 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-09-26 08:06:14,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:06:14,060 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-09-26 08:06:14,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-26 08:06:14,060 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:14,061 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-09-26 08:06:14,061 INFO L423 AbstractCegarLoop]: === Iteration 47 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:14,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:14,061 INFO L82 PathProgramCache]: Analyzing trace with hash -249075776, now seen corresponding path program 46 times [2018-09-26 08:06:14,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:14,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:14,435 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:14,435 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:06:14,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:06:14,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:06:14,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:06:14,437 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-09-26 08:06:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:14,469 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-09-26 08:06:14,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:06:14,469 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-09-26 08:06:14,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:14,470 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:06:14,470 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:06:14,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:06:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:06:14,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 08:06:14,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:06:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-26 08:06:14,474 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-09-26 08:06:14,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:14,475 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-26 08:06:14,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:06:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-26 08:06:14,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:06:14,476 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:14,476 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-09-26 08:06:14,476 INFO L423 AbstractCegarLoop]: === Iteration 48 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:14,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:14,476 INFO L82 PathProgramCache]: Analyzing trace with hash 868596099, now seen corresponding path program 47 times [2018-09-26 08:06:14,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:14,874 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:14,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:06:14,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:06:14,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:06:14,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:06:14,876 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-09-26 08:06:14,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:14,905 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-26 08:06:14,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:06:14,906 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-09-26 08:06:14,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:14,906 INFO L225 Difference]: With dead ends: 54 [2018-09-26 08:06:14,906 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 08:06:14,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:06:14,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 08:06:14,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-09-26 08:06:14,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 08:06:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-26 08:06:14,912 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-09-26 08:06:14,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:14,912 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-26 08:06:14,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:06:14,912 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-26 08:06:14,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-26 08:06:14,913 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:14,913 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-09-26 08:06:14,913 INFO L423 AbstractCegarLoop]: === Iteration 49 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:14,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:14,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1156685856, now seen corresponding path program 48 times [2018-09-26 08:06:14,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:15,219 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:15,219 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:06:15,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:06:15,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:06:15,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:06:15,221 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-09-26 08:06:15,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:15,257 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-26 08:06:15,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:06:15,257 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-09-26 08:06:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:15,257 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:06:15,258 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:06:15,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:06:15,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:06:15,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:06:15,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:06:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 08:06:15,262 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-09-26 08:06:15,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:15,263 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 08:06:15,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:06:15,263 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 08:06:15,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:06:15,263 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:15,263 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-09-26 08:06:15,264 INFO L423 AbstractCegarLoop]: === Iteration 50 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:15,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:15,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1497533731, now seen corresponding path program 49 times [2018-09-26 08:06:15,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:15,573 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:15,574 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:06:15,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:06:15,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:06:15,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:06:15,575 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-09-26 08:06:15,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:15,610 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-26 08:06:15,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:06:15,611 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-09-26 08:06:15,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:15,611 INFO L225 Difference]: With dead ends: 56 [2018-09-26 08:06:15,611 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 08:06:15,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:06:15,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 08:06:15,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-09-26 08:06:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-26 08:06:15,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-09-26 08:06:15,615 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-09-26 08:06:15,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:15,615 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-09-26 08:06:15,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:06:15,616 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-09-26 08:06:15,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-26 08:06:15,616 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:15,616 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-09-26 08:06:15,617 INFO L423 AbstractCegarLoop]: === Iteration 51 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:15,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:15,617 INFO L82 PathProgramCache]: Analyzing trace with hash -821084032, now seen corresponding path program 50 times [2018-09-26 08:06:15,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:15,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:15,936 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:15,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:06:15,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:06:15,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:06:15,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:06:15,939 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-09-26 08:06:15,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:15,981 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-09-26 08:06:15,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:06:15,981 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-09-26 08:06:15,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:15,982 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:06:15,982 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:06:15,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:06:15,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:06:15,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 08:06:15,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:06:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-09-26 08:06:15,991 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-09-26 08:06:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:15,991 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-09-26 08:06:15,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:06:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-09-26 08:06:15,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:06:15,992 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:15,992 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-09-26 08:06:15,992 INFO L423 AbstractCegarLoop]: === Iteration 52 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:15,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:15,993 INFO L82 PathProgramCache]: Analyzing trace with hash 316209347, now seen corresponding path program 51 times [2018-09-26 08:06:15,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:16,319 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:16,319 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:06:16,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:06:16,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:06:16,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:06:16,321 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-09-26 08:06:16,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:16,357 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-09-26 08:06:16,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:06:16,357 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-09-26 08:06:16,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:16,358 INFO L225 Difference]: With dead ends: 58 [2018-09-26 08:06:16,358 INFO L226 Difference]: Without dead ends: 56 [2018-09-26 08:06:16,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:06:16,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-26 08:06:16,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-09-26 08:06:16,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-26 08:06:16,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-26 08:06:16,362 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-09-26 08:06:16,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:16,362 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-26 08:06:16,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:06:16,362 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-26 08:06:16,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-26 08:06:16,363 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:16,363 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-09-26 08:06:16,363 INFO L423 AbstractCegarLoop]: === Iteration 53 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:16,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:16,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1212565728, now seen corresponding path program 52 times [2018-09-26 08:06:16,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:16,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:16,686 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:16,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:06:16,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:06:16,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:06:16,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:06:16,688 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-09-26 08:06:16,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:16,722 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-26 08:06:16,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:06:16,722 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-09-26 08:06:16,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:16,723 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:06:16,723 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:06:16,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:06:16,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:06:16,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 08:06:16,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:06:16,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-26 08:06:16,727 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-09-26 08:06:16,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:16,727 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-26 08:06:16,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:06:16,728 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-26 08:06:16,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:06:16,728 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:16,728 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-09-26 08:06:16,728 INFO L423 AbstractCegarLoop]: === Iteration 54 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:16,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:16,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1065157533, now seen corresponding path program 53 times [2018-09-26 08:06:16,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:17,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:17,043 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:17,044 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:06:17,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:06:17,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:06:17,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:06:17,045 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-09-26 08:06:17,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:17,086 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-26 08:06:17,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:06:17,086 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-09-26 08:06:17,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:17,087 INFO L225 Difference]: With dead ends: 60 [2018-09-26 08:06:17,087 INFO L226 Difference]: Without dead ends: 58 [2018-09-26 08:06:17,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:06:17,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-26 08:06:17,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-09-26 08:06:17,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-26 08:06:17,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-09-26 08:06:17,092 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-09-26 08:06:17,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:17,092 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-09-26 08:06:17,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:06:17,092 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-09-26 08:06:17,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-26 08:06:17,093 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:17,093 INFO L375 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-09-26 08:06:17,093 INFO L423 AbstractCegarLoop]: === Iteration 55 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:17,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:17,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1339865408, now seen corresponding path program 54 times [2018-09-26 08:06:17,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:17,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:17,409 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:17,409 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:06:17,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:06:17,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:06:17,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:06:17,411 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-09-26 08:06:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:17,457 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-09-26 08:06:17,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:06:17,457 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-09-26 08:06:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:17,458 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:06:17,458 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:06:17,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:06:17,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:06:17,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 08:06:17,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:06:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-09-26 08:06:17,469 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-09-26 08:06:17,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:17,469 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-09-26 08:06:17,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:06:17,469 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-09-26 08:06:17,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:06:17,470 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:17,470 INFO L375 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-09-26 08:06:17,471 INFO L423 AbstractCegarLoop]: === Iteration 56 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:17,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:17,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1413834749, now seen corresponding path program 55 times [2018-09-26 08:06:17,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:17,868 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:17,868 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:06:17,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:06:17,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:06:17,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:06:17,870 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-09-26 08:06:17,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:17,906 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-09-26 08:06:17,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:06:17,906 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-09-26 08:06:17,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:17,907 INFO L225 Difference]: With dead ends: 62 [2018-09-26 08:06:17,907 INFO L226 Difference]: Without dead ends: 60 [2018-09-26 08:06:17,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:06:17,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-26 08:06:17,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-09-26 08:06:17,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-26 08:06:17,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-09-26 08:06:17,913 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-09-26 08:06:17,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:17,914 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-09-26 08:06:17,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:06:17,914 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-09-26 08:06:17,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-26 08:06:17,915 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:17,915 INFO L375 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-09-26 08:06:17,915 INFO L423 AbstractCegarLoop]: === Iteration 57 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:17,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:17,916 INFO L82 PathProgramCache]: Analyzing trace with hash -879193696, now seen corresponding path program 56 times [2018-09-26 08:06:17,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:18,309 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:18,309 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:06:18,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:06:18,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:06:18,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:06:18,311 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-09-26 08:06:18,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:18,362 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-26 08:06:18,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:06:18,362 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-09-26 08:06:18,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:18,363 INFO L225 Difference]: With dead ends: 63 [2018-09-26 08:06:18,363 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:06:18,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:06:18,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:06:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 08:06:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:06:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-26 08:06:18,369 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-09-26 08:06:18,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:18,370 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-26 08:06:18,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:06:18,370 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-26 08:06:18,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:06:18,370 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:18,371 INFO L375 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-09-26 08:06:18,371 INFO L423 AbstractCegarLoop]: === Iteration 58 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:18,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:18,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1485190237, now seen corresponding path program 57 times [2018-09-26 08:06:18,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:18,703 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:18,703 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:06:18,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:06:18,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:06:18,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:06:18,705 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-09-26 08:06:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:18,755 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-09-26 08:06:18,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:06:18,755 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-09-26 08:06:18,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:18,756 INFO L225 Difference]: With dead ends: 64 [2018-09-26 08:06:18,756 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 08:06:18,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:06:18,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 08:06:18,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-09-26 08:06:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-26 08:06:18,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-26 08:06:18,761 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-09-26 08:06:18,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:18,761 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-26 08:06:18,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:06:18,762 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-26 08:06:18,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-26 08:06:18,762 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:18,762 INFO L375 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-09-26 08:06:18,763 INFO L423 AbstractCegarLoop]: === Iteration 59 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:18,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:18,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1203753472, now seen corresponding path program 58 times [2018-09-26 08:06:18,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:19,108 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:19,109 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:06:19,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:06:19,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:06:19,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:06:19,111 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-09-26 08:06:19,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:19,156 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-26 08:06:19,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:06:19,156 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-09-26 08:06:19,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:19,157 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:06:19,157 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:06:19,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:06:19,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:06:19,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-26 08:06:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:06:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-09-26 08:06:19,162 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-09-26 08:06:19,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:19,162 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-09-26 08:06:19,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:06:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-09-26 08:06:19,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:06:19,163 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:19,163 INFO L375 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-09-26 08:06:19,163 INFO L423 AbstractCegarLoop]: === Iteration 60 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:19,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:19,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1338337469, now seen corresponding path program 59 times [2018-09-26 08:06:19,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:19,496 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:19,496 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:06:19,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:06:19,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:06:19,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:06:19,499 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-09-26 08:06:19,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:19,544 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-26 08:06:19,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:06:19,544 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-09-26 08:06:19,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:19,545 INFO L225 Difference]: With dead ends: 66 [2018-09-26 08:06:19,545 INFO L226 Difference]: Without dead ends: 64 [2018-09-26 08:06:19,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:06:19,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-26 08:06:19,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-09-26 08:06:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-26 08:06:19,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-09-26 08:06:19,550 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-09-26 08:06:19,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:19,551 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-09-26 08:06:19,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:06:19,551 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-09-26 08:06:19,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-26 08:06:19,551 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:19,551 INFO L375 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-09-26 08:06:19,552 INFO L423 AbstractCegarLoop]: === Iteration 61 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:19,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:19,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1461221984, now seen corresponding path program 60 times [2018-09-26 08:06:19,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:19,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:19,879 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:19,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:06:19,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:06:19,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:06:19,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:06:19,882 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-09-26 08:06:19,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:19,924 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-26 08:06:19,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:06:19,925 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-09-26 08:06:19,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:19,925 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:06:19,925 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:06:19,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:06:19,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:06:19,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:06:19,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:06:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-26 08:06:19,930 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-09-26 08:06:19,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:19,930 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-26 08:06:19,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:06:19,930 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-26 08:06:19,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:06:19,931 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:19,931 INFO L375 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-09-26 08:06:19,931 INFO L423 AbstractCegarLoop]: === Iteration 62 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:19,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:19,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1946748189, now seen corresponding path program 61 times [2018-09-26 08:06:19,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:20,266 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:20,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:06:20,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:06:20,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:06:20,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:06:20,268 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-09-26 08:06:20,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:20,316 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-09-26 08:06:20,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:06:20,316 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-09-26 08:06:20,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:20,317 INFO L225 Difference]: With dead ends: 68 [2018-09-26 08:06:20,317 INFO L226 Difference]: Without dead ends: 66 [2018-09-26 08:06:20,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:06:20,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-26 08:06:20,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-09-26 08:06:20,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-26 08:06:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-26 08:06:20,322 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-09-26 08:06:20,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:20,322 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-26 08:06:20,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:06:20,322 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-26 08:06:20,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 08:06:20,323 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:20,323 INFO L375 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-09-26 08:06:20,323 INFO L423 AbstractCegarLoop]: === Iteration 63 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:20,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:20,323 INFO L82 PathProgramCache]: Analyzing trace with hash -219641152, now seen corresponding path program 62 times [2018-09-26 08:06:20,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:20,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:20,653 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:20,653 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:06:20,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:06:20,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:06:20,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:06:20,656 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-09-26 08:06:20,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:20,705 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-09-26 08:06:20,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:06:20,705 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-09-26 08:06:20,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:20,706 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:06:20,706 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:06:20,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:06:20,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:06:20,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 08:06:20,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:06:20,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-09-26 08:06:20,711 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-09-26 08:06:20,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:20,711 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-09-26 08:06:20,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:06:20,711 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-09-26 08:06:20,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:06:20,712 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:20,712 INFO L375 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-09-26 08:06:20,712 INFO L423 AbstractCegarLoop]: === Iteration 64 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:20,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:20,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1781069443, now seen corresponding path program 63 times [2018-09-26 08:06:20,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:21,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:21,078 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:21,078 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:06:21,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:06:21,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:06:21,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:06:21,081 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-09-26 08:06:21,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:21,119 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-26 08:06:21,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:06:21,119 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-09-26 08:06:21,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:21,120 INFO L225 Difference]: With dead ends: 70 [2018-09-26 08:06:21,120 INFO L226 Difference]: Without dead ends: 68 [2018-09-26 08:06:21,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:06:21,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-26 08:06:21,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-09-26 08:06:21,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-26 08:06:21,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-09-26 08:06:21,128 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-09-26 08:06:21,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:21,129 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-09-26 08:06:21,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:06:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-09-26 08:06:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-26 08:06:21,130 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:21,130 INFO L375 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-09-26 08:06:21,131 INFO L423 AbstractCegarLoop]: === Iteration 65 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:21,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:21,131 INFO L82 PathProgramCache]: Analyzing trace with hash -621411552, now seen corresponding path program 64 times [2018-09-26 08:06:21,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:21,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:21,459 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:21,459 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:06:21,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:06:21,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:06:21,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:06:21,461 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-09-26 08:06:21,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:21,509 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-26 08:06:21,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:06:21,510 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-09-26 08:06:21,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:21,510 INFO L225 Difference]: With dead ends: 71 [2018-09-26 08:06:21,511 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:06:21,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:06:21,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:06:21,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-26 08:06:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:06:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-26 08:06:21,518 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-09-26 08:06:21,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:21,518 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-26 08:06:21,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:06:21,518 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-26 08:06:21,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:06:21,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:21,520 INFO L375 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-09-26 08:06:21,520 INFO L423 AbstractCegarLoop]: === Iteration 66 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:21,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:21,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2083878365, now seen corresponding path program 65 times [2018-09-26 08:06:21,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:21,886 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:21,886 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:06:21,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:06:21,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:06:21,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:06:21,888 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-09-26 08:06:21,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:21,941 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-09-26 08:06:21,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:06:21,942 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-09-26 08:06:21,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:21,942 INFO L225 Difference]: With dead ends: 72 [2018-09-26 08:06:21,943 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 08:06:21,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:06:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 08:06:21,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-09-26 08:06:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-26 08:06:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-09-26 08:06:21,947 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-09-26 08:06:21,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:21,947 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-09-26 08:06:21,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:06:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-09-26 08:06:21,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-26 08:06:21,948 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:21,948 INFO L375 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-09-26 08:06:21,948 INFO L423 AbstractCegarLoop]: === Iteration 67 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:21,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:21,948 INFO L82 PathProgramCache]: Analyzing trace with hash -175709312, now seen corresponding path program 66 times [2018-09-26 08:06:21,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:22,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:22,298 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:22,298 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:06:22,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:06:22,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:06:22,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:06:22,300 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-09-26 08:06:22,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:22,343 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-09-26 08:06:22,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:06:22,344 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-09-26 08:06:22,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:22,344 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:06:22,345 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:06:22,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:06:22,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:06:22,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-26 08:06:22,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:06:22,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-26 08:06:22,350 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-09-26 08:06:22,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:22,350 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-26 08:06:22,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:06:22,350 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-26 08:06:22,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:06:22,351 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:22,351 INFO L375 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-09-26 08:06:22,351 INFO L423 AbstractCegarLoop]: === Iteration 68 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:22,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:22,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1152010813, now seen corresponding path program 67 times [2018-09-26 08:06:22,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:22,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:22,700 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:22,700 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:06:22,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:06:22,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:06:22,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:06:22,702 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-09-26 08:06:22,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:22,738 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-09-26 08:06:22,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:06:22,738 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-09-26 08:06:22,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:22,739 INFO L225 Difference]: With dead ends: 74 [2018-09-26 08:06:22,739 INFO L226 Difference]: Without dead ends: 72 [2018-09-26 08:06:22,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:06:22,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-26 08:06:22,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-09-26 08:06:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-26 08:06:22,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-09-26 08:06:22,744 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-09-26 08:06:22,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:22,744 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-09-26 08:06:22,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:06:22,744 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-09-26 08:06:22,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-26 08:06:22,745 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:22,745 INFO L375 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-09-26 08:06:22,745 INFO L423 AbstractCegarLoop]: === Iteration 69 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:22,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:22,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1352586272, now seen corresponding path program 68 times [2018-09-26 08:06:22,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:23,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:23,104 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:23,104 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:06:23,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:06:23,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:06:23,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:06:23,106 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-09-26 08:06:23,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:23,166 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-26 08:06:23,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:06:23,167 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-09-26 08:06:23,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:23,167 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:06:23,168 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:06:23,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:06:23,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:06:23,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-26 08:06:23,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:06:23,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-26 08:06:23,172 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-09-26 08:06:23,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:23,172 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-26 08:06:23,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:06:23,173 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-26 08:06:23,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:06:23,173 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:23,173 INFO L375 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-09-26 08:06:23,174 INFO L423 AbstractCegarLoop]: === Iteration 70 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:23,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:23,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1019509091, now seen corresponding path program 69 times [2018-09-26 08:06:23,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:23,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:23,620 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:23,621 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:06:23,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:06:23,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:06:23,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:06:23,623 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-09-26 08:06:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:23,683 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-26 08:06:23,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:06:23,683 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-09-26 08:06:23,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:23,684 INFO L225 Difference]: With dead ends: 76 [2018-09-26 08:06:23,684 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 08:06:23,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:06:23,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 08:06:23,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-26 08:06:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-26 08:06:23,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-09-26 08:06:23,689 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-09-26 08:06:23,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:23,690 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-09-26 08:06:23,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:06:23,690 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-09-26 08:06:23,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-26 08:06:23,691 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:23,691 INFO L375 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-09-26 08:06:23,691 INFO L423 AbstractCegarLoop]: === Iteration 71 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:23,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:23,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1540021312, now seen corresponding path program 70 times [2018-09-26 08:06:23,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:24,078 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:24,082 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:06:24,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:06:24,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:06:24,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:06:24,084 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-09-26 08:06:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:24,150 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-09-26 08:06:24,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:06:24,151 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-09-26 08:06:24,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:24,152 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:06:24,152 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:06:24,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:06:24,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:06:24,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-26 08:06:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:06:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-09-26 08:06:24,156 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-09-26 08:06:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:24,156 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-09-26 08:06:24,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:06:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-09-26 08:06:24,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:06:24,157 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:24,159 INFO L375 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-09-26 08:06:24,159 INFO L423 AbstractCegarLoop]: === Iteration 72 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:24,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:24,160 INFO L82 PathProgramCache]: Analyzing trace with hash 496030979, now seen corresponding path program 71 times [2018-09-26 08:06:24,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:24,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:24,543 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:24,543 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:06:24,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:06:24,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:06:24,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:06:24,549 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-09-26 08:06:24,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:24,622 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-09-26 08:06:24,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:06:24,623 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-09-26 08:06:24,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:24,624 INFO L225 Difference]: With dead ends: 78 [2018-09-26 08:06:24,624 INFO L226 Difference]: Without dead ends: 76 [2018-09-26 08:06:24,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:06:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-26 08:06:24,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-09-26 08:06:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 08:06:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-26 08:06:24,628 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-09-26 08:06:24,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:24,629 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-26 08:06:24,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:06:24,629 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-26 08:06:24,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-26 08:06:24,630 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:24,630 INFO L375 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-09-26 08:06:24,630 INFO L423 AbstractCegarLoop]: === Iteration 73 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:24,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:24,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1802898272, now seen corresponding path program 72 times [2018-09-26 08:06:24,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:25,029 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:25,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:06:25,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:06:25,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:06:25,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:06:25,031 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-09-26 08:06:25,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:25,102 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-26 08:06:25,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:06:25,102 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-09-26 08:06:25,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:25,103 INFO L225 Difference]: With dead ends: 79 [2018-09-26 08:06:25,103 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:06:25,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:06:25,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:06:25,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 08:06:25,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:06:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 08:06:25,107 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-09-26 08:06:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:25,108 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 08:06:25,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:06:25,108 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 08:06:25,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:06:25,109 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:25,109 INFO L375 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-09-26 08:06:25,109 INFO L423 AbstractCegarLoop]: === Iteration 74 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:25,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:25,109 INFO L82 PathProgramCache]: Analyzing trace with hash -55261021, now seen corresponding path program 73 times [2018-09-26 08:06:25,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:25,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:25,510 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:25,510 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:06:25,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:06:25,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:06:25,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:06:25,512 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-09-26 08:06:25,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:25,588 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-26 08:06:25,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:06:25,589 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-09-26 08:06:25,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:25,589 INFO L225 Difference]: With dead ends: 80 [2018-09-26 08:06:25,589 INFO L226 Difference]: Without dead ends: 78 [2018-09-26 08:06:25,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:06:25,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-26 08:06:25,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-09-26 08:06:25,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-26 08:06:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-09-26 08:06:25,594 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-09-26 08:06:25,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:25,594 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-09-26 08:06:25,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:06:25,594 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-09-26 08:06:25,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-26 08:06:25,595 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:25,596 INFO L375 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-09-26 08:06:25,596 INFO L423 AbstractCegarLoop]: === Iteration 75 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:25,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:25,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1713081088, now seen corresponding path program 74 times [2018-09-26 08:06:25,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:26,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:26,008 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:26,008 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:06:26,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:06:26,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:06:26,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:06:26,010 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-09-26 08:06:26,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:26,079 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-09-26 08:06:26,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:06:26,079 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-09-26 08:06:26,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:26,080 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:06:26,080 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:06:26,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:06:26,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:06:26,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-26 08:06:26,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:06:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-09-26 08:06:26,084 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-09-26 08:06:26,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:26,084 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-09-26 08:06:26,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:06:26,084 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-09-26 08:06:26,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:06:26,085 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:26,085 INFO L375 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-09-26 08:06:26,085 INFO L423 AbstractCegarLoop]: === Iteration 76 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:26,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:26,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1565895613, now seen corresponding path program 75 times [2018-09-26 08:06:26,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:26,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:26,513 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:26,513 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:06:26,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:06:26,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:06:26,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:06:26,518 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-09-26 08:06:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:26,612 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-09-26 08:06:26,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:06:26,612 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-09-26 08:06:26,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:26,613 INFO L225 Difference]: With dead ends: 82 [2018-09-26 08:06:26,613 INFO L226 Difference]: Without dead ends: 80 [2018-09-26 08:06:26,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:06:26,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-26 08:06:26,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-26 08:06:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-26 08:06:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-09-26 08:06:26,620 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-09-26 08:06:26,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:26,621 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-09-26 08:06:26,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:06:26,621 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-09-26 08:06:26,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-26 08:06:26,622 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:26,622 INFO L375 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-09-26 08:06:26,622 INFO L423 AbstractCegarLoop]: === Iteration 77 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:26,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:26,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1298113184, now seen corresponding path program 76 times [2018-09-26 08:06:26,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:27,023 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:27,023 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:06:27,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:06:27,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:06:27,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:06:27,025 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-09-26 08:06:27,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:27,082 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-26 08:06:27,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:06:27,082 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-09-26 08:06:27,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:27,083 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:06:27,083 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 08:06:27,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:06:27,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 08:06:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-26 08:06:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:06:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-26 08:06:27,087 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-09-26 08:06:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:27,087 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-26 08:06:27,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:06:27,087 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-26 08:06:27,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:06:27,088 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:27,088 INFO L375 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-09-26 08:06:27,089 INFO L423 AbstractCegarLoop]: === Iteration 78 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:27,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:27,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1586792477, now seen corresponding path program 77 times [2018-09-26 08:06:27,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:27,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:27,481 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:27,482 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:06:27,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:06:27,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:06:27,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:06:27,483 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-09-26 08:06:27,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:27,525 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-09-26 08:06:27,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:06:27,525 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-09-26 08:06:27,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:27,526 INFO L225 Difference]: With dead ends: 84 [2018-09-26 08:06:27,526 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 08:06:27,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:06:27,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 08:06:27,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-09-26 08:06:27,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-26 08:06:27,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-09-26 08:06:27,530 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-09-26 08:06:27,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:27,530 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-09-26 08:06:27,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:06:27,531 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-09-26 08:06:27,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-26 08:06:27,531 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:27,531 INFO L375 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-09-26 08:06:27,532 INFO L423 AbstractCegarLoop]: === Iteration 79 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:27,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:27,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1945915968, now seen corresponding path program 78 times [2018-09-26 08:06:27,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:27,937 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:27,937 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:06:27,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:06:27,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:06:27,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:06:27,939 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-09-26 08:06:28,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:28,020 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-26 08:06:28,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:06:28,020 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-09-26 08:06:28,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:28,021 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:06:28,021 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:06:28,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:06:28,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:06:28,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 08:06:28,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:06:28,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-09-26 08:06:28,026 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-09-26 08:06:28,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:28,026 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-09-26 08:06:28,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:06:28,026 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-09-26 08:06:28,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:06:28,027 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:28,027 INFO L375 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-09-26 08:06:28,028 INFO L423 AbstractCegarLoop]: === Iteration 80 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:28,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:28,028 INFO L82 PathProgramCache]: Analyzing trace with hash -193842301, now seen corresponding path program 79 times [2018-09-26 08:06:28,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:28,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:28,434 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:28,434 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:06:28,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:06:28,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:06:28,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:06:28,436 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-09-26 08:06:28,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:28,519 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-26 08:06:28,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:06:28,519 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-09-26 08:06:28,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:28,520 INFO L225 Difference]: With dead ends: 86 [2018-09-26 08:06:28,520 INFO L226 Difference]: Without dead ends: 84 [2018-09-26 08:06:28,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:06:28,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-26 08:06:28,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-09-26 08:06:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-26 08:06:28,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-09-26 08:06:28,524 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-09-26 08:06:28,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:28,525 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-09-26 08:06:28,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:06:28,525 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-09-26 08:06:28,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-26 08:06:28,525 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:28,525 INFO L375 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-09-26 08:06:28,526 INFO L423 AbstractCegarLoop]: === Iteration 81 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:28,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:28,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1714133472, now seen corresponding path program 80 times [2018-09-26 08:06:28,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:28,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:28,889 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:28,889 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:06:28,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:06:28,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:06:28,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:06:28,890 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-09-26 08:06:28,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:28,942 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-26 08:06:28,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:06:28,942 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-09-26 08:06:28,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:28,943 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:06:28,943 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:06:28,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 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-09-26 08:06:28,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:06:28,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 08:06:28,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:06:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-26 08:06:28,947 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-09-26 08:06:28,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:28,948 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-26 08:06:28,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:06:28,948 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-26 08:06:28,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:06:28,949 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:28,949 INFO L375 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-09-26 08:06:28,949 INFO L423 AbstractCegarLoop]: === Iteration 82 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:28,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:28,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1598519517, now seen corresponding path program 81 times [2018-09-26 08:06:28,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:29,442 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:29,442 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:06:29,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:06:29,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:06:29,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:06:29,444 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-09-26 08:06:29,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:29,501 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-09-26 08:06:29,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:06:29,501 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-09-26 08:06:29,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:29,502 INFO L225 Difference]: With dead ends: 88 [2018-09-26 08:06:29,502 INFO L226 Difference]: Without dead ends: 86 [2018-09-26 08:06:29,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:06:29,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-26 08:06:29,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-09-26 08:06:29,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-26 08:06:29,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-26 08:06:29,507 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-09-26 08:06:29,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:29,508 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-26 08:06:29,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:06:29,508 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-26 08:06:29,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-26 08:06:29,509 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:29,509 INFO L375 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-09-26 08:06:29,509 INFO L423 AbstractCegarLoop]: === Iteration 83 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:29,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:29,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1985513088, now seen corresponding path program 82 times [2018-09-26 08:06:29,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:29,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:29,928 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:29,928 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:06:29,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:06:29,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:06:29,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:06:29,929 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-09-26 08:06:29,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:29,997 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-09-26 08:06:29,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:06:29,997 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-09-26 08:06:29,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:29,998 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:06:29,998 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:06:29,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:06:29,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:06:30,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 08:06:30,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:06:30,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-09-26 08:06:30,002 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-09-26 08:06:30,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:30,002 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-09-26 08:06:30,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:06:30,002 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-09-26 08:06:30,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:06:30,003 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:30,003 INFO L375 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-09-26 08:06:30,003 INFO L423 AbstractCegarLoop]: === Iteration 84 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:30,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:30,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1421374147, now seen corresponding path program 83 times [2018-09-26 08:06:30,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:30,351 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:30,351 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:06:30,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:06:30,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:06:30,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:06:30,353 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-09-26 08:06:30,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:30,404 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-26 08:06:30,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:06:30,404 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-09-26 08:06:30,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:30,405 INFO L225 Difference]: With dead ends: 90 [2018-09-26 08:06:30,405 INFO L226 Difference]: Without dead ends: 88 [2018-09-26 08:06:30,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:06:30,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-26 08:06:30,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-09-26 08:06:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-26 08:06:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-09-26 08:06:30,410 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-09-26 08:06:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:30,410 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-09-26 08:06:30,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:06:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-09-26 08:06:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-26 08:06:30,411 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:30,411 INFO L375 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-09-26 08:06:30,411 INFO L423 AbstractCegarLoop]: === Iteration 85 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:30,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:30,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1112936160, now seen corresponding path program 84 times [2018-09-26 08:06:30,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:30,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:30,833 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:30,833 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:06:30,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:06:30,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:06:30,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:06:30,835 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-09-26 08:06:30,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:30,910 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-26 08:06:30,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:06:30,910 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-09-26 08:06:30,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:30,910 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:06:30,911 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:06:30,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:06:30,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:06:30,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-26 08:06:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:06:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-26 08:06:30,915 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-09-26 08:06:30,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:30,915 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-26 08:06:30,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:06:30,915 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-26 08:06:30,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:06:30,916 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:30,916 INFO L375 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-09-26 08:06:30,916 INFO L423 AbstractCegarLoop]: === Iteration 86 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:30,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:30,917 INFO L82 PathProgramCache]: Analyzing trace with hash 141293155, now seen corresponding path program 85 times [2018-09-26 08:06:30,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:31,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:31,276 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:31,276 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:06:31,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:06:31,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:06:31,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:06:31,278 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-09-26 08:06:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:31,325 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-09-26 08:06:31,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:06:31,325 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-09-26 08:06:31,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:31,326 INFO L225 Difference]: With dead ends: 92 [2018-09-26 08:06:31,326 INFO L226 Difference]: Without dead ends: 90 [2018-09-26 08:06:31,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:06:31,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-26 08:06:31,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-09-26 08:06:31,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-26 08:06:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-09-26 08:06:31,331 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-09-26 08:06:31,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:31,331 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-09-26 08:06:31,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:06:31,331 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-09-26 08:06:31,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-26 08:06:31,332 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:31,332 INFO L375 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-09-26 08:06:31,332 INFO L423 AbstractCegarLoop]: === Iteration 87 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:31,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:31,332 INFO L82 PathProgramCache]: Analyzing trace with hash 85131072, now seen corresponding path program 86 times [2018-09-26 08:06:31,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:31,688 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:31,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:06:31,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:06:31,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:06:31,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:06:31,690 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-09-26 08:06:31,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:31,794 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-09-26 08:06:31,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:06:31,794 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-09-26 08:06:31,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:31,795 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:06:31,795 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:06:31,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:06:31,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:06:31,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 08:06:31,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:06:31,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-26 08:06:31,800 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-09-26 08:06:31,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:31,800 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-26 08:06:31,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:06:31,801 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-26 08:06:31,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:06:31,801 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:31,801 INFO L375 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-09-26 08:06:31,801 INFO L423 AbstractCegarLoop]: === Iteration 88 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:31,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:31,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1655893501, now seen corresponding path program 87 times [2018-09-26 08:06:31,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:32,267 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:32,267 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:06:32,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:06:32,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:06:32,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:06:32,268 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-09-26 08:06:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:32,305 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-09-26 08:06:32,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:06:32,305 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-09-26 08:06:32,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:32,306 INFO L225 Difference]: With dead ends: 94 [2018-09-26 08:06:32,306 INFO L226 Difference]: Without dead ends: 92 [2018-09-26 08:06:32,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:06:32,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-26 08:06:32,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-09-26 08:06:32,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-26 08:06:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-09-26 08:06:32,313 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-09-26 08:06:32,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:32,313 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-09-26 08:06:32,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:06:32,314 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-09-26 08:06:32,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-26 08:06:32,314 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:32,314 INFO L375 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-09-26 08:06:32,315 INFO L423 AbstractCegarLoop]: === Iteration 89 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:32,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:32,315 INFO L82 PathProgramCache]: Analyzing trace with hash 206919584, now seen corresponding path program 88 times [2018-09-26 08:06:32,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:32,658 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:32,658 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:06:32,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:06:32,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:06:32,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:06:32,661 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-09-26 08:06:32,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:32,733 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-26 08:06:32,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:06:32,733 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-09-26 08:06:32,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:32,734 INFO L225 Difference]: With dead ends: 95 [2018-09-26 08:06:32,734 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 08:06:32,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:06:32,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 08:06:32,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-26 08:06:32,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:06:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-26 08:06:32,739 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-09-26 08:06:32,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:32,739 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-26 08:06:32,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:06:32,740 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-26 08:06:32,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:06:32,740 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:32,741 INFO L375 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-09-26 08:06:32,741 INFO L423 AbstractCegarLoop]: === Iteration 90 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:32,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:32,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2119550371, now seen corresponding path program 89 times [2018-09-26 08:06:32,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:33,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:33,112 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:33,112 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:06:33,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:06:33,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:06:33,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:06:33,114 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-09-26 08:06:33,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:33,182 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-26 08:06:33,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:06:33,182 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-09-26 08:06:33,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:33,183 INFO L225 Difference]: With dead ends: 96 [2018-09-26 08:06:33,183 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 08:06:33,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:06:33,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 08:06:33,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-09-26 08:06:33,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-26 08:06:33,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-09-26 08:06:33,187 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-09-26 08:06:33,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:33,187 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-09-26 08:06:33,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:06:33,187 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-09-26 08:06:33,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-09-26 08:06:33,188 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:33,188 INFO L375 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-09-26 08:06:33,188 INFO L423 AbstractCegarLoop]: === Iteration 91 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:33,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:33,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1281562624, now seen corresponding path program 90 times [2018-09-26 08:06:33,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:33,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:33,586 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:33,586 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:06:33,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:06:33,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:06:33,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:06:33,587 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-09-26 08:06:33,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:33,631 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-09-26 08:06:33,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:06:33,631 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-09-26 08:06:33,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:33,632 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:06:33,632 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:06:33,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:06:33,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:06:33,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-26 08:06:33,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:06:33,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-09-26 08:06:33,636 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-09-26 08:06:33,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:33,637 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-09-26 08:06:33,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:06:33,637 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-09-26 08:06:33,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:06:33,637 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:33,638 INFO L375 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-09-26 08:06:33,638 INFO L423 AbstractCegarLoop]: === Iteration 92 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:33,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:33,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1073746243, now seen corresponding path program 91 times [2018-09-26 08:06:33,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:34,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:34,020 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:34,020 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:06:34,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:06:34,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:06:34,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:06:34,022 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-09-26 08:06:34,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:34,105 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-09-26 08:06:34,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:06:34,105 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-09-26 08:06:34,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:34,106 INFO L225 Difference]: With dead ends: 98 [2018-09-26 08:06:34,106 INFO L226 Difference]: Without dead ends: 96 [2018-09-26 08:06:34,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:06:34,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-26 08:06:34,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-09-26 08:06:34,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-26 08:06:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-26 08:06:34,109 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-09-26 08:06:34,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:34,110 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-26 08:06:34,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:06:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-26 08:06:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-26 08:06:34,110 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:34,111 INFO L375 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-09-26 08:06:34,111 INFO L423 AbstractCegarLoop]: === Iteration 93 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:34,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:34,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1073594272, now seen corresponding path program 92 times [2018-09-26 08:06:34,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:34,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:34,500 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:34,500 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:06:34,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:06:34,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:06:34,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:06:34,502 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-09-26 08:06:34,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:34,595 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-26 08:06:34,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:06:34,596 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-09-26 08:06:34,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:34,596 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:06:34,596 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:06:34,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:06:34,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:06:34,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-26 08:06:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:06:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-26 08:06:34,601 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-09-26 08:06:34,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:34,601 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-26 08:06:34,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:06:34,601 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-26 08:06:34,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:06:34,602 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:34,602 INFO L375 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-09-26 08:06:34,602 INFO L423 AbstractCegarLoop]: === Iteration 94 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:34,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:34,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1078326499, now seen corresponding path program 93 times [2018-09-26 08:06:34,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:35,156 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:35,156 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:06:35,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:06:35,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:06:35,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:06:35,158 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-09-26 08:06:35,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:35,230 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-26 08:06:35,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:06:35,230 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-09-26 08:06:35,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:35,231 INFO L225 Difference]: With dead ends: 100 [2018-09-26 08:06:35,231 INFO L226 Difference]: Without dead ends: 98 [2018-09-26 08:06:35,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:06:35,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-26 08:06:35,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-09-26 08:06:35,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-26 08:06:35,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-09-26 08:06:35,235 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-09-26 08:06:35,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:35,235 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-09-26 08:06:35,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:06:35,235 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-09-26 08:06:35,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-26 08:06:35,236 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:35,236 INFO L375 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-09-26 08:06:35,236 INFO L423 AbstractCegarLoop]: === Iteration 95 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:35,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:35,236 INFO L82 PathProgramCache]: Analyzing trace with hash -931606336, now seen corresponding path program 94 times [2018-09-26 08:06:35,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:35,601 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:35,601 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:06:35,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:06:35,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:06:35,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:06:35,603 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-09-26 08:06:35,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:35,655 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-09-26 08:06:35,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:06:35,655 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-09-26 08:06:35,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:35,656 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:06:35,656 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:06:35,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 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-09-26 08:06:35,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:06:35,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-26 08:06:35,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:06:35,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-09-26 08:06:35,660 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-09-26 08:06:35,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:35,661 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-09-26 08:06:35,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:06:35,661 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-09-26 08:06:35,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:06:35,662 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:35,662 INFO L375 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-09-26 08:06:35,662 INFO L423 AbstractCegarLoop]: === Iteration 96 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:35,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:35,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1184985219, now seen corresponding path program 95 times [2018-09-26 08:06:35,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:36,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:36,058 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:36,058 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:06:36,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:06:36,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:06:36,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:06:36,060 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-09-26 08:06:36,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:36,108 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-09-26 08:06:36,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:06:36,108 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-09-26 08:06:36,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:36,108 INFO L225 Difference]: With dead ends: 102 [2018-09-26 08:06:36,109 INFO L226 Difference]: Without dead ends: 100 [2018-09-26 08:06:36,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:06:36,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-26 08:06:36,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-26 08:06:36,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 08:06:36,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-09-26 08:06:36,112 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-09-26 08:06:36,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:36,113 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-09-26 08:06:36,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:06:36,113 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-09-26 08:06:36,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-26 08:06:36,113 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:36,113 INFO L375 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-09-26 08:06:36,114 INFO L423 AbstractCegarLoop]: === Iteration 97 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:36,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:36,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1920153312, now seen corresponding path program 96 times [2018-09-26 08:06:36,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:36,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:36,532 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:36,532 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:06:36,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:06:36,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:06:36,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:06:36,534 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-09-26 08:06:36,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:36,597 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-26 08:06:36,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:06:36,597 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-09-26 08:06:36,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:36,598 INFO L225 Difference]: With dead ends: 103 [2018-09-26 08:06:36,598 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:06:36,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:06:36,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:06:36,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-09-26 08:06:36,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:06:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 08:06:36,602 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-09-26 08:06:36,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:36,602 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 08:06:36,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:06:36,602 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 08:06:36,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:06:36,603 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:36,603 INFO L375 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-09-26 08:06:36,603 INFO L423 AbstractCegarLoop]: === Iteration 98 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:36,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:36,604 INFO L82 PathProgramCache]: Analyzing trace with hash 604800035, now seen corresponding path program 97 times [2018-09-26 08:06:36,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:37,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:37,028 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:37,028 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:06:37,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:06:37,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:06:37,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:06:37,030 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-09-26 08:06:37,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:37,089 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-26 08:06:37,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:06:37,089 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-09-26 08:06:37,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:37,090 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:06:37,090 INFO L226 Difference]: Without dead ends: 102 [2018-09-26 08:06:37,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:06:37,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-26 08:06:37,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-09-26 08:06:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-26 08:06:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-09-26 08:06:37,093 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-09-26 08:06:37,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:37,093 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-09-26 08:06:37,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:06:37,094 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-09-26 08:06:37,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-26 08:06:37,094 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:37,094 INFO L375 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-09-26 08:06:37,095 INFO L423 AbstractCegarLoop]: === Iteration 99 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:37,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:37,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1568942464, now seen corresponding path program 98 times [2018-09-26 08:06:37,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:37,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:37,596 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:37,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:06:37,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:06:37,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:06:37,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:06:37,597 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-09-26 08:06:37,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:37,663 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-26 08:06:37,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:06:37,663 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-09-26 08:06:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:37,664 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:06:37,664 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:06:37,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:06:37,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:06:37,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-26 08:06:37,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:06:37,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-09-26 08:06:37,667 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-09-26 08:06:37,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:37,667 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-09-26 08:06:37,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:06:37,667 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-09-26 08:06:37,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:06:37,668 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:37,668 INFO L375 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-09-26 08:06:37,668 INFO L423 AbstractCegarLoop]: === Iteration 100 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:37,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:37,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1392586691, now seen corresponding path program 99 times [2018-09-26 08:06:37,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:38,083 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:38,083 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:06:38,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:06:38,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:06:38,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:06:38,085 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-09-26 08:06:38,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:38,155 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-09-26 08:06:38,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:06:38,155 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-09-26 08:06:38,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:38,156 INFO L225 Difference]: With dead ends: 106 [2018-09-26 08:06:38,156 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 08:06:38,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:06:38,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 08:06:38,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-09-26 08:06:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-26 08:06:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-09-26 08:06:38,161 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-09-26 08:06:38,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:38,162 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-09-26 08:06:38,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:06:38,162 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-09-26 08:06:38,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-26 08:06:38,162 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:38,163 INFO L375 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-09-26 08:06:38,163 INFO L423 AbstractCegarLoop]: === Iteration 101 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:38,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:38,163 INFO L82 PathProgramCache]: Analyzing trace with hash 220525024, now seen corresponding path program 100 times [2018-09-26 08:06:38,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:38,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:38,611 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:38,611 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:06:38,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:06:38,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:06:38,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:06:38,613 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-09-26 08:06:38,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:38,685 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-26 08:06:38,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:06:38,686 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-09-26 08:06:38,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:38,687 INFO L225 Difference]: With dead ends: 107 [2018-09-26 08:06:38,687 INFO L226 Difference]: Without dead ends: 105 [2018-09-26 08:06:38,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:06:38,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-26 08:06:38,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-09-26 08:06:38,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:06:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-26 08:06:38,692 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-09-26 08:06:38,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:38,692 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-26 08:06:38,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:06:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-26 08:06:38,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:06:38,693 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:38,693 INFO L375 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-09-26 08:06:38,693 INFO L423 AbstractCegarLoop]: === Iteration 102 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:38,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:38,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1753648285, now seen corresponding path program 101 times [2018-09-26 08:06:38,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:39,113 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:39,113 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:06:39,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:06:39,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:06:39,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:06:39,115 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-09-26 08:06:39,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:39,184 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-09-26 08:06:39,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:06:39,184 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-09-26 08:06:39,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:39,185 INFO L225 Difference]: With dead ends: 108 [2018-09-26 08:06:39,185 INFO L226 Difference]: Without dead ends: 106 [2018-09-26 08:06:39,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:06:39,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-26 08:06:39,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-09-26 08:06:39,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-26 08:06:39,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-09-26 08:06:39,190 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-09-26 08:06:39,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:39,191 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-09-26 08:06:39,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:06:39,191 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-09-26 08:06:39,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-26 08:06:39,192 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:39,192 INFO L375 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-09-26 08:06:39,192 INFO L423 AbstractCegarLoop]: === Iteration 103 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:39,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:39,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1471488576, now seen corresponding path program 102 times [2018-09-26 08:06:39,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:39,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:39,743 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:39,743 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:06:39,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:06:39,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:06:39,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:06:39,745 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-09-26 08:06:39,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:39,856 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-09-26 08:06:39,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 08:06:39,856 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-09-26 08:06:39,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:39,857 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:06:39,857 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:06:39,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:06:39,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:06:39,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-26 08:06:39,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:06:39,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-09-26 08:06:39,861 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-09-26 08:06:39,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:39,862 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-09-26 08:06:39,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:06:39,862 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-09-26 08:06:39,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:06:39,862 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:39,863 INFO L375 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-09-26 08:06:39,863 INFO L423 AbstractCegarLoop]: === Iteration 104 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:39,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:39,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1628483837, now seen corresponding path program 103 times [2018-09-26 08:06:39,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:40,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:40,493 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:40,493 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:06:40,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:06:40,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:06:40,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:06:40,496 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-09-26 08:06:40,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:40,613 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-09-26 08:06:40,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:06:40,613 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-09-26 08:06:40,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:40,614 INFO L225 Difference]: With dead ends: 110 [2018-09-26 08:06:40,614 INFO L226 Difference]: Without dead ends: 108 [2018-09-26 08:06:40,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:06:40,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-09-26 08:06:40,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-09-26 08:06:40,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-09-26 08:06:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-09-26 08:06:40,620 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-09-26 08:06:40,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:40,620 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-09-26 08:06:40,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:06:40,620 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-09-26 08:06:40,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-26 08:06:40,621 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:40,621 INFO L375 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-09-26 08:06:40,622 INFO L423 AbstractCegarLoop]: === Iteration 105 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:40,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:40,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1056619168, now seen corresponding path program 104 times [2018-09-26 08:06:40,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:41,141 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:41,142 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-09-26 08:06:41,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-09-26 08:06:41,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-09-26 08:06:41,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:06:41,143 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-09-26 08:06:41,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:41,225 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-26 08:06:41,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 08:06:41,226 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-09-26 08:06:41,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:41,226 INFO L225 Difference]: With dead ends: 111 [2018-09-26 08:06:41,227 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 08:06:41,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:06:41,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 08:06:41,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 08:06:41,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 08:06:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-26 08:06:41,232 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-09-26 08:06:41,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:41,232 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-26 08:06:41,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-09-26 08:06:41,232 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-26 08:06:41,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 08:06:41,233 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:41,233 INFO L375 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-09-26 08:06:41,233 INFO L423 AbstractCegarLoop]: === Iteration 106 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:41,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:41,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1604533597, now seen corresponding path program 105 times [2018-09-26 08:06:41,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:41,679 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:41,679 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:06:41,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:06:41,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:06:41,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:06:41,681 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-09-26 08:06:41,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:41,732 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-09-26 08:06:41,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:06:41,732 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-09-26 08:06:41,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:41,733 INFO L225 Difference]: With dead ends: 112 [2018-09-26 08:06:41,733 INFO L226 Difference]: Without dead ends: 110 [2018-09-26 08:06:41,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:06:41,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-26 08:06:41,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-09-26 08:06:41,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-09-26 08:06:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-09-26 08:06:41,737 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-09-26 08:06:41,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:41,738 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-09-26 08:06:41,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:06:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-09-26 08:06:41,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-09-26 08:06:41,738 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:41,739 INFO L375 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-09-26 08:06:41,739 INFO L423 AbstractCegarLoop]: === Iteration 107 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:41,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:41,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1799076608, now seen corresponding path program 106 times [2018-09-26 08:06:41,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:42,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:42,199 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:42,199 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-09-26 08:06:42,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-26 08:06:42,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-26 08:06:42,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:06:42,201 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-09-26 08:06:42,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:42,311 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-09-26 08:06:42,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:06:42,311 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-09-26 08:06:42,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:42,311 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:06:42,311 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 08:06:42,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:06:42,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 08:06:42,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-26 08:06:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 08:06:42,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-09-26 08:06:42,316 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-09-26 08:06:42,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:42,317 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-09-26 08:06:42,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-26 08:06:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-09-26 08:06:42,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:06:42,318 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:42,318 INFO L375 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-09-26 08:06:42,318 INFO L423 AbstractCegarLoop]: === Iteration 108 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:42,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:42,318 INFO L82 PathProgramCache]: Analyzing trace with hash -63189437, now seen corresponding path program 107 times [2018-09-26 08:06:42,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:42,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:42,790 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:42,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:06:42,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:06:42,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:06:42,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:06:42,793 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-09-26 08:06:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:42,934 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-09-26 08:06:42,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:06:42,935 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-09-26 08:06:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:42,935 INFO L225 Difference]: With dead ends: 114 [2018-09-26 08:06:42,935 INFO L226 Difference]: Without dead ends: 112 [2018-09-26 08:06:42,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:06:42,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-09-26 08:06:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-09-26 08:06:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-26 08:06:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-09-26 08:06:42,941 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-09-26 08:06:42,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:42,941 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-09-26 08:06:42,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:06:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-09-26 08:06:42,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-26 08:06:42,942 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:42,942 INFO L375 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-09-26 08:06:42,942 INFO L423 AbstractCegarLoop]: === Iteration 109 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:42,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:42,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1958861984, now seen corresponding path program 108 times [2018-09-26 08:06:42,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:43,458 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:43,458 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-09-26 08:06:43,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-09-26 08:06:43,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-09-26 08:06:43,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:06:43,460 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-09-26 08:06:43,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:43,607 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-26 08:06:43,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 08:06:43,607 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-09-26 08:06:43,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:43,608 INFO L225 Difference]: With dead ends: 115 [2018-09-26 08:06:43,608 INFO L226 Difference]: Without dead ends: 113 [2018-09-26 08:06:43,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:06:43,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-26 08:06:43,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-26 08:06:43,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 08:06:43,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-26 08:06:43,612 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-09-26 08:06:43,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:43,613 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-26 08:06:43,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-09-26 08:06:43,613 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-26 08:06:43,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:06:43,613 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:43,614 INFO L375 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-09-26 08:06:43,614 INFO L423 AbstractCegarLoop]: === Iteration 110 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:43,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:43,614 INFO L82 PathProgramCache]: Analyzing trace with hash -595168797, now seen corresponding path program 109 times [2018-09-26 08:06:43,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:44,066 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:44,066 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:06:44,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:06:44,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:06:44,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:06:44,069 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-09-26 08:06:44,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:44,191 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-09-26 08:06:44,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:06:44,191 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-09-26 08:06:44,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:44,191 INFO L225 Difference]: With dead ends: 116 [2018-09-26 08:06:44,191 INFO L226 Difference]: Without dead ends: 114 [2018-09-26 08:06:44,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:06:44,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-26 08:06:44,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-09-26 08:06:44,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-09-26 08:06:44,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-09-26 08:06:44,195 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-09-26 08:06:44,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:44,195 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-09-26 08:06:44,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:06:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-09-26 08:06:44,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-09-26 08:06:44,196 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:44,196 INFO L375 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-09-26 08:06:44,196 INFO L423 AbstractCegarLoop]: === Iteration 111 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:44,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:44,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1270352960, now seen corresponding path program 110 times [2018-09-26 08:06:44,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:44,660 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:44,660 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-09-26 08:06:44,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-09-26 08:06:44,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-09-26 08:06:44,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:06:44,662 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2018-09-26 08:06:44,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:44,751 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-09-26 08:06:44,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:06:44,751 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2018-09-26 08:06:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:44,752 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:06:44,752 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:06:44,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:06:44,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:06:44,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-26 08:06:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:06:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-09-26 08:06:44,757 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-09-26 08:06:44,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:44,757 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-09-26 08:06:44,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-09-26 08:06:44,757 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-09-26 08:06:44,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:06:44,758 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:44,758 INFO L375 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2018-09-26 08:06:44,758 INFO L423 AbstractCegarLoop]: === Iteration 112 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:44,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:44,759 INFO L82 PathProgramCache]: Analyzing trace with hash -726225533, now seen corresponding path program 111 times [2018-09-26 08:06:44,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:45,580 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:45,580 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:06:45,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:06:45,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:06:45,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:06:45,584 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2018-09-26 08:06:45,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:45,816 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-09-26 08:06:45,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:06:45,816 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2018-09-26 08:06:45,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:45,817 INFO L225 Difference]: With dead ends: 118 [2018-09-26 08:06:45,817 INFO L226 Difference]: Without dead ends: 116 [2018-09-26 08:06:45,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:06:45,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-09-26 08:06:45,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-09-26 08:06:45,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-26 08:06:45,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-09-26 08:06:45,822 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-09-26 08:06:45,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:45,823 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-09-26 08:06:45,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:06:45,823 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-09-26 08:06:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-26 08:06:45,824 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:45,824 INFO L375 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2018-09-26 08:06:45,824 INFO L423 AbstractCegarLoop]: === Iteration 113 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:45,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:45,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1038144480, now seen corresponding path program 112 times [2018-09-26 08:06:45,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:48,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 1 proven. 6272 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-09-26 08:06:48,082 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:48,085 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:06:48,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:06:48,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:06:48,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10711, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:06:48,088 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 105 states. [2018-09-26 08:06:49,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:49,822 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-09-26 08:06:49,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:06:49,822 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 115 [2018-09-26 08:06:49,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:49,823 INFO L225 Difference]: With dead ends: 116 [2018-09-26 08:06:49,823 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:06:49,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=214, Invalid=10916, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:06:49,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:06:49,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:06:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:06:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:06:49,825 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2018-09-26 08:06:49,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:49,825 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:06:49,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:06:49,825 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:06:49,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:06:49,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:06:50,086 WARN L178 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 1047 [2018-09-26 08:06:51,599 WARN L178 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 1047 DAG size of output: 913 [2018-09-26 08:06:51,610 INFO L426 ceAbstractionStarter]: For program point L30(lines 30 32) no Hoare annotation was computed. [2018-09-26 08:06:51,610 INFO L426 ceAbstractionStarter]: For program point L30-2(lines 27 33) no Hoare annotation was computed. [2018-09-26 08:06:51,610 INFO L426 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-09-26 08:06:51,610 INFO L426 ceAbstractionStarter]: For program point L26-1(lines 26 33) no Hoare annotation was computed. [2018-09-26 08:06:51,639 INFO L422 ceAbstractionStarter]: At program point L25-1(lines 25 37) the Hoare annotation is: (or (and (<= (+ GateController_time 568) GateController_thousand) (let ((.cse0 (+ GateController_gate 52))) (and (<= .cse0 GateController_hundred) (<= GateController_hundred .cse0)))) (and (let ((.cse1 (+ GateController_gate 33))) (and (<= .cse1 GateController_hundred) (<= GateController_hundred .cse1))) (<= (+ GateController_time 397) GateController_thousand)) (and (let ((.cse2 (+ GateController_gate 7))) (and (<= GateController_hundred .cse2) (<= .cse2 GateController_hundred))) (<= (+ GateController_time 163) GateController_thousand)) (and (let ((.cse3 (+ GateController_gate 32))) (and (<= .cse3 GateController_hundred) (<= GateController_hundred .cse3))) (<= (+ GateController_time 388) GateController_thousand)) (and (let ((.cse4 (+ GateController_gate 74))) (and (<= .cse4 GateController_hundred) (<= GateController_hundred .cse4))) (<= (+ GateController_time 766) GateController_thousand)) (and (<= (+ GateController_time 631) GateController_thousand) (let ((.cse5 (+ GateController_gate 59))) (and (<= GateController_hundred .cse5) (<= .cse5 GateController_hundred)))) (and (let ((.cse6 (+ GateController_gate 13))) (and (<= GateController_hundred .cse6) (<= .cse6 GateController_hundred))) (<= (+ GateController_time 217) GateController_thousand)) (and (let ((.cse7 (+ GateController_gate 11))) (and (<= .cse7 GateController_hundred) (<= GateController_hundred .cse7))) (<= (+ GateController_time 199) GateController_thousand)) (and (let ((.cse8 (+ GateController_gate 95))) (and (<= GateController_hundred .cse8) (<= .cse8 GateController_hundred))) (<= (+ GateController_time 955) GateController_thousand)) (and (<= (+ GateController_time 271) GateController_thousand) (let ((.cse9 (+ GateController_gate 19))) (and (<= GateController_hundred .cse9) (<= .cse9 GateController_hundred)))) (and (<= (+ GateController_time 883) GateController_thousand) (let ((.cse10 (+ GateController_gate 87))) (and (<= GateController_hundred .cse10) (<= .cse10 GateController_hundred)))) (and (let ((.cse11 (+ GateController_gate 81))) (and (<= .cse11 GateController_hundred) (<= GateController_hundred .cse11))) (<= (+ GateController_time 829) GateController_thousand)) (and (<= (+ GateController_time 415) GateController_thousand) (let ((.cse12 (+ GateController_gate 35))) (and (<= .cse12 GateController_hundred) (<= GateController_hundred .cse12)))) (and (<= (+ GateController_time 667) GateController_thousand) (let ((.cse13 (+ GateController_gate 63))) (and (<= GateController_hundred .cse13) (<= .cse13 GateController_hundred)))) (and (<= (+ GateController_time 244) GateController_thousand) (let ((.cse14 (+ GateController_gate 16))) (and (<= GateController_hundred .cse14) (<= .cse14 GateController_hundred)))) (and (<= (+ GateController_time 172) GateController_thousand) (let ((.cse15 (+ GateController_gate 8))) (and (<= GateController_hundred .cse15) (<= .cse15 GateController_hundred)))) (and (let ((.cse16 (+ GateController_gate 28))) (and (<= .cse16 GateController_hundred) (<= GateController_hundred .cse16))) (<= (+ GateController_time 352) GateController_thousand)) (and (<= (+ GateController_time 919) GateController_thousand) (let ((.cse17 (+ GateController_gate 91))) (and (<= .cse17 GateController_hundred) (<= GateController_hundred .cse17)))) (and (let ((.cse18 (+ GateController_gate 41))) (and (<= GateController_hundred .cse18) (<= .cse18 GateController_hundred))) (<= (+ GateController_time 469) GateController_thousand)) (and (<= (+ GateController_time 325) GateController_thousand) (let ((.cse19 (+ GateController_gate 25))) (and (<= .cse19 GateController_hundred) (<= GateController_hundred .cse19)))) (and (let ((.cse20 (+ GateController_gate 66))) (and (<= .cse20 GateController_hundred) (<= GateController_hundred .cse20))) (<= (+ GateController_time 694) GateController_thousand)) (and (let ((.cse21 (+ GateController_gate 18))) (and (<= GateController_hundred .cse21) (<= .cse21 GateController_hundred))) (<= (+ GateController_time 262) GateController_thousand)) (and (let ((.cse22 (+ GateController_gate 42))) (and (<= GateController_hundred .cse22) (<= .cse22 GateController_hundred))) (<= (+ GateController_time 478) GateController_thousand)) (and (<= (+ GateController_time 775) GateController_thousand) (let ((.cse23 (+ GateController_gate 75))) (and (<= .cse23 GateController_hundred) (<= GateController_hundred .cse23)))) (and (let ((.cse24 (+ GateController_gate 6))) (and (<= GateController_hundred .cse24) (<= .cse24 GateController_hundred))) (<= (+ GateController_time 154) GateController_thousand)) (and (<= (+ GateController_time 235) GateController_thousand) (let ((.cse25 (+ GateController_gate 15))) (and (<= .cse25 GateController_hundred) (<= GateController_hundred .cse25)))) (and (<= (+ GateController_time 550) GateController_thousand) (let ((.cse26 (+ GateController_gate 50))) (and (<= GateController_hundred .cse26) (<= .cse26 GateController_hundred)))) (and (<= (+ GateController_time 541) GateController_thousand) (let ((.cse27 (+ GateController_gate 49))) (and (<= GateController_hundred .cse27) (<= .cse27 GateController_hundred)))) (and (<= (+ GateController_time 811) GateController_thousand) (let ((.cse28 (+ GateController_gate 79))) (and (<= GateController_hundred .cse28) (<= .cse28 GateController_hundred)))) (and (<= (+ GateController_time 802) GateController_thousand) (let ((.cse29 (+ GateController_gate 78))) (and (<= GateController_hundred .cse29) (<= .cse29 GateController_hundred)))) (and (<= (+ GateController_time 361) GateController_thousand) (let ((.cse30 (+ GateController_gate 29))) (and (<= GateController_hundred .cse30) (<= .cse30 GateController_hundred)))) (and (<= (+ GateController_time 946) GateController_thousand) (let ((.cse31 (+ GateController_gate 94))) (and (<= .cse31 GateController_hundred) (<= GateController_hundred .cse31)))) (and (let ((.cse32 (+ GateController_gate 20))) (and (<= GateController_hundred .cse32) (<= .cse32 GateController_hundred))) (<= (+ GateController_time 280) GateController_thousand)) (and (let ((.cse33 (+ GateController_gate 37))) (and (<= .cse33 GateController_hundred) (<= GateController_hundred .cse33))) (<= (+ GateController_time 433) GateController_thousand)) (and (let ((.cse34 (+ GateController_gate 76))) (and (<= GateController_hundred .cse34) (<= .cse34 GateController_hundred))) (<= (+ GateController_time 784) GateController_thousand)) (and (<= (+ GateController_time 253) GateController_thousand) (let ((.cse35 (+ GateController_gate 17))) (and (<= .cse35 GateController_hundred) (<= GateController_hundred .cse35)))) (and (<= (+ GateController_time 892) GateController_thousand) (let ((.cse36 (+ GateController_gate 88))) (and (<= .cse36 GateController_hundred) (<= GateController_hundred .cse36)))) (and (let ((.cse37 (+ GateController_gate 38))) (and (<= GateController_hundred .cse37) (<= .cse37 GateController_hundred))) (<= (+ GateController_time 442) GateController_thousand)) (and (<= (+ GateController_time 982) GateController_thousand) (let ((.cse38 (+ GateController_gate 98))) (and (<= GateController_hundred .cse38) (<= .cse38 GateController_hundred)))) (and (<= (+ GateController_time 190) GateController_thousand) (let ((.cse39 (+ GateController_gate 10))) (and (<= GateController_hundred .cse39) (<= .cse39 GateController_hundred)))) (and (<= (+ GateController_time 559) GateController_thousand) (let ((.cse40 (+ GateController_gate 51))) (and (<= GateController_hundred .cse40) (<= .cse40 GateController_hundred)))) (and (<= (+ GateController_time 118) GateController_thousand) (let ((.cse41 (+ GateController_gate 2))) (and (<= GateController_hundred .cse41) (<= .cse41 GateController_hundred)))) (and (let ((.cse42 (+ GateController_gate 60))) (and (<= .cse42 GateController_hundred) (<= GateController_hundred .cse42))) (<= (+ GateController_time 640) GateController_thousand)) (and (<= (+ GateController_time 298) GateController_thousand) (let ((.cse43 (+ GateController_gate 22))) (and (<= GateController_hundred .cse43) (<= .cse43 GateController_hundred)))) (and (let ((.cse44 (+ GateController_gate 90))) (and (<= GateController_hundred .cse44) (<= .cse44 GateController_hundred))) (<= (+ GateController_time 910) GateController_thousand)) (and (<= (+ GateController_time 514) GateController_thousand) (let ((.cse45 (+ GateController_gate 46))) (and (<= GateController_hundred .cse45) (<= .cse45 GateController_hundred)))) (and (let ((.cse46 (+ GateController_gate 92))) (and (<= .cse46 GateController_hundred) (<= GateController_hundred .cse46))) (<= (+ GateController_time 928) GateController_thousand)) (and (let ((.cse47 (+ GateController_gate 47))) (and (<= .cse47 GateController_hundred) (<= GateController_hundred .cse47))) (<= (+ GateController_time 523) GateController_thousand)) (and (<= (+ GateController_time 721) GateController_thousand) (let ((.cse48 (+ GateController_gate 69))) (and (<= .cse48 GateController_hundred) (<= GateController_hundred .cse48)))) (and (let ((.cse49 (+ GateController_gate 64))) (and (<= GateController_hundred .cse49) (<= .cse49 GateController_hundred))) (<= (+ GateController_time 676) GateController_thousand)) (and (let ((.cse50 (+ GateController_gate 57))) (and (<= .cse50 GateController_hundred) (<= GateController_hundred .cse50))) (<= (+ GateController_time 613) GateController_thousand)) (and (<= (+ GateController_time 379) GateController_thousand) (let ((.cse51 (+ GateController_gate 31))) (and (<= .cse51 GateController_hundred) (<= GateController_hundred .cse51)))) (and (<= (+ GateController_time 712) GateController_thousand) (let ((.cse52 (+ GateController_gate 68))) (and (<= .cse52 GateController_hundred) (<= GateController_hundred .cse52)))) (and (let ((.cse53 (+ GateController_gate 36))) (and (<= GateController_hundred .cse53) (<= .cse53 GateController_hundred))) (<= (+ GateController_time 424) GateController_thousand)) (and (let ((.cse54 (+ GateController_gate 14))) (and (<= .cse54 GateController_hundred) (<= GateController_hundred .cse54))) (<= (+ GateController_time 226) GateController_thousand)) (and (<= (+ GateController_time 208) GateController_thousand) (let ((.cse55 (+ GateController_gate 12))) (and (<= GateController_hundred .cse55) (<= .cse55 GateController_hundred)))) (and (let ((.cse56 (+ GateController_gate 85))) (and (<= GateController_hundred .cse56) (<= .cse56 GateController_hundred))) (<= (+ GateController_time 865) GateController_thousand)) (and (let ((.cse57 (+ GateController_gate 27))) (and (<= GateController_hundred .cse57) (<= .cse57 GateController_hundred))) (<= (+ GateController_time 343) GateController_thousand)) (and (<= (+ GateController_time 964) GateController_thousand) (let ((.cse58 (+ GateController_gate 96))) (and (<= .cse58 GateController_hundred) (<= GateController_hundred .cse58)))) (and (<= (+ GateController_time 604) GateController_thousand) (let ((.cse59 (+ GateController_gate 56))) (and (<= .cse59 GateController_hundred) (<= GateController_hundred .cse59)))) (and (let ((.cse60 (+ GateController_gate 53))) (and (<= .cse60 GateController_hundred) (<= GateController_hundred .cse60))) (<= (+ GateController_time 577) GateController_thousand)) (and (<= (+ GateController_time 730) GateController_thousand) (let ((.cse61 (+ GateController_gate 70))) (and (<= .cse61 GateController_hundred) (<= GateController_hundred .cse61)))) (and (let ((.cse62 (+ GateController_gate 84))) (and (<= GateController_hundred .cse62) (<= .cse62 GateController_hundred))) (<= (+ GateController_time 856) GateController_thousand)) (and (let ((.cse63 (+ GateController_gate 99))) (and (<= GateController_hundred .cse63) (<= .cse63 GateController_hundred))) (<= (+ GateController_time 991) GateController_thousand)) (and (let ((.cse64 (+ GateController_gate 61))) (and (<= .cse64 GateController_hundred) (<= GateController_hundred .cse64))) (<= (+ GateController_time 649) GateController_thousand)) (and (let ((.cse65 (+ GateController_gate 55))) (and (<= GateController_hundred .cse65) (<= .cse65 GateController_hundred))) (<= (+ GateController_time 595) GateController_thousand)) (let ((.cse66 (and (<= GateController_hundred GateController_gate) (<= GateController_gate GateController_hundred)))) (and (or GateController_gateMotorFailure .cse66) (or GateController_alarmTrain .cse66))) (and (let ((.cse67 (+ GateController_gate 62))) (and (<= GateController_hundred .cse67) (<= .cse67 GateController_hundred))) (<= (+ GateController_time 658) GateController_thousand)) (and (let ((.cse68 (+ GateController_gate 45))) (and (<= .cse68 GateController_hundred) (<= GateController_hundred .cse68))) (<= (+ GateController_time 505) GateController_thousand)) (and (let ((.cse69 (+ GateController_gate 97))) (and (<= GateController_hundred .cse69) (<= .cse69 GateController_hundred))) (<= (+ GateController_time 973) GateController_thousand)) (and (<= (+ GateController_time 793) GateController_thousand) (let ((.cse70 (+ GateController_gate 77))) (and (<= .cse70 GateController_hundred) (<= GateController_hundred .cse70)))) (and (let ((.cse71 (+ GateController_gate 71))) (and (<= GateController_hundred .cse71) (<= .cse71 GateController_hundred))) (<= (+ GateController_time 739) GateController_thousand)) (and (let ((.cse72 (+ GateController_gate 73))) (and (<= .cse72 GateController_hundred) (<= GateController_hundred .cse72))) (<= (+ GateController_time 757) GateController_thousand)) (and (<= (+ GateController_time 496) GateController_thousand) (let ((.cse73 (+ GateController_gate 44))) (and (<= GateController_hundred .cse73) (<= .cse73 GateController_hundred)))) (and (let ((.cse74 (+ GateController_gate 54))) (and (<= .cse74 GateController_hundred) (<= GateController_hundred .cse74))) (<= (+ GateController_time 586) GateController_thousand)) (and (<= (+ GateController_time 820) GateController_thousand) (let ((.cse75 (+ GateController_gate 80))) (and (<= GateController_hundred .cse75) (<= .cse75 GateController_hundred)))) (and (<= (+ GateController_time 181) GateController_thousand) (let ((.cse76 (+ GateController_gate 9))) (and (<= GateController_hundred .cse76) (<= .cse76 GateController_hundred)))) (and (<= (+ GateController_time 136) GateController_thousand) (let ((.cse77 (+ GateController_gate 4))) (and (<= GateController_hundred .cse77) (<= .cse77 GateController_hundred)))) (and (let ((.cse78 (+ GateController_gate 82))) (and (<= GateController_hundred .cse78) (<= .cse78 GateController_hundred))) (<= (+ GateController_time 838) GateController_thousand)) (and (let ((.cse79 (+ GateController_gate 86))) (and (<= .cse79 GateController_hundred) (<= GateController_hundred .cse79))) (<= (+ GateController_time 874) GateController_thousand)) (and (let ((.cse80 (+ GateController_gate 26))) (and (<= .cse80 GateController_hundred) (<= GateController_hundred .cse80))) (<= (+ GateController_time 334) GateController_thousand)) (let ((.cse81 (+ GateController_gate 100))) (and (<= (+ GateController_time 1000) GateController_thousand) (<= GateController_hundred .cse81) (<= .cse81 GateController_hundred))) (and (let ((.cse82 (+ GateController_gate 67))) (and (<= .cse82 GateController_hundred) (<= GateController_hundred .cse82))) (<= (+ GateController_time 703) GateController_thousand)) (and (<= (+ GateController_time 145) GateController_thousand) (let ((.cse83 (+ GateController_gate 5))) (and (<= .cse83 GateController_hundred) (<= GateController_hundred .cse83)))) (and (<= (+ GateController_time 406) GateController_thousand) (let ((.cse84 (+ GateController_gate 34))) (and (<= .cse84 GateController_hundred) (<= GateController_hundred .cse84)))) (and (let ((.cse85 (+ GateController_gate 3))) (and (<= .cse85 GateController_hundred) (<= GateController_hundred .cse85))) (<= (+ GateController_time 127) GateController_thousand)) (and (<= (+ GateController_time 109) GateController_thousand) (or (let ((.cse86 (+ GateController_gate 1))) (and (<= .cse86 GateController_hundred) (<= GateController_hundred .cse86))) GateController_gateMotorFailure)) (and (<= (+ GateController_time 622) GateController_thousand) (let ((.cse87 (+ GateController_gate 58))) (and (<= .cse87 GateController_hundred) (<= GateController_hundred .cse87)))) (and (let ((.cse88 (+ GateController_gate 21))) (and (<= GateController_hundred .cse88) (<= .cse88 GateController_hundred))) (<= (+ GateController_time 289) GateController_thousand)) (and (let ((.cse89 (+ GateController_gate 93))) (and (<= .cse89 GateController_hundred) (<= GateController_hundred .cse89))) (<= (+ GateController_time 937) GateController_thousand)) (and (<= (+ GateController_time 901) GateController_thousand) (let ((.cse90 (+ GateController_gate 89))) (and (<= GateController_hundred .cse90) (<= .cse90 GateController_hundred)))) (and (<= (+ GateController_time 847) GateController_thousand) (let ((.cse91 (+ GateController_gate 83))) (and (<= .cse91 GateController_hundred) (<= GateController_hundred .cse91)))) (and (<= (+ GateController_time 532) GateController_thousand) (let ((.cse92 (+ GateController_gate 48))) (and (<= .cse92 GateController_hundred) (<= GateController_hundred .cse92)))) (and (<= (+ GateController_time 451) GateController_thousand) (let ((.cse93 (+ GateController_gate 39))) (and (<= .cse93 GateController_hundred) (<= GateController_hundred .cse93)))) (and (let ((.cse94 (+ GateController_gate 43))) (and (<= .cse94 GateController_hundred) (<= GateController_hundred .cse94))) (<= (+ GateController_time 487) GateController_thousand)) (and (<= (+ GateController_time 316) GateController_thousand) (let ((.cse95 (+ GateController_gate 24))) (and (<= GateController_hundred .cse95) (<= .cse95 GateController_hundred)))) (and (let ((.cse96 (+ GateController_gate 30))) (and (<= GateController_hundred .cse96) (<= .cse96 GateController_hundred))) (<= (+ GateController_time 370) GateController_thousand)) (and (<= (+ GateController_time 307) GateController_thousand) (let ((.cse97 (+ GateController_gate 23))) (and (<= GateController_hundred .cse97) (<= .cse97 GateController_hundred)))) (and (<= (+ GateController_time 460) GateController_thousand) (let ((.cse98 (+ GateController_gate 40))) (and (<= GateController_hundred .cse98) (<= .cse98 GateController_hundred)))) (and (let ((.cse99 (+ GateController_gate 72))) (and (<= GateController_hundred .cse99) (<= .cse99 GateController_hundred))) (<= (+ GateController_time 748) GateController_thousand)) (and (let ((.cse100 (+ GateController_gate 65))) (and (<= .cse100 GateController_hundred) (<= GateController_hundred .cse100))) (<= (+ GateController_time 685) GateController_thousand))) [2018-09-26 08:06:51,640 INFO L429 ceAbstractionStarter]: At program point GateControllerEXIT(lines 10 40) the Hoare annotation is: true [2018-09-26 08:06:51,640 INFO L429 ceAbstractionStarter]: At program point GateControllerENTRY(lines 10 40) the Hoare annotation is: true [2018-09-26 08:06:51,641 INFO L422 ceAbstractionStarter]: At program point GateControllerErr0ASSERT_VIOLATIONASSERT(line 39) the Hoare annotation is: false [2018-09-26 08:06:51,641 INFO L422 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (and (<= GateController_hundred GateController_gate) (<= GateController_gate GateController_hundred)))) (and (or GateController_gateMotorFailure .cse0) (or GateController_alarmTrain .cse0))) [2018-09-26 08:06:51,641 INFO L426 ceAbstractionStarter]: For program point GateControllerFINAL(lines 10 40) no Hoare annotation was computed. [2018-09-26 08:06:51,705 INFO L202 PluginConnector]: Adding new model RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:06:51 BoogieIcfgContainer [2018-09-26 08:06:51,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:06:51,706 INFO L168 Benchmark]: Toolchain (without parser) took 47630.64 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -466.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-09-26 08:06:51,707 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:06:51,707 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:06:51,711 INFO L168 Benchmark]: Boogie Preprocessor took 22.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:06:51,711 INFO L168 Benchmark]: RCFGBuilder took 301.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:06:51,712 INFO L168 Benchmark]: TraceAbstraction took 47259.11 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -476.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-09-26 08:06:51,718 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.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 301.65 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 47259.11 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -476.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: 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: 25]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((time + 568 <= thousand && gate + 52 <= hundred && hundred <= gate + 52) || ((gate + 33 <= hundred && hundred <= gate + 33) && time + 397 <= thousand)) || ((hundred <= gate + 7 && gate + 7 <= hundred) && time + 163 <= thousand)) || ((gate + 32 <= hundred && hundred <= gate + 32) && time + 388 <= thousand)) || ((gate + 74 <= hundred && hundred <= gate + 74) && time + 766 <= thousand)) || (time + 631 <= thousand && hundred <= gate + 59 && gate + 59 <= hundred)) || ((hundred <= gate + 13 && gate + 13 <= hundred) && time + 217 <= thousand)) || ((gate + 11 <= hundred && hundred <= gate + 11) && time + 199 <= thousand)) || ((hundred <= gate + 95 && gate + 95 <= hundred) && time + 955 <= thousand)) || (time + 271 <= thousand && hundred <= gate + 19 && gate + 19 <= hundred)) || (time + 883 <= thousand && hundred <= gate + 87 && gate + 87 <= hundred)) || ((gate + 81 <= hundred && hundred <= gate + 81) && time + 829 <= thousand)) || (time + 415 <= thousand && gate + 35 <= hundred && hundred <= gate + 35)) || (time + 667 <= thousand && hundred <= gate + 63 && gate + 63 <= hundred)) || (time + 244 <= thousand && hundred <= gate + 16 && gate + 16 <= hundred)) || (time + 172 <= thousand && hundred <= gate + 8 && gate + 8 <= hundred)) || ((gate + 28 <= hundred && hundred <= gate + 28) && time + 352 <= thousand)) || (time + 919 <= thousand && gate + 91 <= hundred && hundred <= gate + 91)) || ((hundred <= gate + 41 && gate + 41 <= hundred) && time + 469 <= thousand)) || (time + 325 <= thousand && gate + 25 <= hundred && hundred <= gate + 25)) || ((gate + 66 <= hundred && hundred <= gate + 66) && time + 694 <= thousand)) || ((hundred <= gate + 18 && gate + 18 <= hundred) && time + 262 <= thousand)) || ((hundred <= gate + 42 && gate + 42 <= hundred) && time + 478 <= thousand)) || (time + 775 <= thousand && gate + 75 <= hundred && hundred <= gate + 75)) || ((hundred <= gate + 6 && gate + 6 <= hundred) && time + 154 <= thousand)) || (time + 235 <= thousand && gate + 15 <= hundred && hundred <= gate + 15)) || (time + 550 <= thousand && hundred <= gate + 50 && gate + 50 <= hundred)) || (time + 541 <= thousand && hundred <= gate + 49 && gate + 49 <= hundred)) || (time + 811 <= thousand && hundred <= gate + 79 && gate + 79 <= hundred)) || (time + 802 <= thousand && hundred <= gate + 78 && gate + 78 <= hundred)) || (time + 361 <= thousand && hundred <= gate + 29 && gate + 29 <= hundred)) || (time + 946 <= thousand && gate + 94 <= hundred && hundred <= gate + 94)) || ((hundred <= gate + 20 && gate + 20 <= hundred) && time + 280 <= thousand)) || ((gate + 37 <= hundred && hundred <= gate + 37) && time + 433 <= thousand)) || ((hundred <= gate + 76 && gate + 76 <= hundred) && time + 784 <= thousand)) || (time + 253 <= thousand && gate + 17 <= hundred && hundred <= gate + 17)) || (time + 892 <= thousand && gate + 88 <= hundred && hundred <= gate + 88)) || ((hundred <= gate + 38 && gate + 38 <= hundred) && time + 442 <= thousand)) || (time + 982 <= thousand && hundred <= gate + 98 && gate + 98 <= hundred)) || (time + 190 <= thousand && hundred <= gate + 10 && gate + 10 <= hundred)) || (time + 559 <= thousand && hundred <= gate + 51 && gate + 51 <= hundred)) || (time + 118 <= thousand && hundred <= gate + 2 && gate + 2 <= hundred)) || ((gate + 60 <= hundred && hundred <= gate + 60) && time + 640 <= thousand)) || (time + 298 <= thousand && hundred <= gate + 22 && gate + 22 <= hundred)) || ((hundred <= gate + 90 && gate + 90 <= hundred) && time + 910 <= thousand)) || (time + 514 <= thousand && hundred <= gate + 46 && gate + 46 <= hundred)) || ((gate + 92 <= hundred && hundred <= gate + 92) && time + 928 <= thousand)) || ((gate + 47 <= hundred && hundred <= gate + 47) && time + 523 <= thousand)) || (time + 721 <= thousand && gate + 69 <= hundred && hundred <= gate + 69)) || ((hundred <= gate + 64 && gate + 64 <= hundred) && time + 676 <= thousand)) || ((gate + 57 <= hundred && hundred <= gate + 57) && time + 613 <= thousand)) || (time + 379 <= thousand && gate + 31 <= hundred && hundred <= gate + 31)) || (time + 712 <= thousand && gate + 68 <= hundred && hundred <= gate + 68)) || ((hundred <= gate + 36 && gate + 36 <= hundred) && time + 424 <= thousand)) || ((gate + 14 <= hundred && hundred <= gate + 14) && time + 226 <= thousand)) || (time + 208 <= thousand && hundred <= gate + 12 && gate + 12 <= hundred)) || ((hundred <= gate + 85 && gate + 85 <= hundred) && time + 865 <= thousand)) || ((hundred <= gate + 27 && gate + 27 <= hundred) && time + 343 <= thousand)) || (time + 964 <= thousand && gate + 96 <= hundred && hundred <= gate + 96)) || (time + 604 <= thousand && gate + 56 <= hundred && hundred <= gate + 56)) || ((gate + 53 <= hundred && hundred <= gate + 53) && time + 577 <= thousand)) || (time + 730 <= thousand && gate + 70 <= hundred && hundred <= gate + 70)) || ((hundred <= gate + 84 && gate + 84 <= hundred) && time + 856 <= thousand)) || ((hundred <= gate + 99 && gate + 99 <= hundred) && time + 991 <= thousand)) || ((gate + 61 <= hundred && hundred <= gate + 61) && time + 649 <= thousand)) || ((hundred <= gate + 55 && gate + 55 <= hundred) && time + 595 <= thousand)) || ((gateMotorFailure || (hundred <= gate && gate <= hundred)) && (alarmTrain || (hundred <= gate && gate <= hundred)))) || ((hundred <= gate + 62 && gate + 62 <= hundred) && time + 658 <= thousand)) || ((gate + 45 <= hundred && hundred <= gate + 45) && time + 505 <= thousand)) || ((hundred <= gate + 97 && gate + 97 <= hundred) && time + 973 <= thousand)) || (time + 793 <= thousand && gate + 77 <= hundred && hundred <= gate + 77)) || ((hundred <= gate + 71 && gate + 71 <= hundred) && time + 739 <= thousand)) || ((gate + 73 <= hundred && hundred <= gate + 73) && time + 757 <= thousand)) || (time + 496 <= thousand && hundred <= gate + 44 && gate + 44 <= hundred)) || ((gate + 54 <= hundred && hundred <= gate + 54) && time + 586 <= thousand)) || (time + 820 <= thousand && hundred <= gate + 80 && gate + 80 <= hundred)) || (time + 181 <= thousand && hundred <= gate + 9 && gate + 9 <= hundred)) || (time + 136 <= thousand && hundred <= gate + 4 && gate + 4 <= hundred)) || ((hundred <= gate + 82 && gate + 82 <= hundred) && time + 838 <= thousand)) || ((gate + 86 <= hundred && hundred <= gate + 86) && time + 874 <= thousand)) || ((gate + 26 <= hundred && hundred <= gate + 26) && time + 334 <= thousand)) || ((time + 1000 <= thousand && hundred <= gate + 100) && gate + 100 <= hundred)) || ((gate + 67 <= hundred && hundred <= gate + 67) && time + 703 <= thousand)) || (time + 145 <= thousand && gate + 5 <= hundred && hundred <= gate + 5)) || (time + 406 <= thousand && gate + 34 <= hundred && hundred <= gate + 34)) || ((gate + 3 <= hundred && hundred <= gate + 3) && time + 127 <= thousand)) || (time + 109 <= thousand && ((gate + 1 <= hundred && hundred <= gate + 1) || gateMotorFailure))) || (time + 622 <= thousand && gate + 58 <= hundred && hundred <= gate + 58)) || ((hundred <= gate + 21 && gate + 21 <= hundred) && time + 289 <= thousand)) || ((gate + 93 <= hundred && hundred <= gate + 93) && time + 937 <= thousand)) || (time + 901 <= thousand && hundred <= gate + 89 && gate + 89 <= hundred)) || (time + 847 <= thousand && gate + 83 <= hundred && hundred <= gate + 83)) || (time + 532 <= thousand && gate + 48 <= hundred && hundred <= gate + 48)) || (time + 451 <= thousand && gate + 39 <= hundred && hundred <= gate + 39)) || ((gate + 43 <= hundred && hundred <= gate + 43) && time + 487 <= thousand)) || (time + 316 <= thousand && hundred <= gate + 24 && gate + 24 <= hundred)) || ((hundred <= gate + 30 && gate + 30 <= hundred) && time + 370 <= thousand)) || (time + 307 <= thousand && hundred <= gate + 23 && gate + 23 <= hundred)) || (time + 460 <= thousand && hundred <= gate + 40 && gate + 40 <= hundred)) || ((hundred <= gate + 72 && gate + 72 <= hundred) && time + 748 <= thousand)) || ((gate + 65 <= hundred && hundred <= gate + 65) && time + 685 <= thousand) - ProcedureContractResult [Line: 10]: Procedure Contract for GateController Derived contract for procedure GateController: true - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. SAFE Result, 47.1s OverallTime, 113 OverallIterations, 112 TraceHistogramMax, 7.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 339 SDtfs, 1 SDslu, 4968 SDs, 0 SdLazy, 21708 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6554 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 6432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 26.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 113 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 119 NumberOfFragments, 1743 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 5 FomulaSimplificationsInter, 484 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 32.8s InterpolantComputationTime, 6667 NumberOfCodeBlocks, 6667 NumberOfCodeBlocksAsserted, 113 NumberOfCheckSat, 6554 ConstructedInterpolants, 0 QuantifiedInterpolants, 2573530 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 113 InterpolantComputations, 1 PerfectInterpolantSequences, 56/240464 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/RailwayCrossing.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-06-51-734.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/RailwayCrossing.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-06-51-734.csv Received shutdown request...