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/GateController.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:06:04,106 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:06:04,109 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:06:04,121 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:06:04,121 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:06:04,122 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:06:04,124 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:06:04,125 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:06:04,127 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:06:04,128 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:06:04,129 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:06:04,130 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:06:04,131 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:06:04,132 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:06:04,133 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:06:04,134 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:06:04,135 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:06:04,137 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:06:04,139 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:06:04,141 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:06:04,142 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:06:04,143 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:06:04,146 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:06:04,146 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:06:04,147 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:06:04,148 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:06:04,149 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:06:04,150 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:06:04,150 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:06:04,152 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:06:04,152 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:06:04,153 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:06:04,153 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:06:04,153 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:06:04,154 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:06:04,155 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:06:04,155 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:04,164 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:06:04,164 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:06:04,165 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:06:04,166 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:06:04,166 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:06:04,166 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:06:04,166 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:06:04,166 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:06:04,229 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:06:04,242 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:06:04,246 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:06:04,248 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:06:04,248 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:06:04,249 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateController.bpl [2018-09-26 08:06:04,250 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateController.bpl' [2018-09-26 08:06:04,297 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:06:04,301 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:06:04,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:04,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:06:04,302 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:06:04,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GateController.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,335 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GateController.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,340 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:06:04,340 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:06:04,340 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:06:04,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:04,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:06:04,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:06:04,344 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:06:04,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GateController.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GateController.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GateController.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GateController.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GateController.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GateController.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GateController.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:06:04,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:06:04,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:06:04,367 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:06:04,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GateController.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/1) ... [2018-09-26 08:06:04,450 INFO L124 BoogieDeclarations]: Specification and implementation of procedure GateController given in one single declaration [2018-09-26 08:06:04,450 INFO L130 BoogieDeclarations]: Found specification of procedure GateController [2018-09-26 08:06:04,451 INFO L138 BoogieDeclarations]: Found implementation of procedure GateController [2018-09-26 08:06:04,632 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:06:04,633 INFO L202 PluginConnector]: Adding new model GateController.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:04 BoogieIcfgContainer [2018-09-26 08:06:04,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:06:04,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:06:04,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:06:04,638 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:06:04,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateController.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:04" (1/2) ... [2018-09-26 08:06:04,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c77d89 and model type GateController.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,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateController.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:04" (2/2) ... [2018-09-26 08:06:04,642 INFO L112 eAbstractionObserver]: Analyzing ICFG GateController.bpl [2018-09-26 08:06:04,653 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:06:04,661 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:06:04,710 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:06:04,710 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:06:04,711 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:06:04,711 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:06:04,711 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:06:04,711 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:06:04,712 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:06:04,712 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:06:04,712 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:06:04,726 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-09-26 08:06:04,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 08:06:04,734 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:04,735 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 08:06:04,737 INFO L423 AbstractCegarLoop]: === Iteration 1 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:04,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:04,744 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2018-09-26 08:06:04,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:04,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:04,819 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:04,820 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:06:04,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:06:04,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:06:04,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:06:04,840 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-09-26 08:06:04,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:04,867 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 08:06:04,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:06:04,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-26 08:06:04,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:04,881 INFO L225 Difference]: With dead ends: 9 [2018-09-26 08:06:04,881 INFO L226 Difference]: Without dead ends: 5 [2018-09-26 08:06:04,885 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,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-09-26 08:06:04,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-09-26 08:06:04,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-09-26 08:06:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-26 08:06:04,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-09-26 08:06:04,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:04,927 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-09-26 08:06:04,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:06:04,927 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-26 08:06:04,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:06:04,928 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:04,928 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:06:04,928 INFO L423 AbstractCegarLoop]: === Iteration 2 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:04,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:04,929 INFO L82 PathProgramCache]: Analyzing trace with hash 952992, now seen corresponding path program 1 times [2018-09-26 08:06:04,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:04,964 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,964 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:04,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:06:04,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:06:04,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:06:04,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:04,967 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-09-26 08:06:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:04,992 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-09-26 08:06:04,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:06:04,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-26 08:06:04,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:04,993 INFO L225 Difference]: With dead ends: 8 [2018-09-26 08:06:04,993 INFO L226 Difference]: Without dead ends: 6 [2018-09-26 08:06:04,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:04,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-26 08:06:04,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-26 08:06:04,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 08:06:04,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-26 08:06:04,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-09-26 08:06:04,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:04,998 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-26 08:06:04,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:06:04,998 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-26 08:06:04,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:06:04,999 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:04,999 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-26 08:06:04,999 INFO L423 AbstractCegarLoop]: === Iteration 3 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:04,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,000 INFO L82 PathProgramCache]: Analyzing trace with hash 29552352, now seen corresponding path program 2 times [2018-09-26 08:06:05,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,088 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:05,088 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,088 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:06:05,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:05,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:05,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:05,090 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-09-26 08:06:05,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,115 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 08:06:05,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:06:05,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-09-26 08:06:05,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,118 INFO L225 Difference]: With dead ends: 9 [2018-09-26 08:06:05,119 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:06:05,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:05,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:06:05,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:06:05,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:06:05,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:06:05,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-09-26 08:06:05,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,128 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:06:05,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:05,128 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:06:05,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:06:05,129 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,129 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-09-26 08:06:05,129 INFO L423 AbstractCegarLoop]: === Iteration 4 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,130 INFO L82 PathProgramCache]: Analyzing trace with hash 916132512, now seen corresponding path program 3 times [2018-09-26 08:06:05,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,189 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,190 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,190 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:06:05,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:05,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:05,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:05,192 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-09-26 08:06:05,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,239 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-26 08:06:05,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:06:05,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:06:05,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,242 INFO L225 Difference]: With dead ends: 10 [2018-09-26 08:06:05,242 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:06:05,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:05,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:06:05,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:06:05,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:06:05,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 08:06:05,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-09-26 08:06:05,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,248 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 08:06:05,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:05,248 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 08:06:05,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:06:05,250 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,250 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-09-26 08:06:05,251 INFO L423 AbstractCegarLoop]: === Iteration 5 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1664653600, now seen corresponding path program 4 times [2018-09-26 08:06:05,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,357 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,357 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,358 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:05,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:05,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:05,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:05,362 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-09-26 08:06:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,393 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:06:05,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:06:05,394 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:06:05,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,396 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:06:05,396 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:06:05,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:05,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:06:05,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:06:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:06:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:06:05,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-09-26 08:06:05,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,405 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:06:05,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:05,405 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:06:05,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:06:05,406 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,406 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-09-26 08:06:05,407 INFO L423 AbstractCegarLoop]: === Iteration 6 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,408 INFO L82 PathProgramCache]: Analyzing trace with hash -64644448, now seen corresponding path program 5 times [2018-09-26 08:06:05,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,486 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,487 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,487 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:05,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:05,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:05,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:05,488 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-09-26 08:06:05,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,507 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-26 08:06:05,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:06:05,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-09-26 08:06:05,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,508 INFO L225 Difference]: With dead ends: 12 [2018-09-26 08:06:05,508 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:06:05,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:05,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:06:05,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-26 08:06:05,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 08:06:05,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-26 08:06:05,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-09-26 08:06:05,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,517 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-26 08:06:05,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:05,517 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-26 08:06:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:06:05,518 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,518 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-09-26 08:06:05,518 INFO L423 AbstractCegarLoop]: === Iteration 7 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,519 INFO L82 PathProgramCache]: Analyzing trace with hash -2003968288, now seen corresponding path program 6 times [2018-09-26 08:06:05,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,600 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,600 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,600 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:05,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:06:05,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:06:05,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:05,606 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-09-26 08:06:05,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,650 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:06:05,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:05,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-09-26 08:06:05,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,652 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:06:05,652 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:06:05,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:05,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:06:05,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:06:05,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:06:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:06:05,660 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-09-26 08:06:05,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,661 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:06:05,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:06:05,661 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:06:05,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:06:05,668 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,669 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-09-26 08:06:05,670 INFO L423 AbstractCegarLoop]: === Iteration 8 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1993465184, now seen corresponding path program 7 times [2018-09-26 08:06:05,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,751 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,752 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:06:05,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:06:05,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:06:05,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:05,756 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-09-26 08:06:05,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,782 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-26 08:06:05,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:05,782 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-09-26 08:06:05,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,784 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:06:05,784 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:06:05,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:06:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:06:05,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 08:06:05,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:06:05,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-26 08:06:05,792 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-26 08:06:05,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,792 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-26 08:06:05,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:06:05,793 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-26 08:06:05,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:06:05,793 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,794 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-09-26 08:06:05,794 INFO L423 AbstractCegarLoop]: === Iteration 9 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1667868960, now seen corresponding path program 8 times [2018-09-26 08:06:05,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:05,893 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,894 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:05,894 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:06:05,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:06:05,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:06:05,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=67, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:06:05,895 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-09-26 08:06:05,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:05,912 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:06:05,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:06:05,913 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-09-26 08:06:05,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:05,914 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:06:05,914 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:06:05,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=67, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:06:05,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:06:05,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:06:05,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:06:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:06:05,919 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-09-26 08:06:05,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:05,919 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:06:05,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:06:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:06:05,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:06:05,921 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:05,921 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-09-26 08:06:05,921 INFO L423 AbstractCegarLoop]: === Iteration 10 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:05,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:05,922 INFO L82 PathProgramCache]: Analyzing trace with hash -164320608, now seen corresponding path program 9 times [2018-09-26 08:06:05,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:06,034 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:06,035 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:06,035 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:06:06,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:06:06,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:06:06,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:06:06,036 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-09-26 08:06:06,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:06,059 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-26 08:06:06,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:06,060 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-09-26 08:06:06,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:06,061 INFO L225 Difference]: With dead ends: 16 [2018-09-26 08:06:06,061 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:06:06,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:06:06,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:06:06,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-26 08:06:06,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:06:06,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-26 08:06:06,070 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-09-26 08:06:06,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:06,072 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-26 08:06:06,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:06:06,072 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-26 08:06:06,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:06,073 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:06,073 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-09-26 08:06:06,074 INFO L423 AbstractCegarLoop]: === Iteration 11 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:06,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:06,074 INFO L82 PathProgramCache]: Analyzing trace with hash -798961952, now seen corresponding path program 10 times [2018-09-26 08:06:06,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:06,178 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:06,179 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:06,179 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:06:06,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:06:06,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:06:06,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:06,181 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-09-26 08:06:06,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:06,204 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:06:06,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:06:06,204 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-26 08:06:06,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:06,205 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:06:06,206 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:06:06,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:06:06,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:06:06,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:06:06,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:06:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:06:06,214 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-09-26 08:06:06,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:06,215 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:06:06,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:06:06,215 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:06:06,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:06:06,216 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:06,216 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-09-26 08:06:06,218 INFO L423 AbstractCegarLoop]: === Iteration 12 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:06,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:06,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1001992864, now seen corresponding path program 11 times [2018-09-26 08:06:06,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:06,326 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:06,327 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:06,327 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:06:06,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:06:06,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:06:06,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=106, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:06,330 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-09-26 08:06:06,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:06,365 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-26 08:06:06,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:06,365 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-09-26 08:06:06,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:06,367 INFO L225 Difference]: With dead ends: 18 [2018-09-26 08:06:06,367 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:06:06,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=104, Invalid=106, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:06,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:06:06,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:06:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:06:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-26 08:06:06,373 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-09-26 08:06:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:06,374 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-26 08:06:06,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:06:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-26 08:06:06,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:06:06,376 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:06,376 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-09-26 08:06:06,376 INFO L423 AbstractCegarLoop]: === Iteration 13 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:06,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:06,377 INFO L82 PathProgramCache]: Analyzing trace with hash 997017312, now seen corresponding path program 12 times [2018-09-26 08:06:06,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:06,493 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,494 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:06,494 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:06:06,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:06:06,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:06:06,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=121, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:06,497 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-09-26 08:06:06,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:06,529 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 08:06:06,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:06:06,530 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-09-26 08:06:06,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:06,531 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:06:06,531 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:06:06,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=121, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:06,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:06:06,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:06:06,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:06:06,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:06:06,544 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-09-26 08:06:06,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:06,544 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:06:06,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:06:06,546 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:06:06,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:06:06,546 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:06,547 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-09-26 08:06:06,547 INFO L423 AbstractCegarLoop]: === Iteration 14 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:06,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:06,548 INFO L82 PathProgramCache]: Analyzing trace with hash 842775200, now seen corresponding path program 13 times [2018-09-26 08:06:06,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:06,660 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,661 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:06,661 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:06:06,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:06:06,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:06:06,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=137, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:06,664 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-09-26 08:06:06,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:06,685 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-26 08:06:06,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:06:06,686 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-26 08:06:06,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:06,687 INFO L225 Difference]: With dead ends: 20 [2018-09-26 08:06:06,687 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 08:06:06,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=137, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:06,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 08:06:06,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-26 08:06:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-26 08:06:06,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-26 08:06:06,694 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-09-26 08:06:06,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:06,695 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-26 08:06:06,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:06:06,695 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-26 08:06:06,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:06:06,698 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:06,698 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-09-26 08:06:06,699 INFO L423 AbstractCegarLoop]: === Iteration 15 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:06,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:06,699 INFO L82 PathProgramCache]: Analyzing trace with hash 356237024, now seen corresponding path program 14 times [2018-09-26 08:06:06,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:06,818 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,818 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:06,819 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:06:06,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:06:06,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:06:06,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=154, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:06:06,821 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-09-26 08:06:06,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:06,844 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-26 08:06:06,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:06:06,845 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-09-26 08:06:06,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:06,846 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:06:06,846 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:06:06,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=152, Invalid=154, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:06:06,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:06:06,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:06:06,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:06:06,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-26 08:06:06,852 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-09-26 08:06:06,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:06,852 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-26 08:06:06,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:06:06,852 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-26 08:06:06,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:06:06,853 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:06,853 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-09-26 08:06:06,854 INFO L423 AbstractCegarLoop]: === Iteration 16 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:06,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:06,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1841544544, now seen corresponding path program 15 times [2018-09-26 08:06:06,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:06,966 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,967 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:06,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:06:06,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:06:06,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:06:06,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=172, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:06,969 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-09-26 08:06:06,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:06,995 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-26 08:06:06,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:06:06,996 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-09-26 08:06:06,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:06,996 INFO L225 Difference]: With dead ends: 22 [2018-09-26 08:06:06,997 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 08:06:06,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=170, Invalid=172, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:06,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 08:06:07,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-26 08:06:07,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 08:06:07,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-26 08:06:07,002 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-09-26 08:06:07,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:07,002 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-26 08:06:07,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:06:07,003 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-26 08:06:07,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:06:07,003 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:07,004 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-09-26 08:06:07,004 INFO L423 AbstractCegarLoop]: === Iteration 17 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:07,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:07,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1253296416, now seen corresponding path program 16 times [2018-09-26 08:06:07,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:07,135 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:07,135 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:07,135 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:06:07,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:06:07,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:06:07,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=191, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:06:07,137 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-09-26 08:06:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:07,165 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 08:06:07,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:06:07,166 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-09-26 08:06:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:07,167 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:06:07,167 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:06:07,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=189, Invalid=191, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:06:07,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:06:07,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:06:07,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:06:07,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 08:06:07,173 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-09-26 08:06:07,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:07,173 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 08:06:07,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:06:07,173 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 08:06:07,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:06:07,174 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:07,174 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-09-26 08:06:07,175 INFO L423 AbstractCegarLoop]: === Iteration 18 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:07,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:07,175 INFO L82 PathProgramCache]: Analyzing trace with hash -197473632, now seen corresponding path program 17 times [2018-09-26 08:06:07,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:07,311 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:07,311 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:07,312 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:06:07,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:06:07,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:06:07,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=211, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:06:07,313 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-09-26 08:06:07,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:07,335 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-26 08:06:07,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:06:07,335 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-09-26 08:06:07,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:07,336 INFO L225 Difference]: With dead ends: 24 [2018-09-26 08:06:07,336 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 08:06:07,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=209, Invalid=211, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:06:07,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 08:06:07,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-26 08:06:07,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:06:07,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-26 08:06:07,341 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-09-26 08:06:07,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:07,342 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-26 08:06:07,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:06:07,342 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-26 08:06:07,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:06:07,343 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:07,343 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-09-26 08:06:07,343 INFO L423 AbstractCegarLoop]: === Iteration 19 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:07,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:07,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1826705696, now seen corresponding path program 18 times [2018-09-26 08:06:07,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:07,522 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:07,523 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:07,523 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:06:07,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:06:07,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:06:07,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=232, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:06:07,525 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-09-26 08:06:07,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:07,554 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-26 08:06:07,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:06:07,554 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-09-26 08:06:07,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:07,555 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:06:07,556 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:06:07,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=230, Invalid=232, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:06:07,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:06:07,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:06:07,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:06:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:06:07,565 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-09-26 08:06:07,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:07,565 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:06:07,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:06:07,566 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:06:07,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:06:07,566 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:07,567 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-09-26 08:06:07,567 INFO L423 AbstractCegarLoop]: === Iteration 20 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:07,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:07,567 INFO L82 PathProgramCache]: Analyzing trace with hash -793292128, now seen corresponding path program 19 times [2018-09-26 08:06:07,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:07,732 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,733 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:07,733 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:06:07,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:06:07,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:06:07,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=254, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:06:07,735 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-09-26 08:06:07,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:07,763 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-26 08:06:07,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:06:07,763 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-09-26 08:06:07,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:07,764 INFO L225 Difference]: With dead ends: 26 [2018-09-26 08:06:07,764 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 08:06:07,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=252, Invalid=254, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:06:07,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 08:06:07,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-26 08:06:07,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 08:06:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-26 08:06:07,773 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-09-26 08:06:07,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:07,774 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-26 08:06:07,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:06:07,774 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-26 08:06:07,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:06:07,776 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:07,776 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-09-26 08:06:07,776 INFO L423 AbstractCegarLoop]: === Iteration 21 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:07,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:07,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1177757408, now seen corresponding path program 20 times [2018-09-26 08:06:07,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:07,945 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,946 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:07,946 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:06:07,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:06:07,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:06:07,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=277, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:06:07,948 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-09-26 08:06:07,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:07,980 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-26 08:06:07,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:06:07,981 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-09-26 08:06:07,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:07,982 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:06:07,982 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:06:07,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=275, Invalid=277, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:06:07,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:06:07,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:06:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:06:07,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 08:06:07,991 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-09-26 08:06:07,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:07,992 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 08:06:07,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:06:07,992 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 08:06:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:06:07,996 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:07,996 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-09-26 08:06:07,996 INFO L423 AbstractCegarLoop]: === Iteration 22 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:07,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:07,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2144216416, now seen corresponding path program 21 times [2018-09-26 08:06:07,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:08,188 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:08,188 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:08,188 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:06:08,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:06:08,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:06:08,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=301, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:06:08,190 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-09-26 08:06:08,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:08,222 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-26 08:06:08,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:06:08,222 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-09-26 08:06:08,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:08,223 INFO L225 Difference]: With dead ends: 28 [2018-09-26 08:06:08,223 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 08:06:08,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=299, Invalid=301, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:06:08,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 08:06:08,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-26 08:06:08,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 08:06:08,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-26 08:06:08,233 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-09-26 08:06:08,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:08,233 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-26 08:06:08,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:06:08,234 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-26 08:06:08,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:06:08,235 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:08,235 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-09-26 08:06:08,235 INFO L423 AbstractCegarLoop]: === Iteration 23 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:08,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:08,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2046189856, now seen corresponding path program 22 times [2018-09-26 08:06:08,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:08,445 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:08,446 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:08,446 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:06:08,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:06:08,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:06:08,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:06:08,448 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-09-26 08:06:08,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:08,481 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-26 08:06:08,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:06:08,481 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-09-26 08:06:08,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:08,482 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:06:08,482 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:06:08,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:06:08,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:06:08,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:06:08,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:06:08,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-26 08:06:08,491 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-09-26 08:06:08,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:08,491 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-26 08:06:08,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:06:08,492 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-26 08:06:08,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:06:08,493 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:08,494 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-09-26 08:06:08,494 INFO L423 AbstractCegarLoop]: === Iteration 24 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:08,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:08,495 INFO L82 PathProgramCache]: Analyzing trace with hash 992633504, now seen corresponding path program 23 times [2018-09-26 08:06:08,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:08,693 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:08,693 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:08,693 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:06:08,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:06:08,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:06:08,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=352, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:06:08,695 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-09-26 08:06:08,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:08,726 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-26 08:06:08,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:06:08,726 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-09-26 08:06:08,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:08,727 INFO L225 Difference]: With dead ends: 30 [2018-09-26 08:06:08,727 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 08:06:08,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=350, Invalid=352, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:06:08,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 08:06:08,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-09-26 08:06:08,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-26 08:06:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-09-26 08:06:08,738 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-09-26 08:06:08,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:08,738 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-09-26 08:06:08,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:06:08,740 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-09-26 08:06:08,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-26 08:06:08,740 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:08,741 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-09-26 08:06:08,741 INFO L423 AbstractCegarLoop]: === Iteration 25 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:08,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:08,741 INFO L82 PathProgramCache]: Analyzing trace with hash 706877152, now seen corresponding path program 24 times [2018-09-26 08:06:08,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:08,945 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,945 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:08,945 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:06:08,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:06:08,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:06:08,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=379, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:06:08,947 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-09-26 08:06:09,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:09,072 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 08:06:09,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:06:09,072 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-09-26 08:06:09,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:09,073 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:06:09,073 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:06:09,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=377, Invalid=379, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:06:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:06:09,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:06:09,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:06:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:06:09,081 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-09-26 08:06:09,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:09,081 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:06:09,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:06:09,081 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:06:09,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:06:09,082 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:09,083 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-09-26 08:06:09,083 INFO L423 AbstractCegarLoop]: === Iteration 26 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:09,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:09,083 INFO L82 PathProgramCache]: Analyzing trace with hash 438364832, now seen corresponding path program 25 times [2018-09-26 08:06:09,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:09,278 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:09,278 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:09,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:06:09,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:06:09,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:06:09,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=407, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:06:09,280 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-09-26 08:06:09,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:09,315 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-26 08:06:09,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:06:09,316 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-09-26 08:06:09,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:09,316 INFO L225 Difference]: With dead ends: 32 [2018-09-26 08:06:09,316 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 08:06:09,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=405, Invalid=407, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:06:09,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 08:06:09,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-26 08:06:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 08:06:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-26 08:06:09,322 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-09-26 08:06:09,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:09,323 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-26 08:06:09,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:06:09,323 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-26 08:06:09,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:06:09,323 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:09,324 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-09-26 08:06:09,324 INFO L423 AbstractCegarLoop]: === Iteration 27 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:09,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:09,324 INFO L82 PathProgramCache]: Analyzing trace with hash 704417504, now seen corresponding path program 26 times [2018-09-26 08:06:09,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:09,536 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:09,536 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:09,536 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:06:09,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:06:09,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:06:09,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=436, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:06:09,538 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-09-26 08:06:09,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:09,574 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-26 08:06:09,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:06:09,575 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-09-26 08:06:09,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:09,575 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:06:09,575 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:06:09,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=434, Invalid=436, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:06:09,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:06:09,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:06:09,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:06:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 08:06:09,582 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-09-26 08:06:09,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:09,582 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 08:06:09,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:06:09,582 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 08:06:09,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:06:09,583 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:09,583 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-09-26 08:06:09,583 INFO L423 AbstractCegarLoop]: === Iteration 28 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:09,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:09,584 INFO L82 PathProgramCache]: Analyzing trace with hash 362115744, now seen corresponding path program 27 times [2018-09-26 08:06:09,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:09,790 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:09,790 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:09,791 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:06:09,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:06:09,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:06:09,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=466, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:06:09,792 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-09-26 08:06:09,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:09,834 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-26 08:06:09,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:06:09,834 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-09-26 08:06:09,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:09,835 INFO L225 Difference]: With dead ends: 34 [2018-09-26 08:06:09,835 INFO L226 Difference]: Without dead ends: 32 [2018-09-26 08:06:09,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=464, Invalid=466, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:06:09,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-26 08:06:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-26 08:06:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-26 08:06:09,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-26 08:06:09,846 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-09-26 08:06:09,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:09,846 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-26 08:06:09,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:06:09,850 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-26 08:06:09,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 08:06:09,851 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:09,851 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-09-26 08:06:09,851 INFO L423 AbstractCegarLoop]: === Iteration 29 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:09,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:09,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1659304224, now seen corresponding path program 28 times [2018-09-26 08:06:09,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:10,058 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:10,059 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:10,059 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:06:10,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:06:10,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:06:10,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=497, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:06:10,061 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-09-26 08:06:10,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:10,104 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 08:06:10,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:06:10,104 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-09-26 08:06:10,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:10,111 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:06:10,111 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:06:10,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=495, Invalid=497, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:06:10,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:06:10,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 08:06:10,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:06:10,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 08:06:10,121 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-09-26 08:06:10,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:10,122 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 08:06:10,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:06:10,123 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 08:06:10,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:06:10,123 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:10,123 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-09-26 08:06:10,123 INFO L423 AbstractCegarLoop]: === Iteration 30 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:10,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:10,124 INFO L82 PathProgramCache]: Analyzing trace with hash 101186208, now seen corresponding path program 29 times [2018-09-26 08:06:10,124 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,394 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:10,395 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:10,395 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:06:10,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:06:10,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:06:10,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=527, Invalid=529, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:06:10,397 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-09-26 08:06:10,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:10,429 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-26 08:06:10,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:06:10,429 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-09-26 08:06:10,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:10,430 INFO L225 Difference]: With dead ends: 36 [2018-09-26 08:06:10,430 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 08:06:10,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=527, Invalid=529, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:06:10,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 08:06:10,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-26 08:06:10,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 08:06:10,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-09-26 08:06:10,436 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-09-26 08:06:10,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:10,436 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-09-26 08:06:10,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:06:10,436 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-09-26 08:06:10,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-26 08:06:10,437 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:10,437 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-09-26 08:06:10,437 INFO L423 AbstractCegarLoop]: === Iteration 31 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:10,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:10,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1158185248, now seen corresponding path program 30 times [2018-09-26 08:06:10,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:10,675 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:10,676 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:10,676 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:06:10,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:06:10,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:06:10,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=562, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:06:10,677 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-09-26 08:06:10,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:10,724 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-26 08:06:10,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:06:10,724 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-09-26 08:06:10,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:10,725 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:06:10,725 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:06:10,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=560, Invalid=562, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:06:10,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:06:10,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:06:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:06:10,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 08:06:10,731 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-09-26 08:06:10,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:10,732 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 08:06:10,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:06:10,732 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 08:06:10,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:06:10,732 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:10,732 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-09-26 08:06:10,733 INFO L423 AbstractCegarLoop]: === Iteration 32 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:10,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:10,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1543994720, now seen corresponding path program 31 times [2018-09-26 08:06:10,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:11,004 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:11,005 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:11,005 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:06:11,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:06:11,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:06:11,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=594, Invalid=596, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:06:11,007 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-09-26 08:06:11,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:11,062 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-26 08:06:11,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:06:11,062 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-09-26 08:06:11,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:11,063 INFO L225 Difference]: With dead ends: 38 [2018-09-26 08:06:11,063 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 08:06:11,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=594, Invalid=596, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:06:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 08:06:11,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-26 08:06:11,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 08:06:11,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-26 08:06:11,075 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-09-26 08:06:11,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:11,079 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-26 08:06:11,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:06:11,080 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-26 08:06:11,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 08:06:11,080 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:11,080 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-09-26 08:06:11,081 INFO L423 AbstractCegarLoop]: === Iteration 33 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:11,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:11,081 INFO L82 PathProgramCache]: Analyzing trace with hash -619186464, now seen corresponding path program 32 times [2018-09-26 08:06:11,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:11,360 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:11,361 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:11,361 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:06:11,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:06:11,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:06:11,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=631, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:06:11,365 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-09-26 08:06:11,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:11,419 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-26 08:06:11,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:06:11,420 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-09-26 08:06:11,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:11,420 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:06:11,420 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:06:11,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=629, Invalid=631, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:06:11,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:06:11,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:06:11,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:06:11,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 08:06:11,428 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-09-26 08:06:11,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:11,428 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 08:06:11,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:06:11,429 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 08:06:11,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:06:11,429 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:11,429 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-09-26 08:06:11,430 INFO L423 AbstractCegarLoop]: === Iteration 34 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:11,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:11,430 INFO L82 PathProgramCache]: Analyzing trace with hash -2014901600, now seen corresponding path program 33 times [2018-09-26 08:06:11,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:11,720 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:11,721 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:11,721 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:06:11,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:06:11,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:06:11,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=665, Invalid=667, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:06:11,722 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-09-26 08:06:11,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:11,776 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-26 08:06:11,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:06:11,777 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-09-26 08:06:11,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:11,777 INFO L225 Difference]: With dead ends: 40 [2018-09-26 08:06:11,777 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 08:06:11,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=665, Invalid=667, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:06:11,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 08:06:11,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-09-26 08:06:11,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 08:06:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-26 08:06:11,784 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-09-26 08:06:11,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:11,784 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-26 08:06:11,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:06:11,784 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-26 08:06:11,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 08:06:11,785 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:11,785 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-09-26 08:06:11,785 INFO L423 AbstractCegarLoop]: === Iteration 35 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:11,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:11,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1962569440, now seen corresponding path program 34 times [2018-09-26 08:06:11,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:12,126 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:12,126 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:12,126 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:06:12,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:06:12,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:06:12,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=702, Invalid=704, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:06:12,129 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-09-26 08:06:12,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:12,186 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-26 08:06:12,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:06:12,187 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-09-26 08:06:12,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:12,187 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:06:12,188 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:06:12,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=702, Invalid=704, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:06:12,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:06:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:06:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:06:12,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-26 08:06:12,200 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-09-26 08:06:12,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:12,201 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-26 08:06:12,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:06:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-26 08:06:12,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:06:12,204 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:12,204 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-09-26 08:06:12,204 INFO L423 AbstractCegarLoop]: === Iteration 36 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:12,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:12,205 INFO L82 PathProgramCache]: Analyzing trace with hash 710120096, now seen corresponding path program 35 times [2018-09-26 08:06:12,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:12,635 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:12,635 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:12,635 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:06:12,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:06:12,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:06:12,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=740, Invalid=742, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:06:12,637 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-09-26 08:06:12,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:12,677 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-26 08:06:12,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:06:12,677 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-09-26 08:06:12,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:12,678 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:06:12,678 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 08:06:12,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=740, Invalid=742, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:06:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 08:06:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-26 08:06:12,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 08:06:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-09-26 08:06:12,685 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-09-26 08:06:12,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:12,686 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-09-26 08:06:12,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:06:12,686 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-09-26 08:06:12,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 08:06:12,686 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:12,687 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-09-26 08:06:12,687 INFO L423 AbstractCegarLoop]: === Iteration 37 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:12,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:12,687 INFO L82 PathProgramCache]: Analyzing trace with hash 538896096, now seen corresponding path program 36 times [2018-09-26 08:06:12,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:13,080 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:13,080 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:13,080 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:06:13,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:06:13,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:06:13,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=779, Invalid=781, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:06:13,082 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-09-26 08:06:13,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:13,134 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-26 08:06:13,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:06:13,135 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-09-26 08:06:13,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:13,136 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:06:13,136 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:06:13,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=779, Invalid=781, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:06:13,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:06:13,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:06:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:06:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:06:13,143 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-09-26 08:06:13,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:13,144 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:06:13,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:06:13,144 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:06:13,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:06:13,144 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:13,145 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-09-26 08:06:13,145 INFO L423 AbstractCegarLoop]: === Iteration 38 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:13,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:13,145 INFO L82 PathProgramCache]: Analyzing trace with hash -474080608, now seen corresponding path program 37 times [2018-09-26 08:06:13,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:13,587 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:13,587 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:13,588 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:06:13,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:06:13,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:06:13,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=821, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:06:13,589 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-09-26 08:06:13,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:13,623 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-26 08:06:13,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:06:13,623 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-09-26 08:06:13,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:13,624 INFO L225 Difference]: With dead ends: 44 [2018-09-26 08:06:13,624 INFO L226 Difference]: Without dead ends: 42 [2018-09-26 08:06:13,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=819, Invalid=821, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:06:13,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-26 08:06:13,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-09-26 08:06:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-26 08:06:13,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-26 08:06:13,631 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-09-26 08:06:13,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:13,632 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-26 08:06:13,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:06:13,632 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-26 08:06:13,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 08:06:13,632 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:13,632 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-09-26 08:06:13,633 INFO L423 AbstractCegarLoop]: === Iteration 39 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:13,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:13,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1811587360, now seen corresponding path program 38 times [2018-09-26 08:06:13,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:13,961 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:13,962 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:13,962 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:06:13,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:06:13,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:06:13,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=860, Invalid=862, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:06:13,964 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-09-26 08:06:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:14,006 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 08:06:14,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:06:14,006 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-09-26 08:06:14,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:14,007 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:06:14,007 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:06:14,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=860, Invalid=862, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:06:14,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:06:14,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:06:14,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:06:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-26 08:06:14,013 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-09-26 08:06:14,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:14,014 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-26 08:06:14,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:06:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-26 08:06:14,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:06:14,014 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:14,015 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-09-26 08:06:14,015 INFO L423 AbstractCegarLoop]: === Iteration 40 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:14,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:14,015 INFO L82 PathProgramCache]: Analyzing trace with hash -324623712, now seen corresponding path program 39 times [2018-09-26 08:06:14,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:14,380 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:14,380 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:14,380 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:06:14,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:06:14,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:06:14,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=902, Invalid=904, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:06:14,383 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-09-26 08:06:14,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:14,431 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-26 08:06:14,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:06:14,431 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-09-26 08:06:14,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:14,432 INFO L225 Difference]: With dead ends: 46 [2018-09-26 08:06:14,432 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 08:06:14,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=902, Invalid=904, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:06:14,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 08:06:14,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-09-26 08:06:14,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-26 08:06:14,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-26 08:06:14,438 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-09-26 08:06:14,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:14,439 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-26 08:06:14,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:06:14,439 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-26 08:06:14,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 08:06:14,439 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:14,439 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-09-26 08:06:14,440 INFO L423 AbstractCegarLoop]: === Iteration 41 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:14,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:14,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1473390880, now seen corresponding path program 40 times [2018-09-26 08:06:14,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:14,800 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:14,800 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:14,800 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:06:14,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:06:14,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:06:14,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=945, Invalid=947, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:06:14,802 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-09-26 08:06:14,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:14,841 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-26 08:06:14,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:06:14,841 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-09-26 08:06:14,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:14,842 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:06:14,842 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:06:14,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=945, Invalid=947, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:06:14,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:06:14,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:06:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:06:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 08:06:14,848 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-09-26 08:06:14,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:14,848 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 08:06:14,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:06:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 08:06:14,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:06:14,849 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:14,849 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-09-26 08:06:14,849 INFO L423 AbstractCegarLoop]: === Iteration 42 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:14,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:14,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1569532576, now seen corresponding path program 41 times [2018-09-26 08:06:14,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:15,216 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:15,217 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:15,217 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:06:15,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:06:15,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:06:15,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=989, Invalid=991, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:06:15,219 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-09-26 08:06:15,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:15,267 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-26 08:06:15,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:06:15,268 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-09-26 08:06:15,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:15,269 INFO L225 Difference]: With dead ends: 48 [2018-09-26 08:06:15,269 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 08:06:15,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=989, Invalid=991, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:06:15,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 08:06:15,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-26 08:06:15,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-26 08:06:15,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-26 08:06:15,276 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-09-26 08:06:15,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:15,276 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-26 08:06:15,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:06:15,276 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-26 08:06:15,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-26 08:06:15,277 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:15,277 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-09-26 08:06:15,277 INFO L423 AbstractCegarLoop]: === Iteration 43 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:15,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:15,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1410879200, now seen corresponding path program 42 times [2018-09-26 08:06:15,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:15,667 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:15,667 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:15,667 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:06:15,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:06:15,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:06:15,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1034, Invalid=1036, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:06:15,673 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-09-26 08:06:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:15,722 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-09-26 08:06:15,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:06:15,722 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-09-26 08:06:15,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:15,723 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:06:15,723 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:06:15,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1034, Invalid=1036, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:06:15,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:06:15,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 08:06:15,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:06:15,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-26 08:06:15,732 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-09-26 08:06:15,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:15,732 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-26 08:06:15,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:06:15,733 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-26 08:06:15,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:06:15,734 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:15,734 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-09-26 08:06:15,734 INFO L423 AbstractCegarLoop]: === Iteration 44 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:15,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:15,734 INFO L82 PathProgramCache]: Analyzing trace with hash 787591840, now seen corresponding path program 43 times [2018-09-26 08:06:15,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:16,172 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:16,173 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:16,173 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:06:16,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:06:16,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:06:16,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1080, Invalid=1082, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:06:16,175 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-09-26 08:06:16,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:16,219 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-26 08:06:16,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:06:16,219 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-09-26 08:06:16,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:16,220 INFO L225 Difference]: With dead ends: 50 [2018-09-26 08:06:16,220 INFO L226 Difference]: Without dead ends: 48 [2018-09-26 08:06:16,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1080, Invalid=1082, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:06:16,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-26 08:06:16,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-09-26 08:06:16,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-26 08:06:16,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-09-26 08:06:16,228 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-09-26 08:06:16,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:16,228 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-09-26 08:06:16,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:06:16,228 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-09-26 08:06:16,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-26 08:06:16,229 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:16,229 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-09-26 08:06:16,229 INFO L423 AbstractCegarLoop]: === Iteration 45 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:16,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:16,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1354447136, now seen corresponding path program 44 times [2018-09-26 08:06:16,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:16,745 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:16,745 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:16,746 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:06:16,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:06:16,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:06:16,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1127, Invalid=1129, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:06:16,747 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-09-26 08:06:16,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:16,783 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-26 08:06:16,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:06:16,784 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-09-26 08:06:16,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:16,784 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:06:16,784 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:06:16,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1127, Invalid=1129, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:06:16,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:06:16,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 08:06:16,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:06:16,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-26 08:06:16,791 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-09-26 08:06:16,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:16,791 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-26 08:06:16,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:06:16,792 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-26 08:06:16,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:06:16,792 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:16,792 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-09-26 08:06:16,792 INFO L423 AbstractCegarLoop]: === Iteration 46 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:16,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:16,793 INFO L82 PathProgramCache]: Analyzing trace with hash 961821344, now seen corresponding path program 45 times [2018-09-26 08:06:16,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:17,140 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:17,140 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:17,140 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:06:17,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:06:17,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:06:17,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1175, Invalid=1177, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:06:17,142 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-09-26 08:06:17,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:17,193 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-26 08:06:17,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:06:17,193 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-09-26 08:06:17,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:17,194 INFO L225 Difference]: With dead ends: 52 [2018-09-26 08:06:17,194 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 08:06:17,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1175, Invalid=1177, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:06:17,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 08:06:17,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-26 08:06:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-26 08:06:17,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-09-26 08:06:17,201 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-09-26 08:06:17,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:17,201 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-09-26 08:06:17,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:06:17,201 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-09-26 08:06:17,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-26 08:06:17,202 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:17,202 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-09-26 08:06:17,202 INFO L423 AbstractCegarLoop]: === Iteration 47 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:17,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:17,203 INFO L82 PathProgramCache]: Analyzing trace with hash -248299808, now seen corresponding path program 46 times [2018-09-26 08:06:17,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:17,549 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:17,550 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:17,550 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:06:17,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:06:17,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:06:17,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=1226, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:06:17,552 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-09-26 08:06:17,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:17,600 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-09-26 08:06:17,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:06:17,600 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-09-26 08:06:17,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:17,601 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:06:17,601 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:06:17,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1224, Invalid=1226, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:06:17,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:06:17,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 08:06:17,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:06:17,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-26 08:06:17,607 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-09-26 08:06:17,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:17,607 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-26 08:06:17,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:06:17,607 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-26 08:06:17,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:06:17,608 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:17,608 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-09-26 08:06:17,608 INFO L423 AbstractCegarLoop]: === Iteration 48 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:17,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:17,609 INFO L82 PathProgramCache]: Analyzing trace with hash 892650144, now seen corresponding path program 47 times [2018-09-26 08:06:17,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:17,955 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:17,955 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:17,955 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:06:17,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:06:17,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:06:17,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1274, Invalid=1276, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:06:17,957 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-09-26 08:06:18,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:18,006 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-26 08:06:18,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:06:18,007 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-09-26 08:06:18,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:18,007 INFO L225 Difference]: With dead ends: 54 [2018-09-26 08:06:18,008 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 08:06:18,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1274, Invalid=1276, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:06:18,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 08:06:18,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-09-26 08:06:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 08:06:18,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-26 08:06:18,016 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-09-26 08:06:18,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:18,016 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-26 08:06:18,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:06:18,017 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-26 08:06:18,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-26 08:06:18,017 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:18,017 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-09-26 08:06:18,017 INFO L423 AbstractCegarLoop]: === Iteration 49 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:18,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:18,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1902360288, now seen corresponding path program 48 times [2018-09-26 08:06:18,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:18,383 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:18,383 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:18,383 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:06:18,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:06:18,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:06:18,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1325, Invalid=1327, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:06:18,385 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-09-26 08:06:18,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:18,426 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-26 08:06:18,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:06:18,427 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-09-26 08:06:18,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:18,428 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:06:18,428 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:06:18,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1325, Invalid=1327, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:06:18,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:06:18,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:06:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:06:18,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 08:06:18,436 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-09-26 08:06:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:18,436 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 08:06:18,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:06:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 08:06:18,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:06:18,437 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:18,437 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-09-26 08:06:18,438 INFO L423 AbstractCegarLoop]: === Iteration 50 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:18,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:18,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1156363616, now seen corresponding path program 49 times [2018-09-26 08:06:18,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:18,827 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:18,827 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:18,827 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:06:18,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:06:18,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:06:18,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1377, Invalid=1379, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:06:18,830 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-09-26 08:06:18,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:18,877 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-26 08:06:18,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:06:18,878 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-09-26 08:06:18,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:18,878 INFO L225 Difference]: With dead ends: 56 [2018-09-26 08:06:18,878 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 08:06:18,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1377, Invalid=1379, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:06:18,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 08:06:18,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-09-26 08:06:18,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-26 08:06:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-09-26 08:06:18,885 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-09-26 08:06:18,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:18,885 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-09-26 08:06:18,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:06:18,885 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-09-26 08:06:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-26 08:06:18,886 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:18,886 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-09-26 08:06:18,886 INFO L423 AbstractCegarLoop]: === Iteration 51 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:18,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:18,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1487524128, now seen corresponding path program 50 times [2018-09-26 08:06:18,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:19,281 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:19,281 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:19,281 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:06:19,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:06:19,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:06:19,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1430, Invalid=1432, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:06:19,284 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-09-26 08:06:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:19,334 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-09-26 08:06:19,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:06:19,334 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-09-26 08:06:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:19,335 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:06:19,335 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:06:19,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1430, Invalid=1432, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:06:19,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:06:19,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 08:06:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:06:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-09-26 08:06:19,346 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-09-26 08:06:19,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:19,346 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-09-26 08:06:19,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:06:19,347 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-09-26 08:06:19,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:06:19,347 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:19,347 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-09-26 08:06:19,348 INFO L423 AbstractCegarLoop]: === Iteration 52 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:19,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:19,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1131401888, now seen corresponding path program 51 times [2018-09-26 08:06:19,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:19,774 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:19,774 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:19,774 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:06:19,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:06:19,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:06:19,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1484, Invalid=1486, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:06:19,777 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-09-26 08:06:19,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:19,835 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-09-26 08:06:19,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:06:19,836 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-09-26 08:06:19,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:19,836 INFO L225 Difference]: With dead ends: 58 [2018-09-26 08:06:19,837 INFO L226 Difference]: Without dead ends: 56 [2018-09-26 08:06:19,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1484, Invalid=1486, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:06:19,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-26 08:06:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-09-26 08:06:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-26 08:06:19,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-26 08:06:19,845 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-09-26 08:06:19,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:19,845 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-26 08:06:19,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:06:19,845 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-26 08:06:19,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-26 08:06:19,846 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:19,846 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-09-26 08:06:19,846 INFO L423 AbstractCegarLoop]: === Iteration 53 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:19,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:19,847 INFO L82 PathProgramCache]: Analyzing trace with hash 713729760, now seen corresponding path program 52 times [2018-09-26 08:06:19,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:20,392 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:20,393 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:20,393 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:06:20,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:06:20,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:06:20,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1539, Invalid=1541, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:06:20,395 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-09-26 08:06:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:20,448 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-26 08:06:20,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:06:20,449 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-09-26 08:06:20,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:20,449 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:06:20,450 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:06:20,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1539, Invalid=1541, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:06:20,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:06:20,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 08:06:20,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:06:20,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-26 08:06:20,457 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-09-26 08:06:20,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:20,458 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-26 08:06:20,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:06:20,458 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-26 08:06:20,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:06:20,460 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:20,461 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-09-26 08:06:20,461 INFO L423 AbstractCegarLoop]: === Iteration 54 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:20,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:20,461 INFO L82 PathProgramCache]: Analyzing trace with hash 650795680, now seen corresponding path program 53 times [2018-09-26 08:06:20,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:20,847 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:20,848 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:20,848 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:06:20,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:06:20,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:06:20,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1595, Invalid=1597, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:06:20,850 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2018-09-26 08:06:20,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:20,912 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-26 08:06:20,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:06:20,913 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-09-26 08:06:20,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:20,913 INFO L225 Difference]: With dead ends: 60 [2018-09-26 08:06:20,913 INFO L226 Difference]: Without dead ends: 58 [2018-09-26 08:06:20,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1595, Invalid=1597, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:06:20,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-26 08:06:20,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-09-26 08:06:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-26 08:06:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-09-26 08:06:20,921 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-09-26 08:06:20,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:20,921 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-09-26 08:06:20,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:06:20,921 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-09-26 08:06:20,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-26 08:06:20,922 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:20,922 INFO L375 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-09-26 08:06:20,922 INFO L423 AbstractCegarLoop]: === Iteration 55 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:20,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:20,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1300160800, now seen corresponding path program 54 times [2018-09-26 08:06:20,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:21,313 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:21,313 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:21,313 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:06:21,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:06:21,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:06:21,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1652, Invalid=1654, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:06:21,316 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-09-26 08:06:21,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:21,363 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-09-26 08:06:21,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:06:21,363 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-09-26 08:06:21,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:21,364 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:06:21,364 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:06:21,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1652, Invalid=1654, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:06:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:06:21,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 08:06:21,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:06:21,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-09-26 08:06:21,378 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-09-26 08:06:21,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:21,378 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-09-26 08:06:21,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:06:21,379 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-09-26 08:06:21,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:06:21,379 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:21,379 INFO L375 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-09-26 08:06:21,380 INFO L423 AbstractCegarLoop]: === Iteration 56 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:21,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:21,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1650269536, now seen corresponding path program 55 times [2018-09-26 08:06:21,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:21,794 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:21,794 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:21,794 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:06:21,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:06:21,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:06:21,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1710, Invalid=1712, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:06:21,796 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2018-09-26 08:06:21,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:21,863 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-09-26 08:06:21,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:06:21,863 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2018-09-26 08:06:21,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:21,864 INFO L225 Difference]: With dead ends: 62 [2018-09-26 08:06:21,864 INFO L226 Difference]: Without dead ends: 60 [2018-09-26 08:06:21,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1710, Invalid=1712, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:06:21,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-26 08:06:21,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-09-26 08:06:21,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-26 08:06:21,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-09-26 08:06:21,877 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-09-26 08:06:21,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:21,878 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-09-26 08:06:21,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:06:21,878 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-09-26 08:06:21,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-26 08:06:21,878 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:21,879 INFO L375 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-09-26 08:06:21,879 INFO L423 AbstractCegarLoop]: === Iteration 57 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:21,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:21,879 INFO L82 PathProgramCache]: Analyzing trace with hash 381261536, now seen corresponding path program 56 times [2018-09-26 08:06:21,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:22,295 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:22,296 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:22,296 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:06:22,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:06:22,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:06:22,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1769, Invalid=1771, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:06:22,298 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-09-26 08:06:22,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:22,370 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-26 08:06:22,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:06:22,371 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-09-26 08:06:22,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:22,372 INFO L225 Difference]: With dead ends: 63 [2018-09-26 08:06:22,372 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:06:22,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1769, Invalid=1771, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:06:22,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:06:22,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 08:06:22,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:06:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-26 08:06:22,380 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-09-26 08:06:22,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:22,380 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-26 08:06:22,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:06:22,381 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-26 08:06:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:06:22,381 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:22,382 INFO L375 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-09-26 08:06:22,382 INFO L423 AbstractCegarLoop]: === Iteration 58 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:22,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:22,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1065784672, now seen corresponding path program 57 times [2018-09-26 08:06:22,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:22,821 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:22,822 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:22,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:06:22,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:06:22,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:06:22,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1829, Invalid=1831, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:06:22,824 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2018-09-26 08:06:22,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:22,890 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-09-26 08:06:22,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:06:22,891 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2018-09-26 08:06:22,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:22,891 INFO L225 Difference]: With dead ends: 64 [2018-09-26 08:06:22,891 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 08:06:22,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1829, Invalid=1831, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:06:22,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 08:06:22,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-09-26 08:06:22,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-26 08:06:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-26 08:06:22,902 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-09-26 08:06:22,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:22,902 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-26 08:06:22,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:06:22,903 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-26 08:06:22,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-26 08:06:22,903 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:22,903 INFO L375 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-09-26 08:06:22,904 INFO L423 AbstractCegarLoop]: === Iteration 59 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:22,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:22,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1320423136, now seen corresponding path program 58 times [2018-09-26 08:06:22,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:23,341 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:23,342 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:23,342 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:06:23,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:06:23,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:06:23,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1890, Invalid=1892, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:06:23,344 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-09-26 08:06:23,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:23,405 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-26 08:06:23,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:06:23,405 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-09-26 08:06:23,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:23,406 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:06:23,406 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:06:23,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1890, Invalid=1892, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:06:23,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:06:23,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-26 08:06:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:06:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-09-26 08:06:23,413 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-09-26 08:06:23,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:23,413 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-09-26 08:06:23,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:06:23,414 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-09-26 08:06:23,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:06:23,414 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:23,414 INFO L375 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-09-26 08:06:23,415 INFO L423 AbstractCegarLoop]: === Iteration 60 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:23,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:23,415 INFO L82 PathProgramCache]: Analyzing trace with hash -2016546144, now seen corresponding path program 59 times [2018-09-26 08:06:23,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:23,886 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:23,887 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:23,887 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:06:23,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:06:23,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:06:23,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1952, Invalid=1954, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:06:23,889 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2018-09-26 08:06:23,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:23,939 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-26 08:06:23,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:06:23,940 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2018-09-26 08:06:23,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:23,940 INFO L225 Difference]: With dead ends: 66 [2018-09-26 08:06:23,940 INFO L226 Difference]: Without dead ends: 64 [2018-09-26 08:06:23,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1952, Invalid=1954, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:06:23,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-26 08:06:23,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-09-26 08:06:23,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-26 08:06:23,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-09-26 08:06:23,949 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-09-26 08:06:23,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:23,949 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-09-26 08:06:23,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:06:23,949 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-09-26 08:06:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-26 08:06:23,950 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:23,950 INFO L375 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-09-26 08:06:23,950 INFO L423 AbstractCegarLoop]: === Iteration 61 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:23,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:23,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1911588576, now seen corresponding path program 60 times [2018-09-26 08:06:23,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:24,368 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:24,369 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:24,369 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:06:24,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:06:24,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:06:24,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2015, Invalid=2017, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:06:24,371 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-09-26 08:06:24,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:24,432 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-26 08:06:24,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:06:24,432 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-09-26 08:06:24,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:24,433 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:06:24,433 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:06:24,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2015, Invalid=2017, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:06:24,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:06:24,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:06:24,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:06:24,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-26 08:06:24,441 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-09-26 08:06:24,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:24,441 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-26 08:06:24,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:06:24,441 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-26 08:06:24,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:06:24,442 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:24,442 INFO L375 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-09-26 08:06:24,442 INFO L423 AbstractCegarLoop]: === Iteration 62 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:24,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:24,443 INFO L82 PathProgramCache]: Analyzing trace with hash -870286688, now seen corresponding path program 61 times [2018-09-26 08:06:24,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:24,851 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:24,852 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:24,852 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:06:24,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:06:24,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:06:24,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2079, Invalid=2081, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:06:24,855 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2018-09-26 08:06:24,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:24,919 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-09-26 08:06:24,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:06:24,919 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2018-09-26 08:06:24,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:24,920 INFO L225 Difference]: With dead ends: 68 [2018-09-26 08:06:24,920 INFO L226 Difference]: Without dead ends: 66 [2018-09-26 08:06:24,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2079, Invalid=2081, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:06:24,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-26 08:06:24,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-09-26 08:06:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-26 08:06:24,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-26 08:06:24,928 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-09-26 08:06:24,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:24,929 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-26 08:06:24,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:06:24,929 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-26 08:06:24,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 08:06:24,930 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:24,930 INFO L375 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-09-26 08:06:24,930 INFO L423 AbstractCegarLoop]: === Iteration 63 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:24,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:24,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1209073952, now seen corresponding path program 62 times [2018-09-26 08:06:24,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:25,370 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:25,370 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:25,371 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:06:25,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:06:25,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:06:25,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2144, Invalid=2146, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:06:25,373 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-09-26 08:06:25,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:25,436 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-09-26 08:06:25,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:06:25,437 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-09-26 08:06:25,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:25,438 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:06:25,438 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:06:25,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2144, Invalid=2146, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:06:25,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:06:25,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 08:06:25,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:06:25,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-09-26 08:06:25,448 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-09-26 08:06:25,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:25,448 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-09-26 08:06:25,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:06:25,449 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-09-26 08:06:25,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:06:25,449 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:25,449 INFO L375 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-09-26 08:06:25,450 INFO L423 AbstractCegarLoop]: === Iteration 64 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:25,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:25,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1173422752, now seen corresponding path program 63 times [2018-09-26 08:06:25,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:25,895 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:25,896 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:25,896 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:06:25,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:06:25,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:06:25,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2210, Invalid=2212, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:06:25,898 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2018-09-26 08:06:25,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:25,967 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-26 08:06:25,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:06:25,967 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-09-26 08:06:25,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:25,968 INFO L225 Difference]: With dead ends: 70 [2018-09-26 08:06:25,968 INFO L226 Difference]: Without dead ends: 68 [2018-09-26 08:06:25,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2210, Invalid=2212, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:06:25,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-26 08:06:25,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-09-26 08:06:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-26 08:06:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-09-26 08:06:25,979 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-09-26 08:06:25,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:25,979 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-09-26 08:06:25,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:06:25,979 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-09-26 08:06:25,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-26 08:06:25,980 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:25,980 INFO L375 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-09-26 08:06:25,981 INFO L423 AbstractCegarLoop]: === Iteration 65 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:25,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:25,981 INFO L82 PathProgramCache]: Analyzing trace with hash 2016376544, now seen corresponding path program 64 times [2018-09-26 08:06:25,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:26,457 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:26,457 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:26,458 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:06:26,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:06:26,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:06:26,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2277, Invalid=2279, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:06:26,460 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-09-26 08:06:26,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:26,524 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-26 08:06:26,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:06:26,524 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-09-26 08:06:26,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:26,525 INFO L225 Difference]: With dead ends: 71 [2018-09-26 08:06:26,525 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:06:26,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2277, Invalid=2279, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:06:26,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:06:26,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-26 08:06:26,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:06:26,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-26 08:06:26,534 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-09-26 08:06:26,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:26,535 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-26 08:06:26,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:06:26,535 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-26 08:06:26,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:06:26,536 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:26,536 INFO L375 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-09-26 08:06:26,537 INFO L423 AbstractCegarLoop]: === Iteration 66 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:26,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:26,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1916826976, now seen corresponding path program 65 times [2018-09-26 08:06:26,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:27,159 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:27,160 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:27,160 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:06:27,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:06:27,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:06:27,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2345, Invalid=2347, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:06:27,162 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2018-09-26 08:06:27,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:27,207 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-09-26 08:06:27,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:06:27,207 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2018-09-26 08:06:27,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:27,208 INFO L225 Difference]: With dead ends: 72 [2018-09-26 08:06:27,208 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 08:06:27,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=2345, Invalid=2347, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:06:27,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 08:06:27,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-09-26 08:06:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-26 08:06:27,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-09-26 08:06:27,215 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-09-26 08:06:27,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:27,215 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-09-26 08:06:27,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:06:27,215 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-09-26 08:06:27,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-26 08:06:27,216 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:27,216 INFO L375 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-09-26 08:06:27,216 INFO L423 AbstractCegarLoop]: === Iteration 67 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:27,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:27,217 INFO L82 PathProgramCache]: Analyzing trace with hash 707915488, now seen corresponding path program 66 times [2018-09-26 08:06:27,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:27,670 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:27,670 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:27,671 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:06:27,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:06:27,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:06:27,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2414, Invalid=2416, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:06:27,673 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-09-26 08:06:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:27,743 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-09-26 08:06:27,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:06:27,743 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-09-26 08:06:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:27,744 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:06:27,744 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:06:27,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2414, Invalid=2416, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:06:27,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:06:27,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-26 08:06:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:06:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-26 08:06:27,752 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-09-26 08:06:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:27,752 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-26 08:06:27,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:06:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-26 08:06:27,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:06:27,753 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:27,753 INFO L375 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-09-26 08:06:27,753 INFO L423 AbstractCegarLoop]: === Iteration 68 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:27,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:27,754 INFO L82 PathProgramCache]: Analyzing trace with hash 470553248, now seen corresponding path program 67 times [2018-09-26 08:06:27,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:28,170 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:28,170 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:28,170 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:06:28,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:06:28,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:06:28,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2484, Invalid=2486, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:06:28,172 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2018-09-26 08:06:28,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:28,245 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-09-26 08:06:28,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:06:28,245 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2018-09-26 08:06:28,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:28,246 INFO L225 Difference]: With dead ends: 74 [2018-09-26 08:06:28,246 INFO L226 Difference]: Without dead ends: 72 [2018-09-26 08:06:28,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2484, Invalid=2486, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:06:28,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-26 08:06:28,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-09-26 08:06:28,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-26 08:06:28,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-09-26 08:06:28,253 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-09-26 08:06:28,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:28,253 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-09-26 08:06:28,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:06:28,253 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-09-26 08:06:28,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-26 08:06:28,254 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:28,254 INFO L375 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-09-26 08:06:28,254 INFO L423 AbstractCegarLoop]: === Iteration 69 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:28,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:28,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1702258400, now seen corresponding path program 68 times [2018-09-26 08:06:28,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:28,678 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:28,679 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:28,679 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:06:28,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:06:28,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:06:28,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2555, Invalid=2557, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:06:28,681 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-09-26 08:06:28,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:28,748 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-26 08:06:28,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:06:28,748 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-09-26 08:06:28,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:28,749 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:06:28,749 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:06:28,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2555, Invalid=2557, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:06:28,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:06:28,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-26 08:06:28,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:06:28,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-26 08:06:28,755 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-09-26 08:06:28,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:28,756 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-26 08:06:28,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:06:28,756 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-26 08:06:28,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:06:28,756 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:28,756 INFO L375 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-09-26 08:06:28,757 INFO L423 AbstractCegarLoop]: === Iteration 70 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:28,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:28,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1230412448, now seen corresponding path program 69 times [2018-09-26 08:06:28,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:29,225 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:29,225 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:29,225 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:06:29,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:06:29,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:06:29,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2627, Invalid=2629, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:06:29,227 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2018-09-26 08:06:29,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:29,294 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-26 08:06:29,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:06:29,294 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2018-09-26 08:06:29,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:29,295 INFO L225 Difference]: With dead ends: 76 [2018-09-26 08:06:29,295 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 08:06:29,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2627, Invalid=2629, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:06:29,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 08:06:29,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-26 08:06:29,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-26 08:06:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-09-26 08:06:29,302 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-09-26 08:06:29,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:29,303 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-09-26 08:06:29,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:06:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-09-26 08:06:29,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-26 08:06:29,304 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:29,304 INFO L375 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-09-26 08:06:29,304 INFO L423 AbstractCegarLoop]: === Iteration 71 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:29,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:29,304 INFO L82 PathProgramCache]: Analyzing trace with hash -511910176, now seen corresponding path program 70 times [2018-09-26 08:06:29,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:29,817 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:29,817 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:29,818 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:06:29,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:06:29,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:06:29,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2700, Invalid=2702, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:06:29,823 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-09-26 08:06:29,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:29,879 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-09-26 08:06:29,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:06:29,880 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-09-26 08:06:29,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:29,880 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:06:29,881 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:06:29,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2700, Invalid=2702, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:06:29,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:06:29,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-26 08:06:29,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:06:29,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-09-26 08:06:29,888 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-09-26 08:06:29,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:29,888 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-09-26 08:06:29,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:06:29,888 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-09-26 08:06:29,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:06:29,889 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:29,889 INFO L375 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-09-26 08:06:29,889 INFO L423 AbstractCegarLoop]: === Iteration 72 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:29,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:29,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1310663328, now seen corresponding path program 71 times [2018-09-26 08:06:29,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:30,458 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:30,459 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:30,459 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:06:30,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:06:30,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:06:30,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2774, Invalid=2776, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:06:30,461 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2018-09-26 08:06:30,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:30,504 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-09-26 08:06:30,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:06:30,505 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2018-09-26 08:06:30,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:30,505 INFO L225 Difference]: With dead ends: 78 [2018-09-26 08:06:30,505 INFO L226 Difference]: Without dead ends: 76 [2018-09-26 08:06:30,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=2774, Invalid=2776, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:06:30,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-26 08:06:30,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-09-26 08:06:30,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 08:06:30,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-26 08:06:30,512 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-09-26 08:06:30,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:30,513 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-26 08:06:30,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:06:30,513 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-26 08:06:30,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-26 08:06:30,513 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:30,514 INFO L375 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-09-26 08:06:30,514 INFO L423 AbstractCegarLoop]: === Iteration 73 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:30,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:30,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1975867104, now seen corresponding path program 72 times [2018-09-26 08:06:30,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:30,915 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:30,915 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:30,915 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:06:30,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:06:30,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:06:30,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2849, Invalid=2851, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:06:30,917 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-09-26 08:06:30,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:30,969 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-26 08:06:30,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:06:30,969 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-09-26 08:06:30,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:30,970 INFO L225 Difference]: With dead ends: 79 [2018-09-26 08:06:30,970 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:06:30,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2849, Invalid=2851, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:06:30,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:06:30,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 08:06:30,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:06:30,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 08:06:30,977 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-09-26 08:06:30,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:30,977 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 08:06:30,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:06:30,977 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 08:06:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:06:30,978 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:30,978 INFO L375 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-09-26 08:06:30,979 INFO L423 AbstractCegarLoop]: === Iteration 74 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:30,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:30,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1122347680, now seen corresponding path program 73 times [2018-09-26 08:06:30,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:31,447 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:31,447 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:31,447 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:06:31,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:06:31,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:06:31,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=2927, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:06:31,449 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2018-09-26 08:06:31,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:31,511 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-26 08:06:31,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:06:31,511 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2018-09-26 08:06:31,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:31,512 INFO L225 Difference]: With dead ends: 80 [2018-09-26 08:06:31,512 INFO L226 Difference]: Without dead ends: 78 [2018-09-26 08:06:31,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2925, Invalid=2927, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:06:31,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-26 08:06:31,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-09-26 08:06:31,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-26 08:06:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-09-26 08:06:31,519 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-09-26 08:06:31,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:31,519 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-09-26 08:06:31,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:06:31,519 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-09-26 08:06:31,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-26 08:06:31,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:31,520 INFO L375 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-09-26 08:06:31,520 INFO L423 AbstractCegarLoop]: === Iteration 75 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:31,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:31,520 INFO L82 PathProgramCache]: Analyzing trace with hash 433049312, now seen corresponding path program 74 times [2018-09-26 08:06:31,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:32,054 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:32,055 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:32,055 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:06:32,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:06:32,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:06:32,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3002, Invalid=3004, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:06:32,057 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-09-26 08:06:32,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:32,130 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-09-26 08:06:32,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:06:32,130 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-09-26 08:06:32,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:32,131 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:06:32,131 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:06:32,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3002, Invalid=3004, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:06:32,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:06:32,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-26 08:06:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:06:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-09-26 08:06:32,139 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-09-26 08:06:32,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:32,139 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-09-26 08:06:32,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:06:32,139 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-09-26 08:06:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:06:32,140 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:32,140 INFO L375 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-09-26 08:06:32,140 INFO L423 AbstractCegarLoop]: === Iteration 76 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:32,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:32,141 INFO L82 PathProgramCache]: Analyzing trace with hash 539636384, now seen corresponding path program 75 times [2018-09-26 08:06:32,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:32,710 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:32,711 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:32,711 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:06:32,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:06:32,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:06:32,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3080, Invalid=3082, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:06:32,713 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2018-09-26 08:06:32,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:32,799 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-09-26 08:06:32,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:06:32,799 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2018-09-26 08:06:32,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:32,800 INFO L225 Difference]: With dead ends: 82 [2018-09-26 08:06:32,800 INFO L226 Difference]: Without dead ends: 80 [2018-09-26 08:06:32,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3080, Invalid=3082, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:06:32,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-26 08:06:32,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-26 08:06:32,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-26 08:06:32,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-09-26 08:06:32,807 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-09-26 08:06:32,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:32,807 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-09-26 08:06:32,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:06:32,807 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-09-26 08:06:32,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-26 08:06:32,808 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:32,808 INFO L375 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-09-26 08:06:32,808 INFO L423 AbstractCegarLoop]: === Iteration 77 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:32,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:32,809 INFO L82 PathProgramCache]: Analyzing trace with hash -451131680, now seen corresponding path program 76 times [2018-09-26 08:06:32,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:33,363 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:33,363 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:33,364 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:06:33,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:06:33,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:06:33,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3159, Invalid=3161, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:06:33,365 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-09-26 08:06:33,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:33,474 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-26 08:06:33,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:06:33,474 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-09-26 08:06:33,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:33,475 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:06:33,475 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 08:06:33,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3159, Invalid=3161, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:06:33,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 08:06:33,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-26 08:06:33,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:06:33,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-26 08:06:33,483 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-09-26 08:06:33,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:33,484 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-26 08:06:33,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:06:33,484 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-26 08:06:33,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:06:33,485 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:33,485 INFO L375 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-09-26 08:06:33,485 INFO L423 AbstractCegarLoop]: === Iteration 78 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:33,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:33,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1100170592, now seen corresponding path program 77 times [2018-09-26 08:06:33,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:34,129 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:34,130 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:34,130 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:06:34,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:06:34,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:06:34,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3239, Invalid=3241, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:06:34,131 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2018-09-26 08:06:34,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:34,201 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-09-26 08:06:34,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:06:34,202 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2018-09-26 08:06:34,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:34,202 INFO L225 Difference]: With dead ends: 84 [2018-09-26 08:06:34,203 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 08:06:34,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3239, Invalid=3241, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:06:34,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 08:06:34,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-09-26 08:06:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-26 08:06:34,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-09-26 08:06:34,210 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-09-26 08:06:34,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:34,210 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-09-26 08:06:34,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:06:34,210 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-09-26 08:06:34,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-26 08:06:34,211 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:34,211 INFO L375 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-09-26 08:06:34,211 INFO L423 AbstractCegarLoop]: === Iteration 79 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:34,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:34,212 INFO L82 PathProgramCache]: Analyzing trace with hash 254459616, now seen corresponding path program 78 times [2018-09-26 08:06:34,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:34,684 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:34,685 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:34,685 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:06:34,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:06:34,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:06:34,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3320, Invalid=3322, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:06:34,687 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-09-26 08:06:34,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:34,755 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-26 08:06:34,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:06:34,756 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-09-26 08:06:34,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:34,757 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:06:34,757 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:06:34,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3320, Invalid=3322, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:06:34,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:06:34,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 08:06:34,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:06:34,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-09-26 08:06:34,763 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-09-26 08:06:34,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:34,764 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-09-26 08:06:34,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:06:34,764 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-09-26 08:06:34,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:06:34,764 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:34,764 INFO L375 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-09-26 08:06:34,765 INFO L423 AbstractCegarLoop]: === Iteration 80 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:34,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:34,765 INFO L82 PathProgramCache]: Analyzing trace with hash -701676896, now seen corresponding path program 79 times [2018-09-26 08:06:34,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:35,191 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:35,192 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:35,192 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:06:35,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:06:35,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:06:35,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3402, Invalid=3404, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:06:35,194 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2018-09-26 08:06:35,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:35,253 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-26 08:06:35,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:06:35,253 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 82 [2018-09-26 08:06:35,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:35,254 INFO L225 Difference]: With dead ends: 86 [2018-09-26 08:06:35,254 INFO L226 Difference]: Without dead ends: 84 [2018-09-26 08:06:35,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3402, Invalid=3404, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:06:35,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-26 08:06:35,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-09-26 08:06:35,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-26 08:06:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-09-26 08:06:35,261 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-09-26 08:06:35,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:35,262 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-09-26 08:06:35,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:06:35,262 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-09-26 08:06:35,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-26 08:06:35,263 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:35,263 INFO L375 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-09-26 08:06:35,263 INFO L423 AbstractCegarLoop]: === Iteration 81 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:35,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:35,264 INFO L82 PathProgramCache]: Analyzing trace with hash -277137696, now seen corresponding path program 80 times [2018-09-26 08:06:35,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:35,693 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:35,694 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:35,694 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:06:35,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:06:35,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:06:35,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3485, Invalid=3487, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:06:35,695 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2018-09-26 08:06:35,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:35,771 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-26 08:06:35,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:06:35,771 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2018-09-26 08:06:35,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:35,772 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:06:35,772 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:06:35,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3485, Invalid=3487, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:06:35,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:06:35,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 08:06:35,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:06:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-26 08:06:35,779 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-09-26 08:06:35,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:35,779 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-26 08:06:35,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:06:35,780 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-26 08:06:35,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:06:35,780 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:35,781 INFO L375 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-09-26 08:06:35,781 INFO L423 AbstractCegarLoop]: === Iteration 82 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:35,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:35,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1324384, now seen corresponding path program 81 times [2018-09-26 08:06:35,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:36,224 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:36,224 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:36,225 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:06:36,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:06:36,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:06:36,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3569, Invalid=3571, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:06:36,227 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 85 states. [2018-09-26 08:06:36,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:36,309 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-09-26 08:06:36,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:06:36,309 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 84 [2018-09-26 08:06:36,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:36,310 INFO L225 Difference]: With dead ends: 88 [2018-09-26 08:06:36,310 INFO L226 Difference]: Without dead ends: 86 [2018-09-26 08:06:36,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3569, Invalid=3571, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:06:36,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-26 08:06:36,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-09-26 08:06:36,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-26 08:06:36,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-26 08:06:36,318 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-09-26 08:06:36,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:36,318 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-26 08:06:36,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:06:36,318 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-26 08:06:36,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-26 08:06:36,319 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:36,319 INFO L375 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-09-26 08:06:36,319 INFO L423 AbstractCegarLoop]: === Iteration 83 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:36,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:36,319 INFO L82 PathProgramCache]: Analyzing trace with hash -41046304, now seen corresponding path program 82 times [2018-09-26 08:06:36,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:36,823 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:36,823 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:36,823 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:06:36,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:06:36,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:06:36,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3654, Invalid=3656, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:06:36,825 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2018-09-26 08:06:36,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:36,879 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-09-26 08:06:36,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:06:36,879 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 85 [2018-09-26 08:06:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:36,880 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:06:36,880 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:06:36,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3654, Invalid=3656, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:06:36,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:06:36,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 08:06:36,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:06:36,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-09-26 08:06:36,887 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-09-26 08:06:36,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:36,887 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-09-26 08:06:36,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:06:36,887 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-09-26 08:06:36,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:06:36,888 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:36,888 INFO L375 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-09-26 08:06:36,888 INFO L423 AbstractCegarLoop]: === Iteration 84 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:36,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:36,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1272425824, now seen corresponding path program 83 times [2018-09-26 08:06:36,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:37,549 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:37,550 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:37,550 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:06:37,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:06:37,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:06:37,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3740, Invalid=3742, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:06:37,552 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 87 states. [2018-09-26 08:06:37,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:37,676 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-26 08:06:37,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:06:37,676 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 86 [2018-09-26 08:06:37,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:37,677 INFO L225 Difference]: With dead ends: 90 [2018-09-26 08:06:37,677 INFO L226 Difference]: Without dead ends: 88 [2018-09-26 08:06:37,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=3740, Invalid=3742, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:06:37,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-26 08:06:37,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-09-26 08:06:37,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-26 08:06:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-09-26 08:06:37,685 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-09-26 08:06:37,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:37,686 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-09-26 08:06:37,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:06:37,686 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-09-26 08:06:37,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-26 08:06:37,687 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:37,687 INFO L375 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-09-26 08:06:37,687 INFO L423 AbstractCegarLoop]: === Iteration 85 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:37,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:37,687 INFO L82 PathProgramCache]: Analyzing trace with hash -790485280, now seen corresponding path program 84 times [2018-09-26 08:06:37,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:38,259 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:38,260 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:38,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:06:38,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:06:38,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:06:38,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3827, Invalid=3829, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:06:38,267 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2018-09-26 08:06:38,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:38,343 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-26 08:06:38,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:06:38,343 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 87 [2018-09-26 08:06:38,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:38,344 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:06:38,344 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:06:38,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3827, Invalid=3829, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:06:38,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:06:38,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-26 08:06:38,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:06:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-26 08:06:38,352 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-09-26 08:06:38,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:38,352 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-26 08:06:38,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:06:38,353 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-26 08:06:38,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:06:38,353 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:38,353 INFO L375 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-09-26 08:06:38,354 INFO L423 AbstractCegarLoop]: === Iteration 86 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:38,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:38,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1264769696, now seen corresponding path program 85 times [2018-09-26 08:06:38,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:38,792 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:38,793 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:38,793 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:06:38,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:06:38,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:06:38,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3915, Invalid=3917, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:06:38,795 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 89 states. [2018-09-26 08:06:38,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:38,880 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-09-26 08:06:38,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:06:38,881 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 88 [2018-09-26 08:06:38,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:38,881 INFO L225 Difference]: With dead ends: 92 [2018-09-26 08:06:38,882 INFO L226 Difference]: Without dead ends: 90 [2018-09-26 08:06:38,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3915, Invalid=3917, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:06:38,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-26 08:06:38,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-09-26 08:06:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-26 08:06:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-09-26 08:06:38,888 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-09-26 08:06:38,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:38,888 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-09-26 08:06:38,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:06:38,888 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-09-26 08:06:38,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-26 08:06:38,889 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:38,889 INFO L375 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-09-26 08:06:38,889 INFO L423 AbstractCegarLoop]: === Iteration 87 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:38,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:38,890 INFO L82 PathProgramCache]: Analyzing trace with hash 553164512, now seen corresponding path program 86 times [2018-09-26 08:06:38,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:39,278 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:39,279 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:39,279 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:06:39,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:06:39,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:06:39,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4004, Invalid=4006, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:06:39,281 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 90 states. [2018-09-26 08:06:39,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:39,357 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-09-26 08:06:39,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:06:39,358 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 89 [2018-09-26 08:06:39,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:39,359 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:06:39,359 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:06:39,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4004, Invalid=4006, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:06:39,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:06:39,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 08:06:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:06:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-26 08:06:39,380 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-09-26 08:06:39,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:39,380 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-26 08:06:39,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:06:39,380 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-26 08:06:39,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:06:39,381 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:39,381 INFO L375 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-09-26 08:06:39,381 INFO L423 AbstractCegarLoop]: === Iteration 88 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:39,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:39,383 INFO L82 PathProgramCache]: Analyzing trace with hash -31759712, now seen corresponding path program 87 times [2018-09-26 08:06:39,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:39,869 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:39,869 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:39,869 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:06:39,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:06:39,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:06:39,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4094, Invalid=4096, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:06:39,871 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 91 states. [2018-09-26 08:06:39,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:39,956 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-09-26 08:06:39,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:06:39,956 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 90 [2018-09-26 08:06:39,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:39,957 INFO L225 Difference]: With dead ends: 94 [2018-09-26 08:06:39,957 INFO L226 Difference]: Without dead ends: 92 [2018-09-26 08:06:39,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4094, Invalid=4096, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:06:39,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-26 08:06:39,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-09-26 08:06:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-26 08:06:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-09-26 08:06:39,966 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-09-26 08:06:39,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:39,966 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-09-26 08:06:39,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:06:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-09-26 08:06:39,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-26 08:06:39,967 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:39,967 INFO L375 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-09-26 08:06:39,968 INFO L423 AbstractCegarLoop]: === Iteration 89 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:39,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:39,968 INFO L82 PathProgramCache]: Analyzing trace with hash -984541472, now seen corresponding path program 88 times [2018-09-26 08:06:39,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:40,633 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:40,633 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:40,633 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:06:40,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:06:40,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:06:40,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4185, Invalid=4187, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:06:40,635 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 92 states. [2018-09-26 08:06:40,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:40,744 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-26 08:06:40,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:06:40,745 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 91 [2018-09-26 08:06:40,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:40,746 INFO L225 Difference]: With dead ends: 95 [2018-09-26 08:06:40,746 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 08:06:40,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=4185, Invalid=4187, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:06:40,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 08:06:40,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-26 08:06:40,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:06:40,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-26 08:06:40,754 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-09-26 08:06:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:40,755 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-26 08:06:40,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:06:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-26 08:06:40,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:06:40,756 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:40,756 INFO L375 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-09-26 08:06:40,756 INFO L423 AbstractCegarLoop]: === Iteration 90 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:40,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:40,757 INFO L82 PathProgramCache]: Analyzing trace with hash -456004960, now seen corresponding path program 89 times [2018-09-26 08:06:40,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:41,207 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:41,207 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:41,207 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:06:41,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:06:41,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:06:41,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4277, Invalid=4279, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:06:41,209 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 93 states. [2018-09-26 08:06:41,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:41,259 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-26 08:06:41,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:06:41,260 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 92 [2018-09-26 08:06:41,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:41,260 INFO L225 Difference]: With dead ends: 96 [2018-09-26 08:06:41,260 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 08:06:41,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4277, Invalid=4279, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:06:41,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 08:06:41,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-09-26 08:06:41,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-26 08:06:41,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-09-26 08:06:41,267 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-09-26 08:06:41,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:41,267 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-09-26 08:06:41,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:06:41,267 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-09-26 08:06:41,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-09-26 08:06:41,268 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:41,268 INFO L375 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-09-26 08:06:41,268 INFO L423 AbstractCegarLoop]: === Iteration 91 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:41,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:41,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1251242272, now seen corresponding path program 90 times [2018-09-26 08:06:41,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:41,731 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:41,732 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:41,732 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:06:41,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:06:41,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:06:41,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4370, Invalid=4372, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:06:41,734 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 94 states. [2018-09-26 08:06:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:41,838 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-09-26 08:06:41,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:06:41,838 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 93 [2018-09-26 08:06:41,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:41,839 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:06:41,839 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:06:41,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4370, Invalid=4372, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:06:41,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:06:41,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-26 08:06:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:06:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-09-26 08:06:41,847 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-09-26 08:06:41,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:41,847 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-09-26 08:06:41,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:06:41,847 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-09-26 08:06:41,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:06:41,847 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:41,848 INFO L375 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-09-26 08:06:41,848 INFO L423 AbstractCegarLoop]: === Iteration 92 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:41,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:41,848 INFO L82 PathProgramCache]: Analyzing trace with hash -133795168, now seen corresponding path program 91 times [2018-09-26 08:06:41,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:42,298 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:42,298 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:42,299 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:06:42,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:06:42,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:06:42,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4464, Invalid=4466, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:06:42,301 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 95 states. [2018-09-26 08:06:42,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:42,401 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-09-26 08:06:42,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:06:42,401 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 94 [2018-09-26 08:06:42,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:42,402 INFO L225 Difference]: With dead ends: 98 [2018-09-26 08:06:42,402 INFO L226 Difference]: Without dead ends: 96 [2018-09-26 08:06:42,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4464, Invalid=4466, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:06:42,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-26 08:06:42,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-09-26 08:06:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-26 08:06:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-26 08:06:42,408 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-09-26 08:06:42,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:42,408 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-26 08:06:42,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:06:42,408 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-26 08:06:42,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-26 08:06:42,409 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:42,409 INFO L375 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-09-26 08:06:42,409 INFO L423 AbstractCegarLoop]: === Iteration 93 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:42,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:42,409 INFO L82 PathProgramCache]: Analyzing trace with hash 147326688, now seen corresponding path program 92 times [2018-09-26 08:06:42,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:42,900 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:42,901 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:42,901 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:06:42,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:06:42,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:06:42,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4559, Invalid=4561, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:06:42,903 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 96 states. [2018-09-26 08:06:42,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:42,974 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-26 08:06:42,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:06:42,974 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 95 [2018-09-26 08:06:42,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:42,975 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:06:42,975 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:06:42,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4559, Invalid=4561, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:06:42,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:06:42,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-26 08:06:42,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:06:42,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-26 08:06:42,983 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-09-26 08:06:42,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:42,983 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-26 08:06:42,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:06:42,984 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-26 08:06:42,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:06:42,984 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:42,984 INFO L375 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-09-26 08:06:42,984 INFO L423 AbstractCegarLoop]: === Iteration 94 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:42,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:42,985 INFO L82 PathProgramCache]: Analyzing trace with hash 272169632, now seen corresponding path program 93 times [2018-09-26 08:06:42,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:43,544 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:43,544 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:43,544 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:06:43,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:06:43,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:06:43,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4655, Invalid=4657, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:06:43,546 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 97 states. [2018-09-26 08:06:43,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:43,593 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-26 08:06:43,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:06:43,593 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 96 [2018-09-26 08:06:43,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:43,594 INFO L225 Difference]: With dead ends: 100 [2018-09-26 08:06:43,594 INFO L226 Difference]: Without dead ends: 98 [2018-09-26 08:06:43,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4655, Invalid=4657, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:06:43,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-26 08:06:43,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-09-26 08:06:43,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-26 08:06:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-09-26 08:06:43,599 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-09-26 08:06:43,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:43,600 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-09-26 08:06:43,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:06:43,600 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-09-26 08:06:43,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-26 08:06:43,600 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:43,600 INFO L375 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-09-26 08:06:43,601 INFO L423 AbstractCegarLoop]: === Iteration 95 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:43,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:43,601 INFO L82 PathProgramCache]: Analyzing trace with hash -152666400, now seen corresponding path program 94 times [2018-09-26 08:06:43,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:44,072 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:44,072 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:44,072 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:06:44,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:06:44,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:06:44,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4752, Invalid=4754, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:06:44,074 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 98 states. [2018-09-26 08:06:44,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:44,128 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-09-26 08:06:44,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:06:44,129 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 97 [2018-09-26 08:06:44,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:44,129 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:06:44,129 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:06:44,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4752, Invalid=4754, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:06:44,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:06:44,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-26 08:06:44,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:06:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-09-26 08:06:44,137 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-09-26 08:06:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:44,137 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-09-26 08:06:44,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:06:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-09-26 08:06:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:06:44,138 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:44,138 INFO L375 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-09-26 08:06:44,138 INFO L423 AbstractCegarLoop]: === Iteration 96 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:44,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:44,138 INFO L82 PathProgramCache]: Analyzing trace with hash -437681504, now seen corresponding path program 95 times [2018-09-26 08:06:44,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:44,643 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:44,643 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:44,643 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:06:44,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:06:44,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:06:44,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4850, Invalid=4852, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:06:44,645 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 99 states. [2018-09-26 08:06:44,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:44,722 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-09-26 08:06:44,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:06:44,722 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 98 [2018-09-26 08:06:44,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:44,723 INFO L225 Difference]: With dead ends: 102 [2018-09-26 08:06:44,723 INFO L226 Difference]: Without dead ends: 100 [2018-09-26 08:06:44,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4850, Invalid=4852, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:06:44,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-26 08:06:44,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-26 08:06:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 08:06:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-09-26 08:06:44,730 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-09-26 08:06:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:44,730 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-09-26 08:06:44,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:06:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-09-26 08:06:44,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-26 08:06:44,731 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:44,731 INFO L375 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-09-26 08:06:44,731 INFO L423 AbstractCegarLoop]: === Iteration 97 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:44,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:44,731 INFO L82 PathProgramCache]: Analyzing trace with hash -683215136, now seen corresponding path program 96 times [2018-09-26 08:06:44,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:45,261 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:45,261 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:45,261 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:06:45,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:06:45,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:06:45,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4949, Invalid=4951, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:06:45,263 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 100 states. [2018-09-26 08:06:45,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:45,378 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-26 08:06:45,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:06:45,378 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 99 [2018-09-26 08:06:45,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:45,379 INFO L225 Difference]: With dead ends: 103 [2018-09-26 08:06:45,379 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:06:45,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4949, Invalid=4951, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:06:45,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:06:45,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-09-26 08:06:45,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:06:45,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 08:06:45,387 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-09-26 08:06:45,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:45,387 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 08:06:45,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:06:45,387 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 08:06:45,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:06:45,388 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:45,388 INFO L375 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-09-26 08:06:45,388 INFO L423 AbstractCegarLoop]: === Iteration 98 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:45,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:45,388 INFO L82 PathProgramCache]: Analyzing trace with hash 295176864, now seen corresponding path program 97 times [2018-09-26 08:06:45,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:45,945 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:45,945 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:45,945 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:06:45,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:06:45,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:06:45,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5049, Invalid=5051, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:06:45,947 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 101 states. [2018-09-26 08:06:46,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:46,065 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-26 08:06:46,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:06:46,065 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 100 [2018-09-26 08:06:46,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:46,066 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:06:46,067 INFO L226 Difference]: Without dead ends: 102 [2018-09-26 08:06:46,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5049, Invalid=5051, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:06:46,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-26 08:06:46,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-09-26 08:06:46,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-26 08:06:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-09-26 08:06:46,074 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-09-26 08:06:46,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:46,075 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-09-26 08:06:46,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:06:46,075 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-09-26 08:06:46,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-26 08:06:46,075 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:46,076 INFO L375 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-09-26 08:06:46,076 INFO L423 AbstractCegarLoop]: === Iteration 99 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:46,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:46,076 INFO L82 PathProgramCache]: Analyzing trace with hash 560557792, now seen corresponding path program 98 times [2018-09-26 08:06:46,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:46,736 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:46,737 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:46,737 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:06:46,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:06:46,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:06:46,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5150, Invalid=5152, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:06:46,739 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 102 states. [2018-09-26 08:06:46,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:46,870 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-26 08:06:46,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:06:46,870 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 101 [2018-09-26 08:06:46,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:46,871 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:06:46,871 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:06:46,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=5150, Invalid=5152, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:06:46,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:06:46,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-26 08:06:46,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:06:46,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-09-26 08:06:46,879 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-09-26 08:06:46,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:46,880 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-09-26 08:06:46,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:06:46,880 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-09-26 08:06:46,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:06:46,880 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:46,881 INFO L375 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-09-26 08:06:46,881 INFO L423 AbstractCegarLoop]: === Iteration 100 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:46,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:46,881 INFO L82 PathProgramCache]: Analyzing trace with hash 197431968, now seen corresponding path program 99 times [2018-09-26 08:06:46,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:47,515 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:47,515 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:47,515 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:06:47,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:06:47,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:06:47,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5252, Invalid=5254, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:06:47,517 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 103 states. [2018-09-26 08:06:47,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:47,626 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-09-26 08:06:47,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:06:47,626 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 102 [2018-09-26 08:06:47,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:47,627 INFO L225 Difference]: With dead ends: 106 [2018-09-26 08:06:47,627 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 08:06:47,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5252, Invalid=5254, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:06:47,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 08:06:47,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-09-26 08:06:47,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-26 08:06:47,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-09-26 08:06:47,633 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-09-26 08:06:47,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:47,633 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-09-26 08:06:47,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:06:47,634 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-09-26 08:06:47,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-26 08:06:47,634 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:47,634 INFO L375 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-09-26 08:06:47,635 INFO L423 AbstractCegarLoop]: === Iteration 101 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:47,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:47,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1825433312, now seen corresponding path program 100 times [2018-09-26 08:06:47,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:49,019 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:49,019 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:49,020 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:06:49,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:06:49,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:06:49,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:06:49,021 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-09-26 08:06:50,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:50,514 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-26 08:06:50,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:06:50,514 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-09-26 08:06:50,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:50,515 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:06:50,515 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:06:50,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:06:50,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:06:50,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:06:50,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:06:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:06:50,517 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2018-09-26 08:06:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:50,518 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:06:50,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:06:50,518 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:06:50,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:06:50,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:06:50,717 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 898 [2018-09-26 08:06:52,023 WARN L178 SmtUtils]: Spent 1.30 s on a formula simplification that was a NOOP. DAG size: 898 [2018-09-26 08:06:52,032 INFO L422 ceAbstractionStarter]: At program point GateControllerErr0ASSERT_VIOLATIONASSERT(line 44) the Hoare annotation is: false [2018-09-26 08:06:52,032 INFO L426 ceAbstractionStarter]: For program point L34-2(lines 34 36) no Hoare annotation was computed. [2018-09-26 08:06:52,053 INFO L422 ceAbstractionStarter]: At program point L33-1(lines 33 42) the Hoare annotation is: (or (let ((.cse0 (+ GateController_gate 45))) (and (or GateController_alarm (<= (+ GateController_time 450) GateController_thousand)) (<= GateController_maxGatePosition .cse0) (<= .cse0 GateController_maxGatePosition))) (let ((.cse1 (+ GateController_gate 61))) (and (or GateController_alarm (<= (+ GateController_time 610) GateController_thousand)) (<= .cse1 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse1))) (let ((.cse2 (+ GateController_gate 66))) (and (<= .cse2 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 660) GateController_thousand)) (<= GateController_maxGatePosition .cse2))) (let ((.cse3 (+ GateController_gate 12))) (and (or GateController_alarm (<= (+ GateController_time 120) GateController_thousand)) (<= .cse3 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse3))) (let ((.cse4 (+ GateController_gate 39))) (and (or GateController_alarm (<= (+ GateController_time 390) GateController_thousand)) (<= .cse4 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse4))) (let ((.cse5 (+ GateController_gate 86))) (and (<= .cse5 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse5) (or GateController_alarm (<= (+ GateController_time 860) GateController_thousand)))) (let ((.cse6 (+ GateController_gate 95))) (and (<= GateController_maxGatePosition .cse6) (<= .cse6 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 950) GateController_thousand)))) (let ((.cse7 (+ GateController_gate 51))) (and (<= GateController_maxGatePosition .cse7) (or GateController_alarm (<= (+ GateController_time 510) GateController_thousand)) (<= .cse7 GateController_maxGatePosition))) (let ((.cse8 (+ GateController_gate 27))) (and (<= .cse8 GateController_maxGatePosition) (or (<= (+ GateController_time 270) GateController_thousand) GateController_alarm) (<= GateController_maxGatePosition .cse8))) (let ((.cse9 (+ GateController_gate 44))) (and (<= .cse9 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse9) (or GateController_alarm (<= (+ GateController_time 440) GateController_thousand)))) (let ((.cse10 (+ GateController_gate 58))) (and (<= GateController_maxGatePosition .cse10) (<= .cse10 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 580) GateController_thousand)))) (let ((.cse11 (+ GateController_gate 19))) (and (or (<= (+ GateController_time 190) GateController_thousand) GateController_alarm) (<= .cse11 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse11))) (and (<= GateController_maxGatePosition GateController_gate) (<= GateController_gate GateController_maxGatePosition)) (let ((.cse12 (+ GateController_gate 91))) (and (<= .cse12 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse12) (or GateController_alarm (<= (+ GateController_time 910) GateController_thousand)))) (let ((.cse13 (+ GateController_gate 67))) (and (or GateController_alarm (<= (+ GateController_time 670) GateController_thousand)) (<= GateController_maxGatePosition .cse13) (<= .cse13 GateController_maxGatePosition))) (let ((.cse14 (+ GateController_gate 1))) (and (<= .cse14 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 10) GateController_thousand)) (<= GateController_maxGatePosition .cse14))) (let ((.cse15 (+ GateController_gate 71))) (and (or GateController_alarm (<= (+ GateController_time 710) GateController_thousand)) (<= .cse15 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse15))) (let ((.cse16 (+ GateController_gate 20))) (and (<= GateController_maxGatePosition .cse16) (or GateController_alarm (<= (+ GateController_time 200) GateController_thousand)) (<= .cse16 GateController_maxGatePosition))) (let ((.cse17 (+ GateController_gate 2))) (and (or GateController_alarm (<= (+ GateController_time 20) GateController_thousand)) (<= GateController_maxGatePosition .cse17) (<= .cse17 GateController_maxGatePosition))) (let ((.cse18 (+ GateController_gate 57))) (and (<= GateController_maxGatePosition .cse18) (<= .cse18 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 570) GateController_thousand)))) (let ((.cse19 (+ GateController_gate 54))) (and (<= GateController_maxGatePosition .cse19) (or GateController_alarm (<= (+ GateController_time 540) GateController_thousand)) (<= .cse19 GateController_maxGatePosition))) (let ((.cse20 (+ GateController_gate 48))) (and (<= .cse20 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 480) GateController_thousand)) (<= GateController_maxGatePosition .cse20))) (let ((.cse21 (+ GateController_gate 25))) (and (or GateController_alarm (<= (+ GateController_time 250) GateController_thousand)) (<= GateController_maxGatePosition .cse21) (<= .cse21 GateController_maxGatePosition))) (let ((.cse22 (+ GateController_gate 90))) (and (or GateController_alarm (<= (+ GateController_time 900) GateController_thousand)) (<= GateController_maxGatePosition .cse22) (<= .cse22 GateController_maxGatePosition))) (let ((.cse23 (+ GateController_gate 5))) (and (<= GateController_maxGatePosition .cse23) (or GateController_alarm (<= (+ GateController_time 50) GateController_thousand)) (<= .cse23 GateController_maxGatePosition))) (let ((.cse24 (+ GateController_gate 49))) (and (<= .cse24 GateController_maxGatePosition) (or (<= (+ GateController_time 490) GateController_thousand) GateController_alarm) (<= GateController_maxGatePosition .cse24))) (let ((.cse25 (+ GateController_gate 68))) (and (<= GateController_maxGatePosition .cse25) (<= .cse25 GateController_maxGatePosition) (or (<= (+ GateController_time 680) GateController_thousand) GateController_alarm))) (let ((.cse26 (+ GateController_gate 35))) (and (<= GateController_maxGatePosition .cse26) (or (<= (+ GateController_time 350) GateController_thousand) GateController_alarm) (<= .cse26 GateController_maxGatePosition))) (let ((.cse27 (+ GateController_gate 60))) (and (<= GateController_maxGatePosition .cse27) (or GateController_alarm (<= (+ GateController_time 600) GateController_thousand)) (<= .cse27 GateController_maxGatePosition))) (let ((.cse28 (+ GateController_gate 42))) (and (or (<= (+ GateController_time 420) GateController_thousand) GateController_alarm) (<= .cse28 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse28))) (let ((.cse29 (+ GateController_gate 88))) (and (<= .cse29 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 880) GateController_thousand)) (<= GateController_maxGatePosition .cse29))) (let ((.cse30 (+ GateController_gate 63))) (and (or GateController_alarm (<= (+ GateController_time 630) GateController_thousand)) (<= GateController_maxGatePosition .cse30) (<= .cse30 GateController_maxGatePosition))) (let ((.cse31 (+ GateController_gate 7))) (and (<= .cse31 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse31) (or GateController_alarm (<= (+ GateController_time 70) GateController_thousand)))) (let ((.cse32 (+ GateController_gate 40))) (and (<= .cse32 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse32) (or GateController_alarm (<= (+ GateController_time 400) GateController_thousand)))) (let ((.cse33 (+ GateController_gate 79))) (and (or GateController_alarm (<= (+ GateController_time 790) GateController_thousand)) (<= .cse33 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse33))) (let ((.cse34 (+ GateController_gate 93))) (and (or GateController_alarm (<= (+ GateController_time 930) GateController_thousand)) (<= GateController_maxGatePosition .cse34) (<= .cse34 GateController_maxGatePosition))) (let ((.cse35 (+ GateController_gate 89))) (and (<= .cse35 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse35) (or GateController_alarm (<= (+ GateController_time 890) GateController_thousand)))) (let ((.cse36 (+ GateController_gate 65))) (and (or GateController_alarm (<= (+ GateController_time 650) GateController_thousand)) (<= .cse36 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse36))) (let ((.cse37 (+ GateController_gate 87))) (and (<= .cse37 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 870) GateController_thousand)) (<= GateController_maxGatePosition .cse37))) (let ((.cse38 (+ GateController_gate 38))) (and (<= .cse38 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 380) GateController_thousand)) (<= GateController_maxGatePosition .cse38))) (let ((.cse39 (+ GateController_gate 4))) (and (or (<= (+ GateController_time 40) GateController_thousand) GateController_alarm) (<= GateController_maxGatePosition .cse39) (<= .cse39 GateController_maxGatePosition))) (let ((.cse40 (+ GateController_gate 36))) (and (<= GateController_maxGatePosition .cse40) (<= .cse40 GateController_maxGatePosition) (or (<= (+ GateController_time 360) GateController_thousand) GateController_alarm))) (let ((.cse41 (+ GateController_gate 64))) (and (<= GateController_maxGatePosition .cse41) (or GateController_alarm (<= (+ GateController_time 640) GateController_thousand)) (<= .cse41 GateController_maxGatePosition))) (let ((.cse42 (+ GateController_gate 56))) (and (or (<= (+ GateController_time 560) GateController_thousand) GateController_alarm) (<= GateController_maxGatePosition .cse42) (<= .cse42 GateController_maxGatePosition))) (let ((.cse43 (+ GateController_gate 8))) (and (<= .cse43 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 80) GateController_thousand)) (<= GateController_maxGatePosition .cse43))) (let ((.cse44 (+ GateController_gate 9))) (and (<= .cse44 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse44) (or GateController_alarm (<= (+ GateController_time 90) GateController_thousand)))) (let ((.cse45 (+ GateController_gate 15))) (and (<= GateController_maxGatePosition .cse45) (<= .cse45 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 150) GateController_thousand)))) (let ((.cse46 (+ GateController_gate 85))) (and (or GateController_alarm (<= (+ GateController_time 850) GateController_thousand)) (<= GateController_maxGatePosition .cse46) (<= .cse46 GateController_maxGatePosition))) (let ((.cse47 (+ GateController_gate 77))) (and (<= .cse47 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 770) GateController_thousand)) (<= GateController_maxGatePosition .cse47))) (let ((.cse48 (+ GateController_gate 53))) (and (<= .cse48 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 530) GateController_thousand)) (<= GateController_maxGatePosition .cse48))) (let ((.cse49 (+ GateController_gate 43))) (and (or GateController_alarm (<= (+ GateController_time 430) GateController_thousand)) (<= .cse49 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse49))) (let ((.cse50 (+ GateController_gate 11))) (and (<= GateController_maxGatePosition .cse50) (or GateController_alarm (<= (+ GateController_time 110) GateController_thousand)) (<= .cse50 GateController_maxGatePosition))) (let ((.cse51 (+ GateController_gate 47))) (and (<= .cse51 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 470) GateController_thousand)) (<= GateController_maxGatePosition .cse51))) (let ((.cse52 (+ GateController_gate 96))) (and (<= GateController_maxGatePosition .cse52) (<= .cse52 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 960) GateController_thousand)))) (let ((.cse53 (+ GateController_gate 17))) (and (or GateController_alarm (<= (+ GateController_time 170) GateController_thousand)) (<= GateController_maxGatePosition .cse53) (<= .cse53 GateController_maxGatePosition))) (let ((.cse54 (+ GateController_gate 76))) (and (<= GateController_maxGatePosition .cse54) (<= .cse54 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 760) GateController_thousand)))) (let ((.cse55 (+ GateController_gate 70))) (and (<= GateController_maxGatePosition .cse55) (<= .cse55 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 700) GateController_thousand)))) (let ((.cse56 (+ GateController_gate 26))) (and (<= .cse56 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 260) GateController_thousand)) (<= GateController_maxGatePosition .cse56))) (let ((.cse57 (+ GateController_gate 23))) (and (or GateController_alarm (<= (+ GateController_time 230) GateController_thousand)) (<= .cse57 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse57))) (let ((.cse58 (+ GateController_gate 32))) (and (<= GateController_maxGatePosition .cse58) (or GateController_alarm (<= (+ GateController_time 320) GateController_thousand)) (<= .cse58 GateController_maxGatePosition))) (let ((.cse59 (+ GateController_gate 22))) (and (<= GateController_maxGatePosition .cse59) (or GateController_alarm (<= (+ GateController_time 220) GateController_thousand)) (<= .cse59 GateController_maxGatePosition))) (let ((.cse60 (+ GateController_gate 73))) (and (or GateController_alarm (<= (+ GateController_time 730) GateController_thousand)) (<= GateController_maxGatePosition .cse60) (<= .cse60 GateController_maxGatePosition))) (let ((.cse61 (+ GateController_gate 14))) (and (<= .cse61 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse61) (or (<= (+ GateController_time 140) GateController_thousand) GateController_alarm))) (let ((.cse62 (+ GateController_gate 16))) (and (or GateController_alarm (<= (+ GateController_time 160) GateController_thousand)) (<= GateController_maxGatePosition .cse62) (<= .cse62 GateController_maxGatePosition))) (let ((.cse63 (+ GateController_gate 33))) (and (or (<= (+ GateController_time 330) GateController_thousand) GateController_alarm) (<= .cse63 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse63))) (let ((.cse64 (+ GateController_gate 18))) (and (<= GateController_maxGatePosition .cse64) (or GateController_alarm (<= (+ GateController_time 180) GateController_thousand)) (<= .cse64 GateController_maxGatePosition))) (let ((.cse65 (+ GateController_gate 13))) (and (<= GateController_maxGatePosition .cse65) (<= .cse65 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 130) GateController_thousand)))) (let ((.cse66 (+ GateController_gate 62))) (and (<= GateController_maxGatePosition .cse66) (or GateController_alarm (<= (+ GateController_time 620) GateController_thousand)) (<= .cse66 GateController_maxGatePosition))) (let ((.cse67 (+ GateController_gate 72))) (and (<= GateController_maxGatePosition .cse67) (<= .cse67 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 720) GateController_thousand)))) (let ((.cse68 (+ GateController_gate 24))) (and (<= .cse68 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse68) (or GateController_alarm (<= (+ GateController_time 240) GateController_thousand)))) (let ((.cse69 (+ GateController_gate 52))) (and (or GateController_alarm (<= (+ GateController_time 520) GateController_thousand)) (<= GateController_maxGatePosition .cse69) (<= .cse69 GateController_maxGatePosition))) (let ((.cse70 (+ GateController_gate 94))) (and (or GateController_alarm (<= (+ GateController_time 940) GateController_thousand)) (<= .cse70 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse70))) (let ((.cse71 (+ GateController_gate 83))) (and (or GateController_alarm (<= (+ GateController_time 830) GateController_thousand)) (<= .cse71 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse71))) (let ((.cse72 (+ GateController_gate 82))) (and (<= GateController_maxGatePosition .cse72) (or GateController_alarm (<= (+ GateController_time 820) GateController_thousand)) (<= .cse72 GateController_maxGatePosition))) (let ((.cse73 (+ GateController_gate 98))) (and (<= .cse73 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse73) (or GateController_alarm (<= (+ GateController_time 980) GateController_thousand)))) (let ((.cse74 (+ GateController_gate 37))) (and (<= .cse74 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse74) (or GateController_alarm (<= (+ GateController_time 370) GateController_thousand)))) (let ((.cse75 (+ GateController_gate 50))) (and (<= .cse75 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse75) (or (<= (+ GateController_time 500) GateController_thousand) GateController_alarm))) (let ((.cse76 (+ GateController_gate 41))) (and (<= .cse76 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse76) (or GateController_alarm (<= (+ GateController_time 410) GateController_thousand)))) (let ((.cse77 (+ GateController_gate 81))) (and (<= .cse77 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse77) (or GateController_alarm (<= (+ GateController_time 810) GateController_thousand)))) (let ((.cse78 (+ GateController_gate 75))) (and (or GateController_alarm (<= (+ GateController_time 750) GateController_thousand)) (<= GateController_maxGatePosition .cse78) (<= .cse78 GateController_maxGatePosition))) (let ((.cse79 (+ GateController_gate 29))) (and (<= .cse79 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 290) GateController_thousand)) (<= GateController_maxGatePosition .cse79))) (let ((.cse80 (+ GateController_gate 46))) (and (<= GateController_maxGatePosition .cse80) (or GateController_alarm (<= (+ GateController_time 460) GateController_thousand)) (<= .cse80 GateController_maxGatePosition))) (let ((.cse81 (+ GateController_gate 34))) (and (<= .cse81 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 340) GateController_thousand)) (<= GateController_maxGatePosition .cse81))) (let ((.cse82 (+ GateController_gate 69))) (and (<= .cse82 GateController_maxGatePosition) (or (<= (+ GateController_time 690) GateController_thousand) GateController_alarm) (<= GateController_maxGatePosition .cse82))) (let ((.cse83 (+ GateController_gate 84))) (and (<= .cse83 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse83) (or GateController_alarm (<= (+ GateController_time 840) GateController_thousand)))) (let ((.cse84 (+ GateController_gate 80))) (and (<= GateController_maxGatePosition .cse84) (or GateController_alarm (<= (+ GateController_time 800) GateController_thousand)) (<= .cse84 GateController_maxGatePosition))) (let ((.cse85 (+ GateController_gate 92))) (and (<= .cse85 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse85) (or GateController_alarm (<= (+ GateController_time 920) GateController_thousand)))) (let ((.cse86 (+ GateController_gate 10))) (and (or GateController_alarm (<= (+ GateController_time 100) GateController_thousand)) (<= GateController_maxGatePosition .cse86) (<= .cse86 GateController_maxGatePosition))) (let ((.cse87 (+ GateController_gate 28))) (and (or GateController_alarm (<= (+ GateController_time 280) GateController_thousand)) (<= GateController_maxGatePosition .cse87) (<= .cse87 GateController_maxGatePosition))) (let ((.cse88 (+ GateController_gate 100))) (and (<= .cse88 GateController_maxGatePosition) (<= (+ GateController_time 1000) GateController_thousand) (<= GateController_maxGatePosition .cse88))) (let ((.cse89 (+ GateController_gate 30))) (and (<= .cse89 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse89) (or GateController_alarm (<= (+ GateController_time 300) GateController_thousand)))) (let ((.cse90 (+ GateController_gate 21))) (and (<= .cse90 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse90) (or GateController_alarm (<= (+ GateController_time 210) GateController_thousand)))) (let ((.cse91 (+ GateController_gate 55))) (and (<= GateController_maxGatePosition .cse91) (<= .cse91 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 550) GateController_thousand)))) (let ((.cse92 (+ GateController_gate 74))) (and (<= GateController_maxGatePosition .cse92) (or GateController_alarm (<= (+ GateController_time 740) GateController_thousand)) (<= .cse92 GateController_maxGatePosition))) (let ((.cse93 (+ GateController_gate 99))) (and (or GateController_alarm (<= (+ GateController_time 990) GateController_thousand)) (<= GateController_maxGatePosition .cse93) (<= .cse93 GateController_maxGatePosition))) (let ((.cse94 (+ GateController_gate 6))) (and (<= .cse94 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse94) (or GateController_alarm (<= (+ GateController_time 60) GateController_thousand)))) (let ((.cse95 (+ GateController_gate 78))) (and (<= .cse95 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 780) GateController_thousand)) (<= GateController_maxGatePosition .cse95))) (let ((.cse96 (+ GateController_gate 97))) (and (or GateController_alarm (<= (+ GateController_time 970) GateController_thousand)) (<= .cse96 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse96))) (let ((.cse97 (+ GateController_gate 3))) (and (<= .cse97 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse97) (or GateController_alarm (<= (+ GateController_time 30) GateController_thousand)))) (let ((.cse98 (+ GateController_gate 59))) (and (<= .cse98 GateController_maxGatePosition) (or GateController_alarm (<= (+ GateController_time 590) GateController_thousand)) (<= GateController_maxGatePosition .cse98))) (let ((.cse99 (+ GateController_gate 31))) (and (or GateController_alarm (<= (+ GateController_time 310) GateController_thousand)) (<= .cse99 GateController_maxGatePosition) (<= GateController_maxGatePosition .cse99)))) [2018-09-26 08:06:52,054 INFO L429 ceAbstractionStarter]: At program point GateControllerEXIT(lines 18 45) the Hoare annotation is: true [2018-09-26 08:06:52,054 INFO L429 ceAbstractionStarter]: At program point GateControllerENTRY(lines 18 45) the Hoare annotation is: true [2018-09-26 08:06:52,054 INFO L422 ceAbstractionStarter]: At program point L44(line 44) the Hoare annotation is: (or GateController_alarm (and (<= GateController_maxGatePosition GateController_gate) (<= GateController_gate GateController_maxGatePosition))) [2018-09-26 08:06:52,054 INFO L426 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-09-26 08:06:52,054 INFO L426 ceAbstractionStarter]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2018-09-26 08:06:52,054 INFO L426 ceAbstractionStarter]: For program point GateControllerFINAL(lines 18 45) no Hoare annotation was computed. [2018-09-26 08:06:52,055 INFO L426 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2018-09-26 08:06:52,096 INFO L202 PluginConnector]: Adding new model GateController.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:06:52 BoogieIcfgContainer [2018-09-26 08:06:52,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:06:52,097 INFO L168 Benchmark]: Toolchain (without parser) took 47798.97 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 370.3 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-09-26 08:06:52,098 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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:52,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.24 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:52,099 INFO L168 Benchmark]: Boogie Preprocessor took 22.56 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:52,099 INFO L168 Benchmark]: RCFGBuilder took 266.57 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:52,100 INFO L168 Benchmark]: TraceAbstraction took 47461.81 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 359.7 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-09-26 08:06:52,103 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.21 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.24 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.56 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 266.57 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 47461.81 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 359.7 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: 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: 33]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((alarm || time + 450 <= thousand) && maxGatePosition <= gate + 45) && gate + 45 <= maxGatePosition) || (((alarm || time + 610 <= thousand) && gate + 61 <= maxGatePosition) && maxGatePosition <= gate + 61)) || ((gate + 66 <= maxGatePosition && (alarm || time + 660 <= thousand)) && maxGatePosition <= gate + 66)) || (((alarm || time + 120 <= thousand) && gate + 12 <= maxGatePosition) && maxGatePosition <= gate + 12)) || (((alarm || time + 390 <= thousand) && gate + 39 <= maxGatePosition) && maxGatePosition <= gate + 39)) || ((gate + 86 <= maxGatePosition && maxGatePosition <= gate + 86) && (alarm || time + 860 <= thousand))) || ((maxGatePosition <= gate + 95 && gate + 95 <= maxGatePosition) && (alarm || time + 950 <= thousand))) || ((maxGatePosition <= gate + 51 && (alarm || time + 510 <= thousand)) && gate + 51 <= maxGatePosition)) || ((gate + 27 <= maxGatePosition && (time + 270 <= thousand || alarm)) && maxGatePosition <= gate + 27)) || ((gate + 44 <= maxGatePosition && maxGatePosition <= gate + 44) && (alarm || time + 440 <= thousand))) || ((maxGatePosition <= gate + 58 && gate + 58 <= maxGatePosition) && (alarm || time + 580 <= thousand))) || (((time + 190 <= thousand || alarm) && gate + 19 <= maxGatePosition) && maxGatePosition <= gate + 19)) || (maxGatePosition <= gate && gate <= maxGatePosition)) || ((gate + 91 <= maxGatePosition && maxGatePosition <= gate + 91) && (alarm || time + 910 <= thousand))) || (((alarm || time + 670 <= thousand) && maxGatePosition <= gate + 67) && gate + 67 <= maxGatePosition)) || ((gate + 1 <= maxGatePosition && (alarm || time + 10 <= thousand)) && maxGatePosition <= gate + 1)) || (((alarm || time + 710 <= thousand) && gate + 71 <= maxGatePosition) && maxGatePosition <= gate + 71)) || ((maxGatePosition <= gate + 20 && (alarm || time + 200 <= thousand)) && gate + 20 <= maxGatePosition)) || (((alarm || time + 20 <= thousand) && maxGatePosition <= gate + 2) && gate + 2 <= maxGatePosition)) || ((maxGatePosition <= gate + 57 && gate + 57 <= maxGatePosition) && (alarm || time + 570 <= thousand))) || ((maxGatePosition <= gate + 54 && (alarm || time + 540 <= thousand)) && gate + 54 <= maxGatePosition)) || ((gate + 48 <= maxGatePosition && (alarm || time + 480 <= thousand)) && maxGatePosition <= gate + 48)) || (((alarm || time + 250 <= thousand) && maxGatePosition <= gate + 25) && gate + 25 <= maxGatePosition)) || (((alarm || time + 900 <= thousand) && maxGatePosition <= gate + 90) && gate + 90 <= maxGatePosition)) || ((maxGatePosition <= gate + 5 && (alarm || time + 50 <= thousand)) && gate + 5 <= maxGatePosition)) || ((gate + 49 <= maxGatePosition && (time + 490 <= thousand || alarm)) && maxGatePosition <= gate + 49)) || ((maxGatePosition <= gate + 68 && gate + 68 <= maxGatePosition) && (time + 680 <= thousand || alarm))) || ((maxGatePosition <= gate + 35 && (time + 350 <= thousand || alarm)) && gate + 35 <= maxGatePosition)) || ((maxGatePosition <= gate + 60 && (alarm || time + 600 <= thousand)) && gate + 60 <= maxGatePosition)) || (((time + 420 <= thousand || alarm) && gate + 42 <= maxGatePosition) && maxGatePosition <= gate + 42)) || ((gate + 88 <= maxGatePosition && (alarm || time + 880 <= thousand)) && maxGatePosition <= gate + 88)) || (((alarm || time + 630 <= thousand) && maxGatePosition <= gate + 63) && gate + 63 <= maxGatePosition)) || ((gate + 7 <= maxGatePosition && maxGatePosition <= gate + 7) && (alarm || time + 70 <= thousand))) || ((gate + 40 <= maxGatePosition && maxGatePosition <= gate + 40) && (alarm || time + 400 <= thousand))) || (((alarm || time + 790 <= thousand) && gate + 79 <= maxGatePosition) && maxGatePosition <= gate + 79)) || (((alarm || time + 930 <= thousand) && maxGatePosition <= gate + 93) && gate + 93 <= maxGatePosition)) || ((gate + 89 <= maxGatePosition && maxGatePosition <= gate + 89) && (alarm || time + 890 <= thousand))) || (((alarm || time + 650 <= thousand) && gate + 65 <= maxGatePosition) && maxGatePosition <= gate + 65)) || ((gate + 87 <= maxGatePosition && (alarm || time + 870 <= thousand)) && maxGatePosition <= gate + 87)) || ((gate + 38 <= maxGatePosition && (alarm || time + 380 <= thousand)) && maxGatePosition <= gate + 38)) || (((time + 40 <= thousand || alarm) && maxGatePosition <= gate + 4) && gate + 4 <= maxGatePosition)) || ((maxGatePosition <= gate + 36 && gate + 36 <= maxGatePosition) && (time + 360 <= thousand || alarm))) || ((maxGatePosition <= gate + 64 && (alarm || time + 640 <= thousand)) && gate + 64 <= maxGatePosition)) || (((time + 560 <= thousand || alarm) && maxGatePosition <= gate + 56) && gate + 56 <= maxGatePosition)) || ((gate + 8 <= maxGatePosition && (alarm || time + 80 <= thousand)) && maxGatePosition <= gate + 8)) || ((gate + 9 <= maxGatePosition && maxGatePosition <= gate + 9) && (alarm || time + 90 <= thousand))) || ((maxGatePosition <= gate + 15 && gate + 15 <= maxGatePosition) && (alarm || time + 150 <= thousand))) || (((alarm || time + 850 <= thousand) && maxGatePosition <= gate + 85) && gate + 85 <= maxGatePosition)) || ((gate + 77 <= maxGatePosition && (alarm || time + 770 <= thousand)) && maxGatePosition <= gate + 77)) || ((gate + 53 <= maxGatePosition && (alarm || time + 530 <= thousand)) && maxGatePosition <= gate + 53)) || (((alarm || time + 430 <= thousand) && gate + 43 <= maxGatePosition) && maxGatePosition <= gate + 43)) || ((maxGatePosition <= gate + 11 && (alarm || time + 110 <= thousand)) && gate + 11 <= maxGatePosition)) || ((gate + 47 <= maxGatePosition && (alarm || time + 470 <= thousand)) && maxGatePosition <= gate + 47)) || ((maxGatePosition <= gate + 96 && gate + 96 <= maxGatePosition) && (alarm || time + 960 <= thousand))) || (((alarm || time + 170 <= thousand) && maxGatePosition <= gate + 17) && gate + 17 <= maxGatePosition)) || ((maxGatePosition <= gate + 76 && gate + 76 <= maxGatePosition) && (alarm || time + 760 <= thousand))) || ((maxGatePosition <= gate + 70 && gate + 70 <= maxGatePosition) && (alarm || time + 700 <= thousand))) || ((gate + 26 <= maxGatePosition && (alarm || time + 260 <= thousand)) && maxGatePosition <= gate + 26)) || (((alarm || time + 230 <= thousand) && gate + 23 <= maxGatePosition) && maxGatePosition <= gate + 23)) || ((maxGatePosition <= gate + 32 && (alarm || time + 320 <= thousand)) && gate + 32 <= maxGatePosition)) || ((maxGatePosition <= gate + 22 && (alarm || time + 220 <= thousand)) && gate + 22 <= maxGatePosition)) || (((alarm || time + 730 <= thousand) && maxGatePosition <= gate + 73) && gate + 73 <= maxGatePosition)) || ((gate + 14 <= maxGatePosition && maxGatePosition <= gate + 14) && (time + 140 <= thousand || alarm))) || (((alarm || time + 160 <= thousand) && maxGatePosition <= gate + 16) && gate + 16 <= maxGatePosition)) || (((time + 330 <= thousand || alarm) && gate + 33 <= maxGatePosition) && maxGatePosition <= gate + 33)) || ((maxGatePosition <= gate + 18 && (alarm || time + 180 <= thousand)) && gate + 18 <= maxGatePosition)) || ((maxGatePosition <= gate + 13 && gate + 13 <= maxGatePosition) && (alarm || time + 130 <= thousand))) || ((maxGatePosition <= gate + 62 && (alarm || time + 620 <= thousand)) && gate + 62 <= maxGatePosition)) || ((maxGatePosition <= gate + 72 && gate + 72 <= maxGatePosition) && (alarm || time + 720 <= thousand))) || ((gate + 24 <= maxGatePosition && maxGatePosition <= gate + 24) && (alarm || time + 240 <= thousand))) || (((alarm || time + 520 <= thousand) && maxGatePosition <= gate + 52) && gate + 52 <= maxGatePosition)) || (((alarm || time + 940 <= thousand) && gate + 94 <= maxGatePosition) && maxGatePosition <= gate + 94)) || (((alarm || time + 830 <= thousand) && gate + 83 <= maxGatePosition) && maxGatePosition <= gate + 83)) || ((maxGatePosition <= gate + 82 && (alarm || time + 820 <= thousand)) && gate + 82 <= maxGatePosition)) || ((gate + 98 <= maxGatePosition && maxGatePosition <= gate + 98) && (alarm || time + 980 <= thousand))) || ((gate + 37 <= maxGatePosition && maxGatePosition <= gate + 37) && (alarm || time + 370 <= thousand))) || ((gate + 50 <= maxGatePosition && maxGatePosition <= gate + 50) && (time + 500 <= thousand || alarm))) || ((gate + 41 <= maxGatePosition && maxGatePosition <= gate + 41) && (alarm || time + 410 <= thousand))) || ((gate + 81 <= maxGatePosition && maxGatePosition <= gate + 81) && (alarm || time + 810 <= thousand))) || (((alarm || time + 750 <= thousand) && maxGatePosition <= gate + 75) && gate + 75 <= maxGatePosition)) || ((gate + 29 <= maxGatePosition && (alarm || time + 290 <= thousand)) && maxGatePosition <= gate + 29)) || ((maxGatePosition <= gate + 46 && (alarm || time + 460 <= thousand)) && gate + 46 <= maxGatePosition)) || ((gate + 34 <= maxGatePosition && (alarm || time + 340 <= thousand)) && maxGatePosition <= gate + 34)) || ((gate + 69 <= maxGatePosition && (time + 690 <= thousand || alarm)) && maxGatePosition <= gate + 69)) || ((gate + 84 <= maxGatePosition && maxGatePosition <= gate + 84) && (alarm || time + 840 <= thousand))) || ((maxGatePosition <= gate + 80 && (alarm || time + 800 <= thousand)) && gate + 80 <= maxGatePosition)) || ((gate + 92 <= maxGatePosition && maxGatePosition <= gate + 92) && (alarm || time + 920 <= thousand))) || (((alarm || time + 100 <= thousand) && maxGatePosition <= gate + 10) && gate + 10 <= maxGatePosition)) || (((alarm || time + 280 <= thousand) && maxGatePosition <= gate + 28) && gate + 28 <= maxGatePosition)) || ((gate + 100 <= maxGatePosition && time + 1000 <= thousand) && maxGatePosition <= gate + 100)) || ((gate + 30 <= maxGatePosition && maxGatePosition <= gate + 30) && (alarm || time + 300 <= thousand))) || ((gate + 21 <= maxGatePosition && maxGatePosition <= gate + 21) && (alarm || time + 210 <= thousand))) || ((maxGatePosition <= gate + 55 && gate + 55 <= maxGatePosition) && (alarm || time + 550 <= thousand))) || ((maxGatePosition <= gate + 74 && (alarm || time + 740 <= thousand)) && gate + 74 <= maxGatePosition)) || (((alarm || time + 990 <= thousand) && maxGatePosition <= gate + 99) && gate + 99 <= maxGatePosition)) || ((gate + 6 <= maxGatePosition && maxGatePosition <= gate + 6) && (alarm || time + 60 <= thousand))) || ((gate + 78 <= maxGatePosition && (alarm || time + 780 <= thousand)) && maxGatePosition <= gate + 78)) || (((alarm || time + 970 <= thousand) && gate + 97 <= maxGatePosition) && maxGatePosition <= gate + 97)) || ((gate + 3 <= maxGatePosition && maxGatePosition <= gate + 3) && (alarm || time + 30 <= thousand))) || ((gate + 59 <= maxGatePosition && (alarm || time + 590 <= thousand)) && maxGatePosition <= gate + 59)) || (((alarm || time + 310 <= thousand) && gate + 31 <= maxGatePosition) && maxGatePosition <= gate + 31) - ProcedureContractResult [Line: 18]: 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.3s OverallTime, 101 OverallIterations, 100 TraceHistogramMax, 7.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 204 SDtfs, 4 SDslu, 146 SDs, 0 SdLazy, 22836 SolverSat, 305 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5251 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9801 ImplicationChecksByTransitivity, 27.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=100, 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.6s AutomataMinimizationTime, 101 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 108 NumberOfFragments, 1818 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 34.0s InterpolantComputationTime, 5353 NumberOfCodeBlocks, 5353 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 5252 ConstructedInterpolants, 0 QuantifiedInterpolants, 2512278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 101 InterpolantComputations, 1 PerfectInterpolantSequences, 0/171700 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/GateController.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-06-52-118.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GateController.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-06-52-118.csv Received shutdown request...