java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:36:12,455 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:36:12,457 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:36:12,475 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:36:12,476 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:36:12,478 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:36:12,479 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:36:12,481 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:36:12,483 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:36:12,486 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:36:12,489 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:36:12,489 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:36:12,490 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:36:12,492 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:36:12,493 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:36:12,494 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:36:12,495 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:36:12,497 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:36:12,499 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:36:12,501 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:36:12,502 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:36:12,503 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:36:12,506 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:36:12,506 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:36:12,506 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:36:12,508 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:36:12,509 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:36:12,509 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:36:12,510 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:36:12,512 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:36:12,512 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:36:12,513 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:36:12,513 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:36:12,513 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:36:12,514 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:36:12,515 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:36:12,515 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 09:36:12,531 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:36:12,532 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:36:12,533 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:36:12,533 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:36:12,534 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:36:12,534 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:36:12,534 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:36:12,534 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:36:12,535 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:36:12,535 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:36:12,535 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:36:12,535 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:36:12,535 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:36:12,536 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:36:12,536 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:36:12,536 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:36:12,536 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:36:12,536 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:36:12,537 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:36:12,537 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:36:12,537 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:36:12,537 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:36:12,537 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:36:12,538 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:36:12,538 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:36:12,538 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:36:12,538 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:36:12,538 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:36:12,539 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:36:12,539 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:36:12,539 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:36:12,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:36:12,608 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:36:12,613 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:36:12,615 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:36:12,616 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:36:12,617 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl [2018-10-04 09:36:12,617 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl' [2018-10-04 09:36:12,663 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:36:12,664 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:36:12,665 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:36:12,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:36:12,666 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:36:12,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:12" (1/1) ... [2018-10-04 09:36:12,702 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:12" (1/1) ... [2018-10-04 09:36:12,707 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 09:36:12,708 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 09:36:12,708 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 09:36:12,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:36:12,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:36:12,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:36:12,712 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:36:12,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:12" (1/1) ... [2018-10-04 09:36:12,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:12" (1/1) ... [2018-10-04 09:36:12,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:12" (1/1) ... [2018-10-04 09:36:12,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:12" (1/1) ... [2018-10-04 09:36:12,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:12" (1/1) ... [2018-10-04 09:36:12,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:12" (1/1) ... [2018-10-04 09:36:12,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:12" (1/1) ... [2018-10-04 09:36:12,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:36:12,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:36:12,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:36:12,743 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:36:12,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:36:12,818 INFO L124 BoogieDeclarations]: Specification and implementation of procedure GateController given in one single declaration [2018-10-04 09:36:12,819 INFO L130 BoogieDeclarations]: Found specification of procedure GateController [2018-10-04 09:36:12,819 INFO L138 BoogieDeclarations]: Found implementation of procedure GateController [2018-10-04 09:36:13,125 INFO L338 CfgBuilder]: Using library mode [2018-10-04 09:36:13,125 INFO L202 PluginConnector]: Adding new model GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:36:13 BoogieIcfgContainer [2018-10-04 09:36:13,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:36:13,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:36:13,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:36:13,131 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:36:13,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:12" (1/2) ... [2018-10-04 09:36:13,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fea6650 and model type GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:36:13, skipping insertion in model container [2018-10-04 09:36:13,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:36:13" (2/2) ... [2018-10-04 09:36:13,134 INFO L112 eAbstractionObserver]: Analyzing ICFG GateControllerIncorrect1.bpl [2018-10-04 09:36:13,145 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:36:13,153 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:36:13,208 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:36:13,209 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:36:13,210 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:36:13,210 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:36:13,210 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:36:13,210 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:36:13,211 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:36:13,211 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:36:13,211 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:36:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-10-04 09:36:13,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 09:36:13,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:13,236 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 09:36:13,238 INFO L423 AbstractCegarLoop]: === Iteration 1 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:13,245 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:13,246 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2018-10-04 09:36:13,248 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:13,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:13,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:13,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:13,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:13,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:13,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:13,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:36:13,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:36:13,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:36:13,437 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:13,439 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-10-04 09:36:13,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:13,497 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-10-04 09:36:13,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:36:13,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 09:36:13,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:13,512 INFO L225 Difference]: With dead ends: 19 [2018-10-04 09:36:13,512 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 09:36:13,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:36:13,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 09:36:13,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-10-04 09:36:13,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 09:36:13,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-10-04 09:36:13,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 3 [2018-10-04 09:36:13,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:13,553 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-10-04 09:36:13,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:36:13,553 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-10-04 09:36:13,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:36:13,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:13,554 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:13,554 INFO L423 AbstractCegarLoop]: === Iteration 2 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:13,555 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:13,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1953617644, now seen corresponding path program 1 times [2018-10-04 09:36:13,555 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:13,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:13,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:13,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:13,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:13,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:36:13,761 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:36:13,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:13,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:36:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:14,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:36:14,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-04 09:36:14,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:36:14,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:36:14,280 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:14,280 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 8 states. [2018-10-04 09:36:14,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:14,435 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2018-10-04 09:36:14,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:36:14,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:36:14,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:14,437 INFO L225 Difference]: With dead ends: 21 [2018-10-04 09:36:14,437 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 09:36:14,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 6 [2018-10-04 09:36:14,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 09:36:14,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-10-04 09:36:14,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 09:36:14,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-10-04 09:36:14,444 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 8 [2018-10-04 09:36:14,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:14,444 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-10-04 09:36:14,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:36:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2018-10-04 09:36:14,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:36:14,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:14,446 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:14,446 INFO L423 AbstractCegarLoop]: === Iteration 3 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:14,447 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:14,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1953558062, now seen corresponding path program 1 times [2018-10-04 09:36:14,447 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:14,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:14,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:14,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:14,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:14,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:14,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:36:14,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:36:14,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:36:14,510 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:14,511 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand 3 states. [2018-10-04 09:36:14,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:14,550 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2018-10-04 09:36:14,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:36:14,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-10-04 09:36:14,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:14,554 INFO L225 Difference]: With dead ends: 21 [2018-10-04 09:36:14,554 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 09:36:14,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:36:14,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 09:36:14,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-04 09:36:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 09:36:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-10-04 09:36:14,562 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2018-10-04 09:36:14,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:14,563 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-10-04 09:36:14,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:36:14,563 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-10-04 09:36:14,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:36:14,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:14,564 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1] [2018-10-04 09:36:14,564 INFO L423 AbstractCegarLoop]: === Iteration 4 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:14,565 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:14,567 INFO L82 PathProgramCache]: Analyzing trace with hash 72785504, now seen corresponding path program 2 times [2018-10-04 09:36:14,567 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:14,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:14,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:14,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:14,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:14,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:36:14,900 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:36:14,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:36:14,948 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:36:14,948 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:36:14,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:36:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:15,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:36:15,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-04 09:36:15,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 09:36:15,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 09:36:15,268 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:15,268 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 12 states. [2018-10-04 09:36:15,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:15,350 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-10-04 09:36:15,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:36:15,351 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2018-10-04 09:36:15,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:15,352 INFO L225 Difference]: With dead ends: 25 [2018-10-04 09:36:15,352 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 09:36:15,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 8 [2018-10-04 09:36:15,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 09:36:15,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-10-04 09:36:15,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 09:36:15,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-10-04 09:36:15,358 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2018-10-04 09:36:15,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:15,359 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-10-04 09:36:15,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 09:36:15,359 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-10-04 09:36:15,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 09:36:15,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:15,360 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1] [2018-10-04 09:36:15,360 INFO L423 AbstractCegarLoop]: === Iteration 5 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:15,361 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:15,361 INFO L82 PathProgramCache]: Analyzing trace with hash 491282284, now seen corresponding path program 3 times [2018-10-04 09:36:15,361 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:15,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:15,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:15,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:36:15,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:15,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:36:15,672 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:36:15,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:36:15,695 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 09:36:15,696 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:36:15,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:36:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:16,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:36:16,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-04 09:36:16,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 09:36:16,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 09:36:16,117 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:16,117 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 16 states. [2018-10-04 09:36:16,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:16,568 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-10-04 09:36:16,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:36:16,568 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-10-04 09:36:16,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:16,569 INFO L225 Difference]: With dead ends: 30 [2018-10-04 09:36:16,569 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 09:36:16,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.2s impTime 10 [2018-10-04 09:36:16,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 09:36:16,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-10-04 09:36:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:36:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-10-04 09:36:16,575 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2018-10-04 09:36:16,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:16,575 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-10-04 09:36:16,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 09:36:16,576 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-10-04 09:36:16,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 09:36:16,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:16,577 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1] [2018-10-04 09:36:16,577 INFO L423 AbstractCegarLoop]: === Iteration 6 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:16,577 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:16,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1589732832, now seen corresponding path program 4 times [2018-10-04 09:36:16,578 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:16,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:16,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:16,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:36:16,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:16,786 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:16,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:36:16,787 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:36:16,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:36:16,804 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:36:16,804 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:36:16,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:36:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:17,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:36:17,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-04 09:36:17,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 09:36:17,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 09:36:17,291 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:17,291 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 20 states. [2018-10-04 09:36:17,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:17,563 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-10-04 09:36:17,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:36:17,564 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-10-04 09:36:17,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:17,565 INFO L225 Difference]: With dead ends: 35 [2018-10-04 09:36:17,565 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 09:36:17,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 12 [2018-10-04 09:36:17,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 09:36:17,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-10-04 09:36:17,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 09:36:17,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-10-04 09:36:17,573 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 23 [2018-10-04 09:36:17,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:17,573 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-10-04 09:36:17,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 09:36:17,573 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-10-04 09:36:17,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 09:36:17,574 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:17,575 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1] [2018-10-04 09:36:17,575 INFO L423 AbstractCegarLoop]: === Iteration 7 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:17,575 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:17,575 INFO L82 PathProgramCache]: Analyzing trace with hash 602818540, now seen corresponding path program 5 times [2018-10-04 09:36:17,575 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:17,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:17,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:17,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:36:17,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:17,752 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:17,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:36:17,753 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:36:17,761 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:36:17,784 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 09:36:17,784 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:36:17,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:36:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:18,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:36:18,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-10-04 09:36:18,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 09:36:18,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 09:36:18,783 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:18,783 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 24 states. [2018-10-04 09:36:18,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:18,984 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-10-04 09:36:18,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 09:36:18,984 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2018-10-04 09:36:18,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:18,985 INFO L225 Difference]: With dead ends: 40 [2018-10-04 09:36:18,986 INFO L226 Difference]: Without dead ends: 38 [2018-10-04 09:36:18,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.5s impTime 14 [2018-10-04 09:36:18,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-04 09:36:18,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-10-04 09:36:18,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:36:18,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-10-04 09:36:18,992 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 28 [2018-10-04 09:36:18,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:18,992 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-10-04 09:36:18,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 09:36:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-10-04 09:36:18,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 09:36:18,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:18,993 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1] [2018-10-04 09:36:18,994 INFO L423 AbstractCegarLoop]: === Iteration 8 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:18,994 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:18,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1979239776, now seen corresponding path program 6 times [2018-10-04 09:36:18,994 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:18,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:18,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:18,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:36:18,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:19,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:36:19,211 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:36:19,221 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:36:19,243 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 09:36:19,243 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:36:19,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:36:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:20,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:36:20,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-10-04 09:36:20,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 09:36:20,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 09:36:20,006 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:20,007 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 28 states. [2018-10-04 09:36:20,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:20,190 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-10-04 09:36:20,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 09:36:20,192 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2018-10-04 09:36:20,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:20,194 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:36:20,194 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:36:20,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.3s impTime 16 [2018-10-04 09:36:20,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:36:20,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-10-04 09:36:20,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 09:36:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-10-04 09:36:20,201 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 33 [2018-10-04 09:36:20,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:20,201 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-10-04 09:36:20,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 09:36:20,202 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-10-04 09:36:20,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 09:36:20,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:20,203 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1] [2018-10-04 09:36:20,203 INFO L423 AbstractCegarLoop]: === Iteration 9 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:20,203 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:20,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1800695700, now seen corresponding path program 7 times [2018-10-04 09:36:20,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:20,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:20,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:20,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:36:20,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:20,521 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:20,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:36:20,521 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:36:20,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:20,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:36:21,037 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:21,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:36:21,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-10-04 09:36:21,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 09:36:21,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 09:36:21,059 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:21,060 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 32 states. [2018-10-04 09:36:21,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:21,293 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2018-10-04 09:36:21,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 09:36:21,294 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2018-10-04 09:36:21,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:21,295 INFO L225 Difference]: With dead ends: 50 [2018-10-04 09:36:21,295 INFO L226 Difference]: Without dead ends: 48 [2018-10-04 09:36:21,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 18 [2018-10-04 09:36:21,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-04 09:36:21,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-10-04 09:36:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 09:36:21,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-10-04 09:36:21,302 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 38 [2018-10-04 09:36:21,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:21,303 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-10-04 09:36:21,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 09:36:21,303 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-10-04 09:36:21,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 09:36:21,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:21,305 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1] [2018-10-04 09:36:21,305 INFO L423 AbstractCegarLoop]: === Iteration 10 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:21,305 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:21,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1430989600, now seen corresponding path program 8 times [2018-10-04 09:36:21,305 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:21,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:21,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:21,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:21,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:21,626 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:21,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:36:21,627 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:36:21,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:36:21,651 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:36:21,651 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:36:21,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:36:22,342 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:22,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:36:22,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-10-04 09:36:22,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 09:36:22,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 09:36:22,365 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:22,365 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 36 states. [2018-10-04 09:36:22,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:22,570 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-10-04 09:36:22,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 09:36:22,571 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-10-04 09:36:22,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:22,572 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:36:22,572 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:36:22,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.4s impTime 20 [2018-10-04 09:36:22,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:36:22,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-10-04 09:36:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-04 09:36:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2018-10-04 09:36:22,580 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 43 [2018-10-04 09:36:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:22,580 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2018-10-04 09:36:22,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 09:36:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-10-04 09:36:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 09:36:22,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:22,582 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1] [2018-10-04 09:36:22,583 INFO L423 AbstractCegarLoop]: === Iteration 11 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:22,583 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:22,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1043842836, now seen corresponding path program 9 times [2018-10-04 09:36:22,583 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:22,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:22,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:22,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:36:22,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:22,950 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:22,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:36:22,951 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:36:22,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:36:22,999 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-04 09:36:23,000 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:36:23,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:36:24,016 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 09:36:24,026 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:24,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:36:24,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-10-04 09:36:24,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 09:36:24,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 09:36:24,048 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:24,048 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 40 states. [2018-10-04 09:36:24,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:24,217 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-10-04 09:36:24,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 09:36:24,218 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 48 [2018-10-04 09:36:24,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:24,219 INFO L225 Difference]: With dead ends: 60 [2018-10-04 09:36:24,219 INFO L226 Difference]: Without dead ends: 58 [2018-10-04 09:36:24,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.7s impTime 7 [2018-10-04 09:36:24,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-04 09:36:24,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-10-04 09:36:24,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-04 09:36:24,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-10-04 09:36:24,228 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 48 [2018-10-04 09:36:24,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:24,228 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-10-04 09:36:24,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 09:36:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-10-04 09:36:24,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-04 09:36:24,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:24,229 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1] [2018-10-04 09:36:24,230 INFO L423 AbstractCegarLoop]: === Iteration 12 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:24,230 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:24,230 INFO L82 PathProgramCache]: Analyzing trace with hash -676496288, now seen corresponding path program 10 times [2018-10-04 09:36:24,230 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:24,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:24,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:24,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:36:24,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:25,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:36:25,068 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:36:25,076 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:36:25,113 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:36:25,113 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:36:25,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:36:25,950 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 09:36:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:26,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:36:26,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 44 [2018-10-04 09:36:26,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 09:36:26,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 09:36:26,073 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:26,073 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 45 states. [2018-10-04 09:36:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:26,272 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2018-10-04 09:36:26,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 09:36:26,272 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 53 [2018-10-04 09:36:26,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:26,273 INFO L225 Difference]: With dead ends: 65 [2018-10-04 09:36:26,273 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 09:36:26,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.2s impTime 9 [2018-10-04 09:36:26,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 09:36:26,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-10-04 09:36:26,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 09:36:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-10-04 09:36:26,280 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 53 [2018-10-04 09:36:26,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:26,281 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-10-04 09:36:26,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 09:36:26,281 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-10-04 09:36:26,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 09:36:26,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:26,282 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1] [2018-10-04 09:36:26,282 INFO L423 AbstractCegarLoop]: === Iteration 13 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:26,282 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:26,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1014218388, now seen corresponding path program 11 times [2018-10-04 09:36:26,283 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:26,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:26,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:26,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:36:26,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 09:36:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 09:36:26,328 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-04 09:36:26,365 INFO L202 PluginConnector]: Adding new model GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:36:26 BoogieIcfgContainer [2018-10-04 09:36:26,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:36:26,366 INFO L168 Benchmark]: Toolchain (without parser) took 13703.20 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 48.8 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 363.4 MB). Peak memory consumption was 412.1 MB. Max. memory is 7.1 GB. [2018-10-04 09:36:26,369 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:36:26,369 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:36:26,370 INFO L168 Benchmark]: Boogie Preprocessor took 30.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:36:26,371 INFO L168 Benchmark]: RCFGBuilder took 383.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 09:36:26,371 INFO L168 Benchmark]: TraceAbstraction took 13238.78 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 48.8 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 342.2 MB). Peak memory consumption was 391.0 MB. Max. memory is 7.1 GB. [2018-10-04 09:36:26,376 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 383.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13238.78 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 48.8 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 342.2 MB). Peak memory consumption was 391.0 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 VAL [alarm=false, gate=0, maxGatePosition=100, one=1, thousand=1000, time=0] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=1, maxGatePosition=100, one=1, thousand=1000, time=0] [L28] havoc time_increment; VAL [alarm=false, gate=1, maxGatePosition=100, one=1, thousand=1000, time=0] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=1, maxGatePosition=100, one=1, thousand=1000, time=0, 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 VAL [alarm=false, gate=1, maxGatePosition=100, one=1, thousand=1000, time=99, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=2, maxGatePosition=100, one=1, thousand=1000, time=99, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=2, maxGatePosition=100, one=1, thousand=1000, time=99] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=2, maxGatePosition=100, one=1, thousand=1000, time=99, 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 VAL [alarm=false, gate=2, maxGatePosition=100, one=1, thousand=1000, time=198, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=3, maxGatePosition=100, one=1, thousand=1000, time=198, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=3, maxGatePosition=100, one=1, thousand=1000, time=198] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=3, maxGatePosition=100, one=1, thousand=1000, time=198, 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 VAL [alarm=false, gate=3, maxGatePosition=100, one=1, thousand=1000, time=297, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=4, maxGatePosition=100, one=1, thousand=1000, time=297, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=4, maxGatePosition=100, one=1, thousand=1000, time=297] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=4, maxGatePosition=100, one=1, thousand=1000, time=297, 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 VAL [alarm=false, gate=4, maxGatePosition=100, one=1, thousand=1000, time=396, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=5, maxGatePosition=100, one=1, thousand=1000, time=396, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=5, maxGatePosition=100, one=1, thousand=1000, time=396] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=5, maxGatePosition=100, one=1, thousand=1000, time=396, 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 VAL [alarm=false, gate=5, maxGatePosition=100, one=1, thousand=1000, time=495, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=6, maxGatePosition=100, one=1, thousand=1000, time=495, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=6, maxGatePosition=100, one=1, thousand=1000, time=495] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=6, maxGatePosition=100, one=1, thousand=1000, time=495, 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 VAL [alarm=false, gate=6, maxGatePosition=100, one=1, thousand=1000, time=594, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=7, maxGatePosition=100, one=1, thousand=1000, time=594, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=7, maxGatePosition=100, one=1, thousand=1000, time=594] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=7, maxGatePosition=100, one=1, thousand=1000, time=594, 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 VAL [alarm=false, gate=7, maxGatePosition=100, one=1, thousand=1000, time=693, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=8, maxGatePosition=100, one=1, thousand=1000, time=693, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=8, maxGatePosition=100, one=1, thousand=1000, time=693] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=8, maxGatePosition=100, one=1, thousand=1000, time=693, 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 VAL [alarm=false, gate=8, maxGatePosition=100, one=1, thousand=1000, time=792, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=9, maxGatePosition=100, one=1, thousand=1000, time=792, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=9, maxGatePosition=100, one=1, thousand=1000, time=792] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=9, maxGatePosition=100, one=1, thousand=1000, time=792, 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 VAL [alarm=false, gate=9, maxGatePosition=100, one=1, thousand=1000, time=891, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=10, maxGatePosition=100, one=1, thousand=1000, time=891, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=10, maxGatePosition=100, one=1, thousand=1000, time=891] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=10, maxGatePosition=100, one=1, thousand=1000, time=891, 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 VAL [alarm=false, gate=10, maxGatePosition=100, one=1, thousand=1000, time=990, time_increment=99] [L25] COND TRUE gate < maxGatePosition [L26] gate := gate + 1; VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=990, time_increment=99] [L28] havoc time_increment; VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=990] [L29] COND FALSE !(time_increment > 99) VAL [alarm=false, gate=11, maxGatePosition=100, one=1, thousand=1000, time=990, time_increment=10] [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, 13.1s OverallTime, 13 OverallIterations, 11 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 125 SDtfs, 822 SDslu, 760 SDs, 0 SdLazy, 776 SolverSat, 148 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 429 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=12, 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, 12 MinimizatonAttempts, 45 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 679 NumberOfCodeBlocks, 679 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 599 ConstructedInterpolants, 285 QuantifiedInterpolants, 207721 SizeOfPredicates, 85 NumberOfNonLiveVariables, 600 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 1/1761 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_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-36-26-389.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GateControllerIncorrect1.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-36-26-389.csv Received shutdown request...