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.epf -i ../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:12:00,642 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:12:00,644 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:12:00,656 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:12:00,657 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:12:00,658 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:12:00,659 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:12:00,661 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:12:00,663 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:12:00,664 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:12:00,665 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:12:00,666 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:12:00,667 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:12:00,668 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:12:00,669 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:12:00,670 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:12:00,671 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:12:00,673 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:12:00,675 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:12:00,677 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:12:00,678 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:12:00,680 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:12:00,683 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:12:00,683 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:12:00,683 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:12:00,684 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:12:00,686 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:12:00,686 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:12:00,687 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:12:00,689 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:12:00,689 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:12:00,690 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:12:00,690 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:12:00,691 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:12:00,692 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:12:00,693 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:12:00,693 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-26 21:12:00,724 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:12:00,726 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:12:00,727 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:12:00,727 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:12:00,728 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:12:00,728 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:12:00,728 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:12:00,729 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:12:00,729 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:12:00,729 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:12:00,730 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:12:00,730 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:12:00,731 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:12:00,731 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:12:00,731 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:12:00,731 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:12:00,731 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:12:00,732 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:12:00,732 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:12:00,732 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:12:00,733 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:12:00,733 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:12:00,733 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:12:00,734 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:12:00,734 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:12:00,734 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:12:00,734 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:12:00,735 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:12:00,735 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:12:00,735 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:12:00,817 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:12:00,835 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:12:00,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:12:00,844 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:12:00,845 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:12:00,846 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl [2018-09-26 21:12:00,846 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GateControllerIncorrect1.bpl' [2018-09-26 21:12:00,899 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:12:00,903 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:12:00,904 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:12:00,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:12:00,904 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:12:00,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:00" (1/1) ... [2018-09-26 21:12:00,940 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:00" (1/1) ... [2018-09-26 21:12:00,945 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 21:12:00,946 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 21:12:00,946 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 21:12:00,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:12:00,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:12:00,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:12:00,950 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:12:00,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:00" (1/1) ... [2018-09-26 21:12:00,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:00" (1/1) ... [2018-09-26 21:12:00,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:00" (1/1) ... [2018-09-26 21:12:00,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:00" (1/1) ... [2018-09-26 21:12:00,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:00" (1/1) ... [2018-09-26 21:12:00,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:00" (1/1) ... [2018-09-26 21:12:00,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:00" (1/1) ... [2018-09-26 21:12:00,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:12:00,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:12:00,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:12:00,980 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:12:00,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:00" (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-09-26 21:12:01,077 INFO L124 BoogieDeclarations]: Specification and implementation of procedure GateController given in one single declaration [2018-09-26 21:12:01,077 INFO L130 BoogieDeclarations]: Found specification of procedure GateController [2018-09-26 21:12:01,078 INFO L138 BoogieDeclarations]: Found implementation of procedure GateController [2018-09-26 21:12:01,410 INFO L343 CfgBuilder]: Using library mode [2018-09-26 21:12:01,411 INFO L202 PluginConnector]: Adding new model GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:12:01 BoogieIcfgContainer [2018-09-26 21:12:01,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:12:01,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:12:01,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:12:01,416 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:12:01,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:00" (1/2) ... [2018-09-26 21:12:01,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c348c9f and model type GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:12:01, skipping insertion in model container [2018-09-26 21:12:01,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:12:01" (2/2) ... [2018-09-26 21:12:01,420 INFO L112 eAbstractionObserver]: Analyzing ICFG GateControllerIncorrect1.bpl [2018-09-26 21:12:01,431 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:12:01,439 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:12:01,494 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:12:01,495 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:12:01,495 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:12:01,495 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:12:01,495 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:12:01,496 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:12:01,496 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:12:01,496 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:12:01,496 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:12:01,513 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-09-26 21:12:01,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 21:12:01,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:01,521 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 21:12:01,523 INFO L423 AbstractCegarLoop]: === Iteration 1 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:01,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:01,529 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2018-09-26 21:12:01,532 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:01,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:01,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:01,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:01,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:01,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:01,754 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:01,754 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:12:01,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:12:01,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:12:01,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:12:01,778 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-09-26 21:12:01,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:01,847 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-09-26 21:12:01,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:12:01,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-26 21:12:01,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:01,861 INFO L225 Difference]: With dead ends: 19 [2018-09-26 21:12:01,861 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 21:12:01,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:12:01,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 21:12:01,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-09-26 21:12:01,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 21:12:01,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-09-26 21:12:01,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 3 [2018-09-26 21:12:01,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:01,904 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-09-26 21:12:01,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:12:01,904 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-09-26 21:12:01,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:12:01,905 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:01,905 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:01,905 INFO L423 AbstractCegarLoop]: === Iteration 2 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:01,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:01,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1953617644, now seen corresponding path program 1 times [2018-09-26 21:12:01,906 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:01,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:01,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:01,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:01,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:02,118 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:02,119 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-09-26 21:12:02,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:02,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:02,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:02,675 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:02,675 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-09-26 21:12:02,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:12:02,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:12:02,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:12:02,677 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 8 states. [2018-09-26 21:12:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:02,784 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2018-09-26 21:12:02,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:12:02,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 21:12:02,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:02,786 INFO L225 Difference]: With dead ends: 21 [2018-09-26 21:12:02,786 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 21:12:02,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:12:02,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 21:12:02,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-09-26 21:12:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 21:12:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-09-26 21:12:02,793 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 8 [2018-09-26 21:12:02,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:02,796 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-09-26 21:12:02,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:12:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2018-09-26 21:12:02,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:12:02,797 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:02,797 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:02,798 INFO L423 AbstractCegarLoop]: === Iteration 3 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:02,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:02,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1953558062, now seen corresponding path program 1 times [2018-09-26 21:12:02,798 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:02,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:02,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:02,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:02,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:02,861 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:02,861 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:12:02,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:12:02,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:12:02,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:12:02,863 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand 3 states. [2018-09-26 21:12:02,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:02,890 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2018-09-26 21:12:02,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:12:02,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-09-26 21:12:02,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:02,892 INFO L225 Difference]: With dead ends: 21 [2018-09-26 21:12:02,892 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 21:12:02,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:12:02,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 21:12:02,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-26 21:12:02,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 21:12:02,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-09-26 21:12:02,897 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2018-09-26 21:12:02,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:02,897 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-09-26 21:12:02,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:12:02,898 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-09-26 21:12:02,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:12:02,898 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:02,898 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1] [2018-09-26 21:12:02,899 INFO L423 AbstractCegarLoop]: === Iteration 4 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:02,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:02,899 INFO L82 PathProgramCache]: Analyzing trace with hash 72785504, now seen corresponding path program 2 times [2018-09-26 21:12:02,900 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:02,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:02,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:02,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:02,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:03,215 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:03,216 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-09-26 21:12:03,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:12:03,254 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:12:03,254 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:12:03,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:03,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:03,529 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:03,529 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-09-26 21:12:03,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 21:12:03,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 21:12:03,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-09-26 21:12:03,531 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 12 states. [2018-09-26 21:12:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:03,726 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-09-26 21:12:03,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 21:12:03,726 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2018-09-26 21:12:03,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:03,727 INFO L225 Difference]: With dead ends: 25 [2018-09-26 21:12:03,727 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 21:12:03,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-09-26 21:12:03,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 21:12:03,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-09-26 21:12:03,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 21:12:03,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-09-26 21:12:03,734 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2018-09-26 21:12:03,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:03,734 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-09-26 21:12:03,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 21:12:03,735 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-09-26 21:12:03,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:12:03,735 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:03,736 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1] [2018-09-26 21:12:03,736 INFO L423 AbstractCegarLoop]: === Iteration 5 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:03,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:03,737 INFO L82 PathProgramCache]: Analyzing trace with hash 491282284, now seen corresponding path program 3 times [2018-09-26 21:12:03,737 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:03,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:03,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:03,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:12:03,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:03,880 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:03,880 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:03,881 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-09-26 21:12:03,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:12:03,934 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-26 21:12:03,934 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:12:03,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:04,277 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-26 21:12:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:04,529 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:04,530 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-09-26 21:12:04,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:12:04,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:12:04,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-09-26 21:12:04,531 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 16 states. [2018-09-26 21:12:04,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:04,633 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-09-26 21:12:04,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 21:12:04,636 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-09-26 21:12:04,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:04,637 INFO L225 Difference]: With dead ends: 30 [2018-09-26 21:12:04,638 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 21:12:04,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-09-26 21:12:04,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 21:12:04,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-09-26 21:12:04,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 21:12:04,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-09-26 21:12:04,644 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2018-09-26 21:12:04,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:04,645 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-09-26 21:12:04,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:12:04,645 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-09-26 21:12:04,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 21:12:04,646 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:04,646 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1] [2018-09-26 21:12:04,646 INFO L423 AbstractCegarLoop]: === Iteration 6 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:04,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:04,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1589732832, now seen corresponding path program 4 times [2018-09-26 21:12:04,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:04,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:04,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:04,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:12:04,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:04,827 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:04,827 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:04,827 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-09-26 21:12:04,840 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:12:04,853 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:12:04,853 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:12:04,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:05,216 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:05,237 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:05,237 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-09-26 21:12:05,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 21:12:05,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 21:12:05,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2018-09-26 21:12:05,239 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 20 states. [2018-09-26 21:12:05,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:05,604 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-09-26 21:12:05,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:12:05,605 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-09-26 21:12:05,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:05,606 INFO L225 Difference]: With dead ends: 35 [2018-09-26 21:12:05,606 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 21:12:05,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2018-09-26 21:12:05,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 21:12:05,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-09-26 21:12:05,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 21:12:05,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-09-26 21:12:05,621 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 23 [2018-09-26 21:12:05,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:05,621 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-09-26 21:12:05,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 21:12:05,623 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-09-26 21:12:05,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 21:12:05,624 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:05,624 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1] [2018-09-26 21:12:05,624 INFO L423 AbstractCegarLoop]: === Iteration 7 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:05,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:05,630 INFO L82 PathProgramCache]: Analyzing trace with hash 602818540, now seen corresponding path program 5 times [2018-09-26 21:12:05,630 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:05,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:05,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:05,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:12:05,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:06,002 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:06,002 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-09-26 21:12:06,011 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:12:06,030 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-26 21:12:06,031 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:12:06,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:06,462 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-26 21:12:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:06,841 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:06,842 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-09-26 21:12:06,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 21:12:06,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 21:12:06,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2018-09-26 21:12:06,844 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 24 states. [2018-09-26 21:12:06,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:06,968 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-09-26 21:12:06,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:12:06,969 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2018-09-26 21:12:06,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:06,970 INFO L225 Difference]: With dead ends: 40 [2018-09-26 21:12:06,970 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 21:12:06,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2018-09-26 21:12:06,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 21:12:06,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-09-26 21:12:06,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 21:12:06,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-09-26 21:12:06,978 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 28 [2018-09-26 21:12:06,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:06,978 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-09-26 21:12:06,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 21:12:06,978 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-09-26 21:12:06,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-26 21:12:06,979 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:06,980 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1] [2018-09-26 21:12:06,980 INFO L423 AbstractCegarLoop]: === Iteration 8 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:06,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:06,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1979239776, now seen corresponding path program 6 times [2018-09-26 21:12:06,980 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:06,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:06,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:06,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:12:06,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:07,282 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:07,282 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:07,282 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-09-26 21:12:07,290 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:12:07,308 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-26 21:12:07,308 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:12:07,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:07,927 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:07,958 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:07,959 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-09-26 21:12:07,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 21:12:07,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 21:12:07,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=528, Unknown=0, NotChecked=0, Total=756 [2018-09-26 21:12:07,961 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 28 states. [2018-09-26 21:12:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:08,146 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-09-26 21:12:08,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 21:12:08,148 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2018-09-26 21:12:08,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:08,149 INFO L225 Difference]: With dead ends: 45 [2018-09-26 21:12:08,150 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 21:12:08,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=228, Invalid=528, Unknown=0, NotChecked=0, Total=756 [2018-09-26 21:12:08,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 21:12:08,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-09-26 21:12:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 21:12:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-09-26 21:12:08,157 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 33 [2018-09-26 21:12:08,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:08,158 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-09-26 21:12:08,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 21:12:08,158 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-09-26 21:12:08,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 21:12:08,159 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:08,160 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1] [2018-09-26 21:12:08,160 INFO L423 AbstractCegarLoop]: === Iteration 9 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:08,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:08,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1800695700, now seen corresponding path program 7 times [2018-09-26 21:12:08,160 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:08,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:08,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:08,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:12:08,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:08,375 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:08,375 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-09-26 21:12:08,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:08,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:08,968 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:08,988 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:08,988 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-09-26 21:12:08,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 21:12:08,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 21:12:08,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=699, Unknown=0, NotChecked=0, Total=992 [2018-09-26 21:12:08,990 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 32 states. [2018-09-26 21:12:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:09,156 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2018-09-26 21:12:09,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:12:09,157 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2018-09-26 21:12:09,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:09,159 INFO L225 Difference]: With dead ends: 50 [2018-09-26 21:12:09,159 INFO L226 Difference]: Without dead ends: 48 [2018-09-26 21:12:09,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=699, Unknown=0, NotChecked=0, Total=992 [2018-09-26 21:12:09,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-26 21:12:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-09-26 21:12:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-26 21:12:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-09-26 21:12:09,167 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 38 [2018-09-26 21:12:09,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:09,167 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-09-26 21:12:09,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 21:12:09,168 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-09-26 21:12:09,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 21:12:09,169 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:09,169 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1] [2018-09-26 21:12:09,169 INFO L423 AbstractCegarLoop]: === Iteration 10 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:09,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:09,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1430989600, now seen corresponding path program 8 times [2018-09-26 21:12:09,170 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:09,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:09,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:09,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:09,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:09,469 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:09,470 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:09,470 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-09-26 21:12:09,482 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:12:09,505 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:12:09,505 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:12:09,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:10,057 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:10,079 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:10,079 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-09-26 21:12:10,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 21:12:10,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 21:12:10,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=894, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 21:12:10,081 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 36 states. [2018-09-26 21:12:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:10,465 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-09-26 21:12:10,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 21:12:10,466 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-09-26 21:12:10,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:10,467 INFO L225 Difference]: With dead ends: 55 [2018-09-26 21:12:10,467 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 21:12:10,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=366, Invalid=894, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 21:12:10,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 21:12:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-09-26 21:12:10,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 21:12:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2018-09-26 21:12:10,475 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 43 [2018-09-26 21:12:10,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:10,475 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2018-09-26 21:12:10,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 21:12:10,475 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-09-26 21:12:10,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 21:12:10,476 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:10,476 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1] [2018-09-26 21:12:10,477 INFO L423 AbstractCegarLoop]: === Iteration 11 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:10,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:10,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1043842836, now seen corresponding path program 9 times [2018-09-26 21:12:10,477 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:10,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:10,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:10,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:12:10,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:10,821 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:10,822 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-09-26 21:12:10,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:12:10,856 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-26 21:12:10,856 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:12:10,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:12,081 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:12,081 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-09-26 21:12:12,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 21:12:12,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 21:12:12,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=1113, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 21:12:12,083 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 40 states. [2018-09-26 21:12:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:12,329 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-09-26 21:12:12,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 21:12:12,329 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 48 [2018-09-26 21:12:12,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:12,330 INFO L225 Difference]: With dead ends: 60 [2018-09-26 21:12:12,330 INFO L226 Difference]: Without dead ends: 58 [2018-09-26 21:12:12,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=447, Invalid=1113, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 21:12:12,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-26 21:12:12,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-09-26 21:12:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-26 21:12:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-09-26 21:12:12,337 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 48 [2018-09-26 21:12:12,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:12,338 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-09-26 21:12:12,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 21:12:12,338 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-09-26 21:12:12,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-26 21:12:12,339 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:12,339 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1] [2018-09-26 21:12:12,339 INFO L423 AbstractCegarLoop]: === Iteration 12 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:12,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:12,340 INFO L82 PathProgramCache]: Analyzing trace with hash -676496288, now seen corresponding path program 10 times [2018-09-26 21:12:12,340 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:12,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:12,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:12,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:12:12,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:12,779 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:12,779 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-09-26 21:12:12,787 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:12:12,834 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:12:12,835 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:12:12,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:13,526 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:13,526 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-09-26 21:12:13,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 21:12:13,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 21:12:13,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=1356, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 21:12:13,531 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 44 states. [2018-09-26 21:12:13,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:13,837 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2018-09-26 21:12:13,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 21:12:13,838 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 53 [2018-09-26 21:12:13,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:13,839 INFO L225 Difference]: With dead ends: 65 [2018-09-26 21:12:13,839 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 21:12:13,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=536, Invalid=1356, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 21:12:13,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 21:12:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-09-26 21:12:13,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 21:12:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-09-26 21:12:13,846 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 53 [2018-09-26 21:12:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:13,847 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-09-26 21:12:13,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 21:12:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-09-26 21:12:13,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 21:12:13,848 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:13,848 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1] [2018-09-26 21:12:13,848 INFO L423 AbstractCegarLoop]: === Iteration 13 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:13,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:13,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1014218388, now seen corresponding path program 11 times [2018-09-26 21:12:13,849 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:13,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:13,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:13,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:12:13,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-26 21:12:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-26 21:12:13,896 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-09-26 21:12:13,936 INFO L202 PluginConnector]: Adding new model GateControllerIncorrect1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:12:13 BoogieIcfgContainer [2018-09-26 21:12:13,937 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:12:13,938 INFO L168 Benchmark]: Toolchain (without parser) took 13037.75 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 35.1 MB). Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 451.3 MB). Peak memory consumption was 486.5 MB. Max. memory is 7.1 GB. [2018-09-26 21:12:13,939 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-09-26 21:12:13,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:12:13,940 INFO L168 Benchmark]: Boogie Preprocessor took 30.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:12:13,941 INFO L168 Benchmark]: RCFGBuilder took 431.52 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-26 21:12:13,941 INFO L168 Benchmark]: TraceAbstraction took 12524.07 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 35.1 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 430.2 MB). Peak memory consumption was 465.3 MB. Max. memory is 7.1 GB. [2018-09-26 21:12:13,946 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 45.07 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 30.23 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 431.52 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12524.07 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 35.1 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 430.2 MB). Peak memory consumption was 465.3 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, 12.4s OverallTime, 13 OverallIterations, 11 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 125 SDtfs, 630 SDslu, 858 SDs, 0 SdLazy, 903 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 429 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3620 ImplicationChecksByTransitivity, 7.8s 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, 8.8s 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.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-12-13-964.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GateControllerIncorrect1.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-12-13-964.csv Received shutdown request...