java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-56c9370 [2018-07-23 15:14:52,652 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 15:14:52,654 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 15:14:52,666 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 15:14:52,666 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 15:14:52,667 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 15:14:52,669 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 15:14:52,671 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 15:14:52,672 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 15:14:52,673 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 15:14:52,674 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 15:14:52,675 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 15:14:52,676 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 15:14:52,677 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 15:14:52,678 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 15:14:52,679 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 15:14:52,680 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 15:14:52,682 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 15:14:52,684 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 15:14:52,686 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 15:14:52,687 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 15:14:52,688 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 15:14:52,691 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 15:14:52,691 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 15:14:52,692 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 15:14:52,693 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 15:14:52,694 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 15:14:52,695 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 15:14:52,696 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 15:14:52,697 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 15:14:52,697 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 15:14:52,698 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 15:14:52,698 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 15:14:52,699 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 15:14:52,700 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 15:14:52,700 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 15:14:52,701 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 15:14:52,714 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 15:14:52,715 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 15:14:52,716 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 15:14:52,716 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 15:14:52,717 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 15:14:52,717 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 15:14:52,717 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 15:14:52,717 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 15:14:52,766 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 15:14:52,789 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 15:14:52,795 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 15:14:52,797 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 15:14:52,797 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 15:14:52,798 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl [2018-07-23 15:14:52,799 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl' [2018-07-23 15:14:52,857 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 15:14:52,859 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 15:14:52,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 15:14:52,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 15:14:52,861 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 15:14:52,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:14:52" (1/1) ... [2018-07-23 15:14:52,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:14:52" (1/1) ... [2018-07-23 15:14:52,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:14:52" (1/1) ... [2018-07-23 15:14:52,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:14:52" (1/1) ... [2018-07-23 15:14:52,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:14:52" (1/1) ... [2018-07-23 15:14:52,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:14:52" (1/1) ... [2018-07-23 15:14:52,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:14:52" (1/1) ... [2018-07-23 15:14:52,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 15:14:52,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 15:14:52,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 15:14:52,919 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 15:14:52,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:14:52" (1/1) ... [2018-07-23 15:14:53,009 INFO L124 BoogieDeclarations]: Specification and implementation of procedure GateController given in one single declaration [2018-07-23 15:14:53,010 INFO L130 BoogieDeclarations]: Found specification of procedure GateController [2018-07-23 15:14:53,010 INFO L138 BoogieDeclarations]: Found implementation of procedure GateController [2018-07-23 15:14:53,205 INFO L258 CfgBuilder]: Using library mode [2018-07-23 15:14:53,206 INFO L202 PluginConnector]: Adding new model GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:14:53 BoogieIcfgContainer [2018-07-23 15:14:53,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 15:14:53,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 15:14:53,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 15:14:53,216 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 15:14:53,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:14:52" (1/2) ... [2018-07-23 15:14:53,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61809b06 and model type GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 03:14:53, skipping insertion in model container [2018-07-23 15:14:53,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:14:53" (2/2) ... [2018-07-23 15:14:53,222 INFO L112 eAbstractionObserver]: Analyzing ICFG GateControllerIncorrect1.bpl [2018-07-23 15:14:53,232 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 15:14:53,242 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 15:14:53,298 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 15:14:53,299 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 15:14:53,299 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 15:14:53,300 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 15:14:53,300 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-23 15:14:53,300 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 15:14:53,300 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 15:14:53,301 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 15:14:53,301 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 15:14:53,318 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-07-23 15:14:53,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-23 15:14:53,331 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:14:53,332 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-23 15:14:53,333 INFO L414 AbstractCegarLoop]: === Iteration 1 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 15:14:53,339 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2018-07-23 15:14:53,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:14:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:14:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:14:53,430 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:14:53,430 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 15:14:53,434 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:14:53,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:14:53,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:14:53,454 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-07-23 15:14:53,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:14:53,480 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-23 15:14:53,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:14:53,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-23 15:14:53,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:14:53,495 INFO L225 Difference]: With dead ends: 9 [2018-07-23 15:14:53,495 INFO L226 Difference]: Without dead ends: 5 [2018-07-23 15:14:53,499 INFO L573 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-07-23 15:14:53,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-23 15:14:53,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-23 15:14:53,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-23 15:14:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-23 15:14:53,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-23 15:14:53,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:14:53,549 INFO L471 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-23 15:14:53,549 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:14:53,549 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-23 15:14:53,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 15:14:53,550 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:14:53,550 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 15:14:53,551 INFO L414 AbstractCegarLoop]: === Iteration 2 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 15:14:53,551 INFO L82 PathProgramCache]: Analyzing trace with hash 952992, now seen corresponding path program 1 times [2018-07-23 15:14:53,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:14:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:14:53,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:14:53,594 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:14:53,596 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 15:14:53,599 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 15:14:53,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 15:14:53,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:14:53,602 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-07-23 15:14:53,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:14:53,633 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-23 15:14:53,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 15:14:53,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-23 15:14:53,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:14:53,635 INFO L225 Difference]: With dead ends: 8 [2018-07-23 15:14:53,635 INFO L226 Difference]: Without dead ends: 6 [2018-07-23 15:14:53,636 INFO L573 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-07-23 15:14:53,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-23 15:14:53,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-23 15:14:53,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-23 15:14:53,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-23 15:14:53,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-23 15:14:53,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:14:53,641 INFO L471 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-23 15:14:53,641 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 15:14:53,642 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-23 15:14:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-23 15:14:53,642 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:14:53,642 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-23 15:14:53,643 INFO L414 AbstractCegarLoop]: === Iteration 3 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 15:14:53,643 INFO L82 PathProgramCache]: Analyzing trace with hash 29552352, now seen corresponding path program 2 times [2018-07-23 15:14:53,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:14:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:14:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:14:53,689 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:14:53,689 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 15:14:53,689 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 15:14:53,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 15:14:53,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:14:53,690 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-07-23 15:14:53,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:14:53,714 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-23 15:14:53,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 15:14:53,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-07-23 15:14:53,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:14:53,716 INFO L225 Difference]: With dead ends: 9 [2018-07-23 15:14:53,716 INFO L226 Difference]: Without dead ends: 7 [2018-07-23 15:14:53,716 INFO L573 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-07-23 15:14:53,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-23 15:14:53,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-23 15:14:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 15:14:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 15:14:53,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-23 15:14:53,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:14:53,720 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 15:14:53,720 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 15:14:53,721 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 15:14:53,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 15:14:53,721 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:14:53,721 INFO L353 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-23 15:14:53,721 INFO L414 AbstractCegarLoop]: === Iteration 4 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 15:14:53,722 INFO L82 PathProgramCache]: Analyzing trace with hash 916132512, now seen corresponding path program 3 times [2018-07-23 15:14:53,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:14:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:14:53,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:14:53,827 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:14:53,827 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 15:14:53,827 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:14:53,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:14:53,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:14:53,830 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-07-23 15:14:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:14:53,878 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-23 15:14:53,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 15:14:53,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 15:14:53,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:14:53,880 INFO L225 Difference]: With dead ends: 10 [2018-07-23 15:14:53,880 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 15:14:53,880 INFO L573 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-07-23 15:14:53,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 15:14:53,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-23 15:14:53,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-23 15:14:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-23 15:14:53,884 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-23 15:14:53,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:14:53,885 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-23 15:14:53,885 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:14:53,885 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-23 15:14:53,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 15:14:53,885 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:14:53,886 INFO L353 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-23 15:14:53,886 INFO L414 AbstractCegarLoop]: === Iteration 5 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 15:14:53,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1664653600, now seen corresponding path program 4 times [2018-07-23 15:14:53,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:14:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:14:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:14:53,939 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:14:53,940 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:14:53,940 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:14:53,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:14:53,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:14:53,941 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-07-23 15:14:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:14:53,995 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-23 15:14:53,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 15:14:53,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 15:14:53,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:14:53,996 INFO L225 Difference]: With dead ends: 11 [2018-07-23 15:14:53,996 INFO L226 Difference]: Without dead ends: 9 [2018-07-23 15:14:53,997 INFO L573 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-07-23 15:14:53,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-23 15:14:54,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-23 15:14:54,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 15:14:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 15:14:54,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-23 15:14:54,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:14:54,001 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 15:14:54,001 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:14:54,002 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 15:14:54,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:14:54,002 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:14:54,002 INFO L353 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-23 15:14:54,003 INFO L414 AbstractCegarLoop]: === Iteration 6 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 15:14:54,003 INFO L82 PathProgramCache]: Analyzing trace with hash -64644448, now seen corresponding path program 5 times [2018-07-23 15:14:54,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:14:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:14:54,087 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:14:54,087 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:14:54,089 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:14:54,090 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:14:54,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:14:54,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:14:54,094 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-07-23 15:14:54,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:14:54,121 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-23 15:14:54,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 15:14:54,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-07-23 15:14:54,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:14:54,123 INFO L225 Difference]: With dead ends: 12 [2018-07-23 15:14:54,123 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 15:14:54,124 INFO L573 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-07-23 15:14:54,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 15:14:54,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-23 15:14:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-23 15:14:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-23 15:14:54,128 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-23 15:14:54,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:14:54,129 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-23 15:14:54,129 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:14:54,129 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-23 15:14:54,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 15:14:54,130 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:14:54,130 INFO L353 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-23 15:14:54,130 INFO L414 AbstractCegarLoop]: === Iteration 7 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 15:14:54,130 INFO L82 PathProgramCache]: Analyzing trace with hash -2003968288, now seen corresponding path program 6 times [2018-07-23 15:14:54,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:14:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:14:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:14:54,207 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:14:54,208 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:14:54,208 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:14:54,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:14:54,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:14:54,212 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-07-23 15:14:54,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:14:54,256 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 15:14:54,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:14:54,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-07-23 15:14:54,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:14:54,258 INFO L225 Difference]: With dead ends: 13 [2018-07-23 15:14:54,258 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 15:14:54,259 INFO L573 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-07-23 15:14:54,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 15:14:54,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 15:14:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 15:14:54,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 15:14:54,268 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-23 15:14:54,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:14:54,268 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 15:14:54,268 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:14:54,272 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 15:14:54,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:14:54,272 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:14:54,272 INFO L353 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-23 15:14:54,273 INFO L414 AbstractCegarLoop]: === Iteration 8 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 15:14:54,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1993465184, now seen corresponding path program 7 times [2018-07-23 15:14:54,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:14:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:14:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:14:54,373 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:14:54,373 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:14:54,374 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:14:54,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:14:54,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:14:54,378 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-07-23 15:14:54,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:14:54,429 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-23 15:14:54,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 15:14:54,430 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-07-23 15:14:54,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:14:54,431 INFO L225 Difference]: With dead ends: 14 [2018-07-23 15:14:54,431 INFO L226 Difference]: Without dead ends: 12 [2018-07-23 15:14:54,432 INFO L573 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-07-23 15:14:54,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-23 15:14:54,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-23 15:14:54,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-23 15:14:54,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-23 15:14:54,436 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-23 15:14:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:14:54,437 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-23 15:14:54,437 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:14:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-23 15:14:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 15:14:54,438 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:14:54,438 INFO L353 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-23 15:14:54,438 INFO L414 AbstractCegarLoop]: === Iteration 9 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 15:14:54,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1667868960, now seen corresponding path program 8 times [2018-07-23 15:14:54,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:14:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:14:54,539 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:14:54,540 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:14:54,540 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:14:54,544 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:14:54,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:14:54,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=67, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:14:54,551 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-07-23 15:14:54,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:14:54,585 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 15:14:54,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:14:54,586 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-07-23 15:14:54,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:14:54,588 INFO L225 Difference]: With dead ends: 15 [2018-07-23 15:14:54,588 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 15:14:54,589 INFO L573 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-07-23 15:14:54,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 15:14:54,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 15:14:54,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 15:14:54,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 15:14:54,597 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-23 15:14:54,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:14:54,598 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 15:14:54,598 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:14:54,600 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 15:14:54,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 15:14:54,600 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:14:54,601 INFO L353 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-23 15:14:54,601 INFO L414 AbstractCegarLoop]: === Iteration 10 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 15:14:54,602 INFO L82 PathProgramCache]: Analyzing trace with hash -164320608, now seen corresponding path program 9 times [2018-07-23 15:14:54,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:14:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:14:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:14:54,705 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:14:54,706 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:14:54,706 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:14:54,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:14:54,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:14:54,717 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-07-23 15:14:54,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:14:54,752 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-23 15:14:54,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 15:14:54,755 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-07-23 15:14:54,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:14:54,756 INFO L225 Difference]: With dead ends: 16 [2018-07-23 15:14:54,756 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 15:14:54,757 INFO L573 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-07-23 15:14:54,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 15:14:54,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-23 15:14:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-23 15:14:54,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-23 15:14:54,767 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-23 15:14:54,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:14:54,768 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-23 15:14:54,768 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:14:54,768 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-23 15:14:54,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:14:54,769 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:14:54,769 INFO L353 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-23 15:14:54,769 INFO L414 AbstractCegarLoop]: === Iteration 11 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 15:14:54,770 INFO L82 PathProgramCache]: Analyzing trace with hash -798961952, now seen corresponding path program 10 times [2018-07-23 15:14:54,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:14:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:14:54,870 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:14:54,873 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:14:54,876 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:14:54,877 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:14:54,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:14:54,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:14:54,878 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-07-23 15:14:54,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:14:54,914 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-23 15:14:54,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 15:14:54,915 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-07-23 15:14:54,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:14:54,916 INFO L225 Difference]: With dead ends: 17 [2018-07-23 15:14:54,916 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 15:14:54,917 INFO L573 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-07-23 15:14:54,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 15:14:54,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-23 15:14:54,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 15:14:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 15:14:54,924 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-23 15:14:54,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:14:54,924 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 15:14:54,925 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:14:54,925 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 15:14:54,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 15:14:54,925 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:14:54,926 INFO L353 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-23 15:14:54,926 INFO L414 AbstractCegarLoop]: === Iteration 12 === [GateControllerErr0AssertViolationASSERT]=== [2018-07-23 15:14:54,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1001992864, now seen corresponding path program 11 times [2018-07-23 15:14:54,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:14:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-23 15:14:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-23 15:14:54,996 INFO L419 BasicCegarLoop]: Counterexample might be feasible [2018-07-23 15:14:55,036 INFO L202 PluginConnector]: Adding new model GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 03:14:55 BoogieIcfgContainer [2018-07-23 15:14:55,039 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 15:14:55,040 INFO L168 Benchmark]: Toolchain (without parser) took 2181.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 116.3 MB). Peak memory consumption was 116.3 MB. Max. memory is 7.1 GB. [2018-07-23 15:14:55,042 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-07-23 15:14:55,043 INFO L168 Benchmark]: Boogie Preprocessor took 57.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 15:14:55,044 INFO L168 Benchmark]: RCFGBuilder took 291.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 15:14:55,047 INFO L168 Benchmark]: TraceAbstraction took 1828.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-07-23 15:14:55,054 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 Preprocessor took 57.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 291.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1828.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 35]: assertion can be violated assertion can be violated We found a FailurePath: [L15] one := 1; [L16] maxGatePosition := 100 * one; [L17] thousand := 1000 * one; [L20] gate := 0; [L21] time := 0; [L22] alarm := false; VAL [alarm=false, gate=0, maxGatePosition=100, one=1, thousand=1000, time=0] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=1, maxGatePosition=100, one=1, thousand=1000, time=99, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=2, maxGatePosition=100, one=1, thousand=1000, time=198, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=3, maxGatePosition=100, one=1, thousand=1000, time=297, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=4, maxGatePosition=100, one=1, thousand=1000, time=396, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=5, maxGatePosition=100, one=1, thousand=1000, time=495, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=6, maxGatePosition=100, one=1, thousand=1000, time=594, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=7, maxGatePosition=100, one=1, thousand=1000, time=693, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=8, maxGatePosition=100, one=1, thousand=1000, time=792, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=9, maxGatePosition=100, one=1, thousand=1000, time=891, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=10, maxGatePosition=100, one=1, thousand=1000, time=990, time_increment=99] [L24] COND TRUE time < thousand [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; [L28] havoc time_increment; [L29] COND FALSE !(time_increment > 99) [L32] time := time + time_increment; VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=1000, time_increment=10] [L24] COND FALSE !(time < thousand) VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=1000, time_increment=10] [L35] assert alarm || gate == maxGatePosition; VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=1000, time_increment=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. UNSAFE Result, 1.7s OverallTime, 12 OverallIterations, 11 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 3 SDslu, 8 SDs, 0 SdLazy, 177 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=11, 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.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 3927 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 0/220 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GateControllerIncorrect1.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_15-14-55-078.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GateControllerIncorrect1.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_15-14-55-078.csv Received shutdown request...