java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:15:25,329 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:15:25,331 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:15:25,349 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:15:25,350 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:15:25,351 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:15:25,353 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:15:25,355 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:15:25,359 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:15:25,360 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:15:25,363 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:15:25,363 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:15:25,365 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:15:25,366 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:15:25,369 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:15:25,380 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:15:25,381 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:15:25,382 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:15:25,388 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:15:25,392 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:15:25,393 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:15:25,394 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:15:25,400 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:15:25,401 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:15:25,401 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:15:25,402 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:15:25,404 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:15:25,405 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:15:25,406 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:15:25,407 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:15:25,407 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:15:25,409 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:15:25,409 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:15:25,409 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:15:25,411 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:15:25,413 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:15:25,414 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 13:15:25,427 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:15:25,427 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:15:25,428 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:15:25,429 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:15:25,429 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:15:25,429 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:15:25,429 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:15:25,429 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:15:25,505 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:15:25,522 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:15:25,531 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:15:25,533 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:15:25,533 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:15:25,534 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-25 13:15:25,534 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl' [2018-07-25 13:15:25,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:15:25,590 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:15:25,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:15:25,591 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:15:25,591 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:15:25,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:25" (1/1) ... [2018-07-25 13:15:25,626 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:25" (1/1) ... [2018-07-25 13:15:25,631 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 13:15:25,631 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 13:15:25,631 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 13:15:25,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:15:25,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:15:25,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:15:25,635 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:15:25,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:25" (1/1) ... [2018-07-25 13:15:25,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:25" (1/1) ... [2018-07-25 13:15:25,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:25" (1/1) ... [2018-07-25 13:15:25,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:25" (1/1) ... [2018-07-25 13:15:25,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:25" (1/1) ... [2018-07-25 13:15:25,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:25" (1/1) ... [2018-07-25 13:15:25,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:25" (1/1) ... [2018-07-25 13:15:25,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:15:25,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:15:25,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:15:25,663 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:15:25,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:25" (1/1) ... [2018-07-25 13:15:25,747 INFO L124 BoogieDeclarations]: Specification and implementation of procedure GateController given in one single declaration [2018-07-25 13:15:25,747 INFO L130 BoogieDeclarations]: Found specification of procedure GateController [2018-07-25 13:15:25,748 INFO L138 BoogieDeclarations]: Found implementation of procedure GateController [2018-07-25 13:15:25,940 INFO L270 CfgBuilder]: Using library mode [2018-07-25 13:15:25,940 INFO L202 PluginConnector]: Adding new model GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:15:25 BoogieIcfgContainer [2018-07-25 13:15:25,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:15:25,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:15:25,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:15:25,945 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:15:25,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:25" (1/2) ... [2018-07-25 13:15:25,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e96d443 and model type GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:15:25, skipping insertion in model container [2018-07-25 13:15:25,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:15:25" (2/2) ... [2018-07-25 13:15:25,950 INFO L112 eAbstractionObserver]: Analyzing ICFG GateControllerIncorrect1.bpl [2018-07-25 13:15:25,960 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:15:25,968 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:15:26,018 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:15:26,019 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:15:26,020 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:15:26,020 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:15:26,020 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:15:26,020 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:15:26,021 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:15:26,021 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:15:26,021 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:15:26,037 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-07-25 13:15:26,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-25 13:15:26,047 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:26,048 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-25 13:15:26,049 INFO L415 AbstractCegarLoop]: === Iteration 1 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:26,055 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2018-07-25 13:15:26,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:26,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:26,140 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:26,141 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:15:26,146 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:15:26,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:15:26,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:15:26,182 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-07-25 13:15:26,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:26,233 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 13:15:26,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:15:26,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-25 13:15:26,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:26,258 INFO L225 Difference]: With dead ends: 9 [2018-07-25 13:15:26,260 INFO L226 Difference]: Without dead ends: 5 [2018-07-25 13:15:26,264 INFO L574 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-25 13:15:26,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-25 13:15:26,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-25 13:15:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-25 13:15:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-25 13:15:26,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-25 13:15:26,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:26,314 INFO L472 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-25 13:15:26,314 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:15:26,315 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-25 13:15:26,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:15:26,315 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:26,315 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:15:26,315 INFO L415 AbstractCegarLoop]: === Iteration 2 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:26,316 INFO L82 PathProgramCache]: Analyzing trace with hash 952992, now seen corresponding path program 1 times [2018-07-25 13:15:26,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:26,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:26,351 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:26,351 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 13:15:26,354 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:15:26,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:15:26,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:15:26,355 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-07-25 13:15:26,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:26,393 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-25 13:15:26,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:15:26,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-25 13:15:26,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:26,394 INFO L225 Difference]: With dead ends: 8 [2018-07-25 13:15:26,394 INFO L226 Difference]: Without dead ends: 6 [2018-07-25 13:15:26,396 INFO L574 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-25 13:15:26,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-25 13:15:26,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-25 13:15:26,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-25 13:15:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-25 13:15:26,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-25 13:15:26,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:26,399 INFO L472 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-25 13:15:26,399 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:15:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-25 13:15:26,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 13:15:26,400 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:26,400 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-25 13:15:26,401 INFO L415 AbstractCegarLoop]: === Iteration 3 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:26,401 INFO L82 PathProgramCache]: Analyzing trace with hash 29552352, now seen corresponding path program 2 times [2018-07-25 13:15:26,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:26,447 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:26,448 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:15:26,448 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:15:26,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:15:26,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:15:26,449 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-07-25 13:15:26,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:26,490 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 13:15:26,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:15:26,491 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-07-25 13:15:26,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:26,491 INFO L225 Difference]: With dead ends: 9 [2018-07-25 13:15:26,492 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 13:15:26,492 INFO L574 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-25 13:15:26,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 13:15:26,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 13:15:26,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 13:15:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 13:15:26,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-25 13:15:26,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:26,496 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 13:15:26,497 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:15:26,497 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 13:15:26,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:26,497 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:26,498 INFO L354 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-25 13:15:26,498 INFO L415 AbstractCegarLoop]: === Iteration 4 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:26,498 INFO L82 PathProgramCache]: Analyzing trace with hash 916132512, now seen corresponding path program 3 times [2018-07-25 13:15:26,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:26,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:26,585 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:26,586 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:15:26,586 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:26,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:26,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:26,587 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-07-25 13:15:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:26,611 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-25 13:15:26,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:15:26,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:15:26,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:26,612 INFO L225 Difference]: With dead ends: 10 [2018-07-25 13:15:26,612 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 13:15:26,613 INFO L574 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-25 13:15:26,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 13:15:26,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-25 13:15:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-25 13:15:26,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-25 13:15:26,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-25 13:15:26,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:26,617 INFO L472 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-25 13:15:26,617 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:26,617 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-25 13:15:26,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:15:26,618 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:26,618 INFO L354 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-25 13:15:26,618 INFO L415 AbstractCegarLoop]: === Iteration 5 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:26,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1664653600, now seen corresponding path program 4 times [2018-07-25 13:15:26,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:26,732 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:26,732 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:15:26,735 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:15:26,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:15:26,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:15:26,736 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-07-25 13:15:26,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:26,772 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 13:15:26,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:15:26,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:15:26,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:26,773 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:15:26,773 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:15:26,774 INFO L574 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-25 13:15:26,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:15:26,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 13:15:26,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 13:15:26,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 13:15:26,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-25 13:15:26,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:26,778 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 13:15:26,779 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:15:26,779 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 13:15:26,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:15:26,779 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:26,780 INFO L354 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-25 13:15:26,780 INFO L415 AbstractCegarLoop]: === Iteration 6 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:26,780 INFO L82 PathProgramCache]: Analyzing trace with hash -64644448, now seen corresponding path program 5 times [2018-07-25 13:15:26,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:26,851 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:26,851 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:15:26,852 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:15:26,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:15:26,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:15:26,855 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-07-25 13:15:26,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:26,895 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-25 13:15:26,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:15:26,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-07-25 13:15:26,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:26,896 INFO L225 Difference]: With dead ends: 12 [2018-07-25 13:15:26,896 INFO L226 Difference]: Without dead ends: 10 [2018-07-25 13:15:26,897 INFO L574 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-25 13:15:26,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-25 13:15:26,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-25 13:15:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-25 13:15:26,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-25 13:15:26,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-25 13:15:26,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:26,905 INFO L472 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-25 13:15:26,905 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:15:26,905 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-25 13:15:26,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 13:15:26,909 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:26,909 INFO L354 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-25 13:15:26,909 INFO L415 AbstractCegarLoop]: === Iteration 7 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:26,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2003968288, now seen corresponding path program 6 times [2018-07-25 13:15:26,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:26,985 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:26,985 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:26,985 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:15:26,986 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:15:26,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:15:26,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:15:26,987 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-07-25 13:15:27,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:27,011 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 13:15:27,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:15:27,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-07-25 13:15:27,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:27,012 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:15:27,012 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:15:27,013 INFO L574 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-25 13:15:27,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:15:27,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:15:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:15:27,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 13:15:27,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-25 13:15:27,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:27,023 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 13:15:27,023 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:15:27,023 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 13:15:27,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:15:27,024 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:27,024 INFO L354 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-25 13:15:27,024 INFO L415 AbstractCegarLoop]: === Iteration 8 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:27,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1993465184, now seen corresponding path program 7 times [2018-07-25 13:15:27,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:27,114 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:27,114 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:15:27,114 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:15:27,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:15:27,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:15:27,115 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-07-25 13:15:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:27,152 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-25 13:15:27,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:15:27,152 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-07-25 13:15:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:27,153 INFO L225 Difference]: With dead ends: 14 [2018-07-25 13:15:27,153 INFO L226 Difference]: Without dead ends: 12 [2018-07-25 13:15:27,154 INFO L574 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-25 13:15:27,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-25 13:15:27,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-25 13:15:27,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-25 13:15:27,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-25 13:15:27,158 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-25 13:15:27,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:27,158 INFO L472 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-25 13:15:27,159 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:15:27,159 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-25 13:15:27,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:15:27,159 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:27,160 INFO L354 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-25 13:15:27,160 INFO L415 AbstractCegarLoop]: === Iteration 9 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:27,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1667868960, now seen corresponding path program 8 times [2018-07-25 13:15:27,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:27,261 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:27,262 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:27,262 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:15:27,262 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:15:27,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:15:27,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=67, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:15:27,264 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-07-25 13:15:27,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:27,284 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 13:15:27,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:15:27,284 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-07-25 13:15:27,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:27,285 INFO L225 Difference]: With dead ends: 15 [2018-07-25 13:15:27,285 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:15:27,286 INFO L574 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-25 13:15:27,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:15:27,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 13:15:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:15:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 13:15:27,290 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-25 13:15:27,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:27,291 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 13:15:27,291 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:15:27,292 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 13:15:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:15:27,292 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:27,292 INFO L354 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-25 13:15:27,293 INFO L415 AbstractCegarLoop]: === Iteration 10 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:27,293 INFO L82 PathProgramCache]: Analyzing trace with hash -164320608, now seen corresponding path program 9 times [2018-07-25 13:15:27,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:27,397 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:27,397 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:27,398 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:15:27,399 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:15:27,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:15:27,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:15:27,401 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-07-25 13:15:27,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:27,428 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-25 13:15:27,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:15:27,430 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-07-25 13:15:27,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:27,432 INFO L225 Difference]: With dead ends: 16 [2018-07-25 13:15:27,433 INFO L226 Difference]: Without dead ends: 14 [2018-07-25 13:15:27,433 INFO L574 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-25 13:15:27,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-25 13:15:27,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-25 13:15:27,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-25 13:15:27,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-25 13:15:27,444 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-25 13:15:27,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:27,445 INFO L472 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-25 13:15:27,445 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:15:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-25 13:15:27,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:15:27,446 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:27,446 INFO L354 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-25 13:15:27,451 INFO L415 AbstractCegarLoop]: === Iteration 11 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:27,451 INFO L82 PathProgramCache]: Analyzing trace with hash -798961952, now seen corresponding path program 10 times [2018-07-25 13:15:27,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:27,561 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:15:27,561 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:15:27,562 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:15:27,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:15:27,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:15:27,563 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-07-25 13:15:27,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:27,581 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 13:15:27,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:15:27,582 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-07-25 13:15:27,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:27,583 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:15:27,583 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 13:15:27,584 INFO L574 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-25 13:15:27,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 13:15:27,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 13:15:27,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:15:27,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 13:15:27,591 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-25 13:15:27,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:27,592 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 13:15:27,592 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:15:27,592 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 13:15:27,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:15:27,593 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:27,593 INFO L354 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-25 13:15:27,594 INFO L415 AbstractCegarLoop]: === Iteration 12 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:27,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1001992864, now seen corresponding path program 11 times [2018-07-25 13:15:27,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-25 13:15:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-25 13:15:27,659 INFO L420 BasicCegarLoop]: Counterexample might be feasible [2018-07-25 13:15:27,706 INFO L202 PluginConnector]: Adding new model GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:15:27 BoogieIcfgContainer [2018-07-25 13:15:27,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:15:27,707 INFO L168 Benchmark]: Toolchain (without parser) took 2118.21 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-25 13:15:27,711 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:15:27,712 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:15:27,713 INFO L168 Benchmark]: Boogie Preprocessor took 27.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:15:27,715 INFO L168 Benchmark]: RCFGBuilder took 277.92 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-25 13:15:27,716 INFO L168 Benchmark]: TraceAbstraction took 1764.24 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-25 13:15:27,722 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.12 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 27.64 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 277.92 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 1764.24 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.6s OverallTime, 12 OverallIterations, 11 TraceHistogramMax, 0.4s 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_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-15-27-740.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GateControllerIncorrect1.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-15-27-740.csv Received shutdown request...