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/RailwayCrossing-Incorrenct.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2eb0a67 [2018-10-03 09:02:55,647 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 09:02:55,649 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 09:02:55,661 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 09:02:55,662 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 09:02:55,663 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 09:02:55,664 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 09:02:55,666 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 09:02:55,668 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 09:02:55,669 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 09:02:55,670 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 09:02:55,670 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 09:02:55,671 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 09:02:55,672 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 09:02:55,674 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 09:02:55,674 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 09:02:55,675 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 09:02:55,677 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 09:02:55,680 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 09:02:55,681 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 09:02:55,683 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 09:02:55,684 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 09:02:55,687 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 09:02:55,687 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 09:02:55,687 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 09:02:55,688 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 09:02:55,689 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 09:02:55,690 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 09:02:55,691 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 09:02:55,692 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 09:02:55,693 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 09:02:55,694 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 09:02:55,694 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 09:02:55,694 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 09:02:55,695 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 09:02:55,696 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 09:02:55,696 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-03 09:02:55,712 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 09:02:55,712 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 09:02:55,713 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 09:02:55,713 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 09:02:55,714 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 09:02:55,714 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 09:02:55,714 INFO L133 SettingsManager]: * Use SBE=true [2018-10-03 09:02:55,715 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 09:02:55,715 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 09:02:55,715 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 09:02:55,715 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 09:02:55,715 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 09:02:55,716 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 09:02:55,716 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 09:02:55,716 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 09:02:55,716 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 09:02:55,717 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 09:02:55,717 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 09:02:55,717 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 09:02:55,717 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-03 09:02:55,717 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 09:02:55,718 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-03 09:02:55,718 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 09:02:55,718 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 09:02:55,718 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 09:02:55,718 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 09:02:55,719 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-03 09:02:55,719 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 09:02:55,719 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 09:02:55,719 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 09:02:55,719 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-03 09:02:55,767 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 09:02:55,784 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 09:02:55,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 09:02:55,790 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 09:02:55,790 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 09:02:55,791 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/RailwayCrossing-Incorrenct.bpl [2018-10-03 09:02:55,792 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/RailwayCrossing-Incorrenct.bpl' [2018-10-03 09:02:55,835 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 09:02:55,838 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 09:02:55,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 09:02:55,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 09:02:55,839 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 09:02:55,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,878 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-03 09:02:55,878 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-03 09:02:55,878 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-03 09:02:55,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 09:02:55,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 09:02:55,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 09:02:55,882 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 09:02:55,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 09:02:55,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 09:02:55,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 09:02:55,911 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 09:02:55,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (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-03 09:02:55,990 INFO L124 BoogieDeclarations]: Specification and implementation of procedure GateController given in one single declaration [2018-10-03 09:02:55,990 INFO L130 BoogieDeclarations]: Found specification of procedure GateController [2018-10-03 09:02:55,991 INFO L138 BoogieDeclarations]: Found implementation of procedure GateController [2018-10-03 09:02:56,276 INFO L337 CfgBuilder]: Using library mode [2018-10-03 09:02:56,276 INFO L202 PluginConnector]: Adding new model RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 09:02:56 BoogieIcfgContainer [2018-10-03 09:02:56,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 09:02:56,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-03 09:02:56,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-03 09:02:56,281 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-03 09:02:56,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/2) ... [2018-10-03 09:02:56,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4078dbe9 and model type RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 09:02:56, skipping insertion in model container [2018-10-03 09:02:56,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 09:02:56" (2/2) ... [2018-10-03 09:02:56,285 INFO L112 eAbstractionObserver]: Analyzing ICFG RailwayCrossing-Incorrenct.bpl [2018-10-03 09:02:56,295 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-03 09:02:56,304 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-03 09:02:56,357 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-03 09:02:56,358 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-03 09:02:56,358 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-03 09:02:56,358 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-03 09:02:56,358 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-03 09:02:56,358 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-03 09:02:56,359 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-03 09:02:56,359 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-03 09:02:56,359 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-03 09:02:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-10-03 09:02:56,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-03 09:02:56,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:02:56,383 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-03 09:02:56,385 INFO L423 AbstractCegarLoop]: === Iteration 1 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:02:56,391 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:02:56,392 INFO L82 PathProgramCache]: Analyzing trace with hash 30496, now seen corresponding path program 1 times [2018-10-03 09:02:56,394 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:02:56,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:02:56,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:56,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:56,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:56,563 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-03 09:02:56,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:02:56,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:02:56,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:02:56,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:02:56,594 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:02:56,598 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-10-03 09:02:56,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:02:56,700 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2018-10-03 09:02:56,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:02:56,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-03 09:02:56,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:02:56,715 INFO L225 Difference]: With dead ends: 19 [2018-10-03 09:02:56,716 INFO L226 Difference]: Without dead ends: 13 [2018-10-03 09:02:56,719 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-03 09:02:56,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-03 09:02:56,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-10-03 09:02:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-03 09:02:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2018-10-03 09:02:56,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 3 [2018-10-03 09:02:56,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:02:56,760 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-10-03 09:02:56,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:02:56,761 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2018-10-03 09:02:56,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-03 09:02:56,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:02:56,761 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:02:56,762 INFO L423 AbstractCegarLoop]: === Iteration 2 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:02:56,762 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:02:56,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1863215691, now seen corresponding path program 1 times [2018-10-03 09:02:56,762 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:02:56,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:02:56,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:56,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:56,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:56,810 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-03 09:02:56,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:02:56,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:02:56,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:02:56,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:02:56,813 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:02:56,813 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 3 states. [2018-10-03 09:02:56,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:02:56,828 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2018-10-03 09:02:56,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:02:56,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-10-03 09:02:56,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:02:56,829 INFO L225 Difference]: With dead ends: 16 [2018-10-03 09:02:56,829 INFO L226 Difference]: Without dead ends: 9 [2018-10-03 09:02:56,830 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-03 09:02:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-03 09:02:56,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-03 09:02:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-03 09:02:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-10-03 09:02:56,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2018-10-03 09:02:56,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:02:56,834 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-10-03 09:02:56,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:02:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-10-03 09:02:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-03 09:02:56,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:02:56,835 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:02:56,835 INFO L423 AbstractCegarLoop]: === Iteration 3 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:02:56,835 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:02:56,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1926837521, now seen corresponding path program 1 times [2018-10-03 09:02:56,836 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:02:56,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:02:56,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:56,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:56,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:56,949 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-03 09:02:56,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:02:56,950 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-03 09:02:56,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:56,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:02:57,145 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-03 09:02:57,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:02:57,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-10-03 09:02:57,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-03 09:02:57,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-03 09:02:57,166 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:02:57,166 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 6 states. [2018-10-03 09:02:57,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:02:57,239 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2018-10-03 09:02:57,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 09:02:57,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-10-03 09:02:57,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:02:57,242 INFO L225 Difference]: With dead ends: 20 [2018-10-03 09:02:57,242 INFO L226 Difference]: Without dead ends: 18 [2018-10-03 09:02:57,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 4 [2018-10-03 09:02:57,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-03 09:02:57,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-10-03 09:02:57,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-03 09:02:57,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-10-03 09:02:57,254 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 8 [2018-10-03 09:02:57,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:02:57,255 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-10-03 09:02:57,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-03 09:02:57,255 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2018-10-03 09:02:57,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-03 09:02:57,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:02:57,256 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1] [2018-10-03 09:02:57,257 INFO L423 AbstractCegarLoop]: === Iteration 4 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:02:57,257 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:02:57,257 INFO L82 PathProgramCache]: Analyzing trace with hash 640583104, now seen corresponding path program 2 times [2018-10-03 09:02:57,257 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:02:57,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:02:57,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:57,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:57,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-03 09:02:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-03 09:02:57,323 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-03 09:02:57,349 INFO L202 PluginConnector]: Adding new model RailwayCrossing-Incorrenct.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 09:02:57 BoogieIcfgContainer [2018-10-03 09:02:57,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-03 09:02:57,350 INFO L168 Benchmark]: Toolchain (without parser) took 1514.84 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: 76.6 MB). Peak memory consumption was 76.6 MB. Max. memory is 7.1 GB. [2018-10-03 09:02:57,353 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:02:57,354 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.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-10-03 09:02:57,355 INFO L168 Benchmark]: Boogie Preprocessor took 28.28 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-10-03 09:02:57,355 INFO L168 Benchmark]: RCFGBuilder took 365.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-03 09:02:57,357 INFO L168 Benchmark]: TraceAbstraction took 1071.76 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. [2018-10-03 09:02:57,363 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.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 Preprocessor took 28.28 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 365.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1071.76 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: assertion can be violated assertion can be violated We found a FailurePath: [L16] gate := 0; [L17] time := 0; [L19] one := 1; [L20] hundred := 100 * one; [L21] thousand := 1000 * one; [L22] alarmTrain := false; VAL [alarmTrain=false, gate=0, hundred=100, one=1, thousand=1000, time=0] [L25] COND TRUE time < thousand VAL [alarmTrain=false, gate=0, hundred=100, one=1, thousand=1000, time=0] [L27] COND FALSE !(gateMotorFailure) VAL [alarmTrain=false, gate=0, gateMotorFailure=false, hundred=100, one=1, thousand=1000, time=0] [L30] COND TRUE gate < hundred [L31] gate := gate + 1; VAL [alarmTrain=false, gate=1, gateMotorFailure=false, hundred=100, one=1, thousand=1000, time=0] [L34] havoc increment; [L35] assume increment < 1000; [L36] time := time + increment; VAL [alarmTrain=false, gate=1, gateMotorFailure=false, hundred=100, increment=999, one=1, thousand=1000, time=999] [L25] COND TRUE time < thousand VAL [alarmTrain=false, gate=1, gateMotorFailure=false, hundred=100, increment=999, one=1, thousand=1000, time=999] [L27] COND FALSE !(gateMotorFailure) VAL [alarmTrain=false, gate=1, gateMotorFailure=false, hundred=100, increment=999, one=1, thousand=1000, time=999] [L30] COND TRUE gate < hundred [L31] gate := gate + 1; VAL [alarmTrain=false, gate=2, gateMotorFailure=false, hundred=100, increment=999, one=1, thousand=1000, time=999] [L34] havoc increment; [L35] assume increment < 1000; [L36] time := time + increment; VAL [alarmTrain=false, gate=2, gateMotorFailure=false, hundred=100, increment=1, one=1, thousand=1000, time=1000] [L25] COND FALSE !(time < thousand) VAL [alarmTrain=false, gate=2, gateMotorFailure=false, hundred=100, increment=1, one=1, thousand=1000, time=1000] [L39] assert alarmTrain || gate == hundred; VAL [alarmTrain=false, gate=2, gateMotorFailure=false, hundred=100, increment=1, one=1, thousand=1000, time=1000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. UNSAFE Result, 1.0s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 37 SDtfs, 34 SDslu, 30 SDs, 0 SdLazy, 17 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=3, 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, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 22 ConstructedInterpolants, 6 QuantifiedInterpolants, 860 SizeOfPredicates, 4 NumberOfNonLiveVariables, 25 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 1/3 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/RailwayCrossing-Incorrenct.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-03_09-02-57-388.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/RailwayCrossing-Incorrenct.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-03_09-02-57-388.csv Received shutdown request...