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/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 12:16:33,484 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:16:33,486 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:16:33,501 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:16:33,502 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:16:33,503 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:16:33,504 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:16:33,506 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:16:33,508 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:16:33,509 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:16:33,510 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:16:33,510 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:16:33,511 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:16:33,513 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:16:33,514 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:16:33,515 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:16:33,515 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:16:33,517 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:16:33,520 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:16:33,521 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:16:33,523 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:16:33,524 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:16:33,527 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:16:33,527 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:16:33,527 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:16:33,528 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:16:33,529 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:16:33,530 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:16:33,531 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:16:33,532 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:16:33,533 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:16:33,533 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:16:33,534 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:16:33,534 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:16:33,535 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:16:33,536 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:16:33,536 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-02 12:16:33,552 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:16:33,553 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:16:33,553 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:16:33,554 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:16:33,554 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:16:33,558 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:16:33,558 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:16:33,559 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:16:33,560 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:16:33,560 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:16:33,560 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:16:33,560 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:16:33,560 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:16:33,561 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:16:33,561 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:16:33,561 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:16:33,561 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:16:33,561 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:16:33,562 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:16:33,562 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:16:33,562 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:16:33,562 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:16:33,562 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:16:33,564 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:16:33,565 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:16:33,565 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:16:33,565 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:16:33,566 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:16:33,566 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:16:33,566 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:16:33,566 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:16:33,643 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:16:33,661 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:16:33,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:16:33,670 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:16:33,670 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:16:33,671 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl [2018-10-02 12:16:33,671 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl' [2018-10-02 12:16:33,770 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:16:33,774 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:16:33,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:16:33,775 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:16:33,775 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:16:33,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:33" (1/1) ... [2018-10-02 12:16:33,812 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:33" (1/1) ... [2018-10-02 12:16:33,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:16:33,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:16:33,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:16:33,821 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:16:33,832 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:33" (1/1) ... [2018-10-02 12:16:33,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:33" (1/1) ... [2018-10-02 12:16:33,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:33" (1/1) ... [2018-10-02 12:16:33,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:33" (1/1) ... [2018-10-02 12:16:33,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:33" (1/1) ... [2018-10-02 12:16:33,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:33" (1/1) ... [2018-10-02 12:16:33,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:33" (1/1) ... [2018-10-02 12:16:33,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:16:33,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:16:33,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:16:33,858 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:16:33,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:33" (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-02 12:16:33,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 12:16:33,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 12:16:34,683 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 12:16:34,683 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:16:34 BoogieIcfgContainer [2018-10-02 12:16:34,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:16:34,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:16:34,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:16:34,690 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:16:34,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:33" (1/2) ... [2018-10-02 12:16:34,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c5e78d and model type s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:16:34, skipping insertion in model container [2018-10-02 12:16:34,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:16:34" (2/2) ... [2018-10-02 12:16:34,693 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil.c_23.bpl [2018-10-02 12:16:34,702 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:16:34,710 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 12:16:34,755 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:16:34,756 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:16:34,756 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:16:34,756 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:16:34,756 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:16:34,756 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:16:34,757 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:16:34,757 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:16:34,757 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:16:34,770 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-10-02 12:16:34,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 12:16:34,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:34,778 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:34,779 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:34,785 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:34,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1511424245, now seen corresponding path program 1 times [2018-10-02 12:16:34,788 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:34,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:34,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:34,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:34,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:35,018 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-02 12:16:35,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:35,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:35,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:35,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:35,042 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:35,045 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2018-10-02 12:16:35,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:35,889 INFO L93 Difference]: Finished difference Result 60 states and 100 transitions. [2018-10-02 12:16:35,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:35,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-02 12:16:35,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:35,905 INFO L225 Difference]: With dead ends: 60 [2018-10-02 12:16:35,906 INFO L226 Difference]: Without dead ends: 36 [2018-10-02 12:16:35,909 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 [2018-10-02 12:16:35,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-02 12:16:35,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-02 12:16:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-02 12:16:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 60 transitions. [2018-10-02 12:16:35,954 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 60 transitions. Word has length 16 [2018-10-02 12:16:35,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:35,955 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 60 transitions. [2018-10-02 12:16:35,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 60 transitions. [2018-10-02 12:16:35,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-02 12:16:35,956 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:35,956 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:35,957 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:35,957 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:35,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1787958207, now seen corresponding path program 1 times [2018-10-02 12:16:35,958 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:35,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:35,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:35,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:35,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:36,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:16:36,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:36,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:36,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:36,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:36,047 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:36,047 INFO L87 Difference]: Start difference. First operand 36 states and 60 transitions. Second operand 3 states. [2018-10-02 12:16:36,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:36,516 INFO L93 Difference]: Finished difference Result 87 states and 147 transitions. [2018-10-02 12:16:36,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:36,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-02 12:16:36,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:36,519 INFO L225 Difference]: With dead ends: 87 [2018-10-02 12:16:36,520 INFO L226 Difference]: Without dead ends: 52 [2018-10-02 12:16:36,521 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 [2018-10-02 12:16:36,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-02 12:16:36,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-10-02 12:16:36,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-02 12:16:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 86 transitions. [2018-10-02 12:16:36,536 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 86 transitions. Word has length 24 [2018-10-02 12:16:36,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:36,536 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 86 transitions. [2018-10-02 12:16:36,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:36,536 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 86 transitions. [2018-10-02 12:16:36,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-02 12:16:36,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:36,538 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:36,538 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:36,538 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:36,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1179694243, now seen corresponding path program 1 times [2018-10-02 12:16:36,539 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:36,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:36,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:36,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:36,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:36,627 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-02 12:16:36,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:36,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:36,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:36,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:36,628 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:36,629 INFO L87 Difference]: Start difference. First operand 52 states and 86 transitions. Second operand 3 states. [2018-10-02 12:16:37,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:37,217 INFO L93 Difference]: Finished difference Result 110 states and 183 transitions. [2018-10-02 12:16:37,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:37,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-02 12:16:37,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:37,221 INFO L225 Difference]: With dead ends: 110 [2018-10-02 12:16:37,221 INFO L226 Difference]: Without dead ends: 59 [2018-10-02 12:16:37,222 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 [2018-10-02 12:16:37,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-02 12:16:37,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-02 12:16:37,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-02 12:16:37,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 95 transitions. [2018-10-02 12:16:37,243 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 95 transitions. Word has length 31 [2018-10-02 12:16:37,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:37,243 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 95 transitions. [2018-10-02 12:16:37,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:37,245 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 95 transitions. [2018-10-02 12:16:37,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-02 12:16:37,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:37,247 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:37,248 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:37,248 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:37,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1680558917, now seen corresponding path program 1 times [2018-10-02 12:16:37,248 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:37,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:37,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:37,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:37,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:37,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:16:37,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:37,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:37,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:37,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:37,375 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:37,375 INFO L87 Difference]: Start difference. First operand 59 states and 95 transitions. Second operand 3 states. [2018-10-02 12:16:37,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:37,717 INFO L93 Difference]: Finished difference Result 135 states and 220 transitions. [2018-10-02 12:16:37,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:37,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-02 12:16:37,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:37,721 INFO L225 Difference]: With dead ends: 135 [2018-10-02 12:16:37,721 INFO L226 Difference]: Without dead ends: 76 [2018-10-02 12:16:37,722 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 [2018-10-02 12:16:37,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-02 12:16:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-02 12:16:37,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-02 12:16:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 123 transitions. [2018-10-02 12:16:37,737 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 123 transitions. Word has length 31 [2018-10-02 12:16:37,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:37,737 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 123 transitions. [2018-10-02 12:16:37,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 123 transitions. [2018-10-02 12:16:37,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-02 12:16:37,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:37,739 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:37,740 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:37,740 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:37,740 INFO L82 PathProgramCache]: Analyzing trace with hash -2026096289, now seen corresponding path program 1 times [2018-10-02 12:16:37,740 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:37,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:37,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:37,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:37,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-02 12:16:37,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:37,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:37,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:37,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:37,802 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:37,802 INFO L87 Difference]: Start difference. First operand 76 states and 123 transitions. Second operand 3 states. [2018-10-02 12:16:38,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:38,092 INFO L93 Difference]: Finished difference Result 157 states and 255 transitions. [2018-10-02 12:16:38,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:38,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-02 12:16:38,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:38,093 INFO L225 Difference]: With dead ends: 157 [2018-10-02 12:16:38,094 INFO L226 Difference]: Without dead ends: 82 [2018-10-02 12:16:38,095 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 [2018-10-02 12:16:38,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-02 12:16:38,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-10-02 12:16:38,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-02 12:16:38,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 128 transitions. [2018-10-02 12:16:38,111 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 128 transitions. Word has length 37 [2018-10-02 12:16:38,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:38,111 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 128 transitions. [2018-10-02 12:16:38,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:38,112 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 128 transitions. [2018-10-02 12:16:38,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-02 12:16:38,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:38,114 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:38,114 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:38,114 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:38,114 INFO L82 PathProgramCache]: Analyzing trace with hash -865281023, now seen corresponding path program 1 times [2018-10-02 12:16:38,114 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:38,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:38,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:38,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:38,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-02 12:16:38,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:38,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:38,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:38,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:38,180 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:38,180 INFO L87 Difference]: Start difference. First operand 82 states and 128 transitions. Second operand 3 states. [2018-10-02 12:16:38,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:38,453 INFO L93 Difference]: Finished difference Result 168 states and 263 transitions. [2018-10-02 12:16:38,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:38,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-02 12:16:38,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:38,456 INFO L225 Difference]: With dead ends: 168 [2018-10-02 12:16:38,456 INFO L226 Difference]: Without dead ends: 87 [2018-10-02 12:16:38,457 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 [2018-10-02 12:16:38,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-02 12:16:38,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-10-02 12:16:38,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-02 12:16:38,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2018-10-02 12:16:38,473 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 130 transitions. Word has length 42 [2018-10-02 12:16:38,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:38,473 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 130 transitions. [2018-10-02 12:16:38,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 130 transitions. [2018-10-02 12:16:38,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-02 12:16:38,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:38,475 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:38,476 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:38,476 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:38,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1951176091, now seen corresponding path program 1 times [2018-10-02 12:16:38,476 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:38,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:38,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:38,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:38,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:38,543 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-02 12:16:38,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:38,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:38,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:38,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:38,544 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:38,544 INFO L87 Difference]: Start difference. First operand 87 states and 130 transitions. Second operand 3 states. [2018-10-02 12:16:38,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:38,800 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2018-10-02 12:16:38,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:38,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-02 12:16:38,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:38,802 INFO L225 Difference]: With dead ends: 185 [2018-10-02 12:16:38,802 INFO L226 Difference]: Without dead ends: 98 [2018-10-02 12:16:38,803 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 [2018-10-02 12:16:38,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-02 12:16:38,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-10-02 12:16:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-02 12:16:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2018-10-02 12:16:38,821 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 45 [2018-10-02 12:16:38,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:38,821 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2018-10-02 12:16:38,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2018-10-02 12:16:38,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-02 12:16:38,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:38,824 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:38,824 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:38,824 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:38,824 INFO L82 PathProgramCache]: Analyzing trace with hash 2094171455, now seen corresponding path program 1 times [2018-10-02 12:16:38,825 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:38,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:38,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:38,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:38,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:38,898 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-02 12:16:38,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:38,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:38,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:38,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:38,900 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:38,900 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand 3 states. [2018-10-02 12:16:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:39,336 INFO L93 Difference]: Finished difference Result 285 states and 418 transitions. [2018-10-02 12:16:39,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:39,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-10-02 12:16:39,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:39,340 INFO L225 Difference]: With dead ends: 285 [2018-10-02 12:16:39,341 INFO L226 Difference]: Without dead ends: 188 [2018-10-02 12:16:39,341 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 [2018-10-02 12:16:39,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-02 12:16:39,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-10-02 12:16:39,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-02 12:16:39,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2018-10-02 12:16:39,371 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 46 [2018-10-02 12:16:39,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:39,372 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2018-10-02 12:16:39,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2018-10-02 12:16:39,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-02 12:16:39,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:39,374 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:39,374 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:39,375 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:39,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1814017687, now seen corresponding path program 1 times [2018-10-02 12:16:39,375 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:39,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:39,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:39,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:39,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:39,545 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-02 12:16:39,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:16:39,546 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-02 12:16:39,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:39,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:16:40,004 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-02 12:16:40,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 12:16:40,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-02 12:16:40,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 12:16:40,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 12:16:40,028 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:40,029 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand 5 states. [2018-10-02 12:16:43,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:43,056 INFO L93 Difference]: Finished difference Result 695 states and 974 transitions. [2018-10-02 12:16:43,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-02 12:16:43,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-10-02 12:16:43,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:43,059 INFO L225 Difference]: With dead ends: 695 [2018-10-02 12:16:43,059 INFO L226 Difference]: Without dead ends: 486 [2018-10-02 12:16:43,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime [2018-10-02 12:16:43,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-10-02 12:16:43,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 280. [2018-10-02 12:16:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-02 12:16:43,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 381 transitions. [2018-10-02 12:16:43,105 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 381 transitions. Word has length 49 [2018-10-02 12:16:43,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:43,106 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 381 transitions. [2018-10-02 12:16:43,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 12:16:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 381 transitions. [2018-10-02 12:16:43,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-02 12:16:43,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:43,108 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:43,109 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:43,109 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:43,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1561426047, now seen corresponding path program 1 times [2018-10-02 12:16:43,109 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:43,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:43,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:43,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:43,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-02 12:16:43,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:43,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:43,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:43,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:43,188 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:43,188 INFO L87 Difference]: Start difference. First operand 280 states and 381 transitions. Second operand 3 states. [2018-10-02 12:16:43,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:43,519 INFO L93 Difference]: Finished difference Result 466 states and 642 transitions. [2018-10-02 12:16:43,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:43,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-10-02 12:16:43,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:43,526 INFO L225 Difference]: With dead ends: 466 [2018-10-02 12:16:43,526 INFO L226 Difference]: Without dead ends: 279 [2018-10-02 12:16:43,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:43,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-02 12:16:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-10-02 12:16:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-02 12:16:43,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 378 transitions. [2018-10-02 12:16:43,563 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 378 transitions. Word has length 68 [2018-10-02 12:16:43,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:43,563 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 378 transitions. [2018-10-02 12:16:43,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 378 transitions. [2018-10-02 12:16:43,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-02 12:16:43,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:43,565 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:43,565 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:43,565 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:43,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1819686273, now seen corresponding path program 1 times [2018-10-02 12:16:43,565 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:43,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:43,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:43,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:43,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-10-02 12:16:43,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:43,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:43,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:43,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:43,637 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:43,637 INFO L87 Difference]: Start difference. First operand 279 states and 378 transitions. Second operand 3 states. [2018-10-02 12:16:44,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:44,301 INFO L93 Difference]: Finished difference Result 464 states and 636 transitions. [2018-10-02 12:16:44,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:44,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-10-02 12:16:44,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:44,311 INFO L225 Difference]: With dead ends: 464 [2018-10-02 12:16:44,312 INFO L226 Difference]: Without dead ends: 278 [2018-10-02 12:16:44,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:44,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-02 12:16:44,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-10-02 12:16:44,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-02 12:16:44,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 374 transitions. [2018-10-02 12:16:44,357 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 374 transitions. Word has length 72 [2018-10-02 12:16:44,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:44,357 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 374 transitions. [2018-10-02 12:16:44,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:44,358 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 374 transitions. [2018-10-02 12:16:44,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-02 12:16:44,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:44,359 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:44,359 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:44,360 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:44,360 INFO L82 PathProgramCache]: Analyzing trace with hash 642028047, now seen corresponding path program 1 times [2018-10-02 12:16:44,360 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:44,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:44,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:44,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:44,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-02 12:16:44,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:44,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:44,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:44,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:44,465 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:44,465 INFO L87 Difference]: Start difference. First operand 278 states and 374 transitions. Second operand 3 states. [2018-10-02 12:16:44,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:44,894 INFO L93 Difference]: Finished difference Result 548 states and 739 transitions. [2018-10-02 12:16:44,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:44,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-10-02 12:16:44,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:44,897 INFO L225 Difference]: With dead ends: 548 [2018-10-02 12:16:44,898 INFO L226 Difference]: Without dead ends: 276 [2018-10-02 12:16:44,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:44,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-02 12:16:44,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2018-10-02 12:16:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-02 12:16:44,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 364 transitions. [2018-10-02 12:16:44,930 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 364 transitions. Word has length 77 [2018-10-02 12:16:44,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:44,931 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 364 transitions. [2018-10-02 12:16:44,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:44,931 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 364 transitions. [2018-10-02 12:16:44,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-02 12:16:44,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:44,932 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:44,932 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:44,933 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:44,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1765416395, now seen corresponding path program 1 times [2018-10-02 12:16:44,933 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:44,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:44,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:44,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:44,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:45,004 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-02 12:16:45,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:45,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:45,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:45,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:45,006 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:45,006 INFO L87 Difference]: Start difference. First operand 276 states and 364 transitions. Second operand 3 states. [2018-10-02 12:16:46,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:46,062 INFO L93 Difference]: Finished difference Result 543 states and 718 transitions. [2018-10-02 12:16:46,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:46,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-10-02 12:16:46,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:46,067 INFO L225 Difference]: With dead ends: 543 [2018-10-02 12:16:46,067 INFO L226 Difference]: Without dead ends: 274 [2018-10-02 12:16:46,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:46,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-02 12:16:46,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-10-02 12:16:46,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-02 12:16:46,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 354 transitions. [2018-10-02 12:16:46,099 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 354 transitions. Word has length 83 [2018-10-02 12:16:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:46,100 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 354 transitions. [2018-10-02 12:16:46,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:46,100 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 354 transitions. [2018-10-02 12:16:46,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-02 12:16:46,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:46,101 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:46,102 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:46,102 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:46,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1105856767, now seen corresponding path program 1 times [2018-10-02 12:16:46,102 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:46,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:46,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:46,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:46,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-10-02 12:16:46,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:46,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:46,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:46,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:46,184 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:46,184 INFO L87 Difference]: Start difference. First operand 274 states and 354 transitions. Second operand 3 states. [2018-10-02 12:16:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:46,439 INFO L93 Difference]: Finished difference Result 543 states and 705 transitions. [2018-10-02 12:16:46,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:46,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-10-02 12:16:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:46,443 INFO L225 Difference]: With dead ends: 543 [2018-10-02 12:16:46,443 INFO L226 Difference]: Without dead ends: 277 [2018-10-02 12:16:46,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-02 12:16:46,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-10-02 12:16:46,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-02 12:16:46,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 352 transitions. [2018-10-02 12:16:46,475 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 352 transitions. Word has length 90 [2018-10-02 12:16:46,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:46,476 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 352 transitions. [2018-10-02 12:16:46,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:46,476 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 352 transitions. [2018-10-02 12:16:46,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-02 12:16:46,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:46,477 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:46,477 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:46,477 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:46,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1448402059, now seen corresponding path program 1 times [2018-10-02 12:16:46,478 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:46,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:46,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:46,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:46,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-02 12:16:46,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:46,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:46,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:46,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:46,596 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:46,597 INFO L87 Difference]: Start difference. First operand 277 states and 352 transitions. Second operand 3 states. [2018-10-02 12:16:46,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:46,830 INFO L93 Difference]: Finished difference Result 576 states and 736 transitions. [2018-10-02 12:16:46,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:46,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-10-02 12:16:46,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:46,832 INFO L225 Difference]: With dead ends: 576 [2018-10-02 12:16:46,832 INFO L226 Difference]: Without dead ends: 307 [2018-10-02 12:16:46,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:46,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-02 12:16:46,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-10-02 12:16:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-02 12:16:46,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 382 transitions. [2018-10-02 12:16:46,871 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 382 transitions. Word has length 98 [2018-10-02 12:16:46,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:46,872 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 382 transitions. [2018-10-02 12:16:46,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:46,872 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 382 transitions. [2018-10-02 12:16:46,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-02 12:16:46,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:46,874 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:46,874 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:46,874 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:46,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1388837957, now seen corresponding path program 1 times [2018-10-02 12:16:46,875 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:46,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:46,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:46,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:46,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:46,997 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-10-02 12:16:46,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:46,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:46,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:46,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:46,998 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:46,998 INFO L87 Difference]: Start difference. First operand 307 states and 382 transitions. Second operand 3 states. [2018-10-02 12:16:47,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:47,258 INFO L93 Difference]: Finished difference Result 606 states and 764 transitions. [2018-10-02 12:16:47,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:47,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-10-02 12:16:47,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:47,260 INFO L225 Difference]: With dead ends: 606 [2018-10-02 12:16:47,260 INFO L226 Difference]: Without dead ends: 403 [2018-10-02 12:16:47,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:47,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-02 12:16:47,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-10-02 12:16:47,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-02 12:16:47,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 505 transitions. [2018-10-02 12:16:47,298 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 505 transitions. Word has length 108 [2018-10-02 12:16:47,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:47,298 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 505 transitions. [2018-10-02 12:16:47,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:47,299 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 505 transitions. [2018-10-02 12:16:47,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-02 12:16:47,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:47,301 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 12, 11, 10, 9, 8, 7, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:47,301 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:47,301 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:47,301 INFO L82 PathProgramCache]: Analyzing trace with hash 816352441, now seen corresponding path program 1 times [2018-10-02 12:16:47,301 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:47,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:47,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:47,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:47,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-10-02 12:16:47,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:47,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:47,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:47,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:47,439 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:47,440 INFO L87 Difference]: Start difference. First operand 403 states and 505 transitions. Second operand 3 states. [2018-10-02 12:16:48,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:48,105 INFO L93 Difference]: Finished difference Result 798 states and 1001 transitions. [2018-10-02 12:16:48,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:48,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-10-02 12:16:48,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:48,108 INFO L225 Difference]: With dead ends: 798 [2018-10-02 12:16:48,108 INFO L226 Difference]: Without dead ends: 403 [2018-10-02 12:16:48,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-02 12:16:48,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-10-02 12:16:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-02 12:16:48,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 486 transitions. [2018-10-02 12:16:48,162 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 486 transitions. Word has length 148 [2018-10-02 12:16:48,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:48,162 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 486 transitions. [2018-10-02 12:16:48,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:48,162 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 486 transitions. [2018-10-02 12:16:48,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-02 12:16:48,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:48,165 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 14, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:48,166 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:48,166 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:48,166 INFO L82 PathProgramCache]: Analyzing trace with hash 155947305, now seen corresponding path program 1 times [2018-10-02 12:16:48,166 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:48,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:48,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:48,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:48,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:48,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 741 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-10-02 12:16:48,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:16:48,464 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:16:48,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:48,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:16:48,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2018-10-02 12:16:48,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 12:16:48,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-02 12:16:48,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 12:16:48,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 12:16:48,982 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:48,982 INFO L87 Difference]: Start difference. First operand 403 states and 486 transitions. Second operand 5 states. [2018-10-02 12:16:49,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:49,271 INFO L93 Difference]: Finished difference Result 643 states and 775 transitions. [2018-10-02 12:16:49,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 12:16:49,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2018-10-02 12:16:49,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:49,272 INFO L225 Difference]: With dead ends: 643 [2018-10-02 12:16:49,272 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 12:16:49,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime [2018-10-02 12:16:49,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 12:16:49,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 12:16:49,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 12:16:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 12:16:49,276 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 191 [2018-10-02 12:16:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:49,276 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 12:16:49,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 12:16:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 12:16:49,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 12:16:49,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 12:16:49,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:49,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:50,661 WARN L178 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-02 12:16:51,176 WARN L178 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-02 12:16:51,336 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-02 12:16:51,514 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-10-02 12:16:51,682 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-02 12:16:51,837 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-02 12:16:52,640 WARN L178 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2018-10-02 12:16:52,884 WARN L178 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-10-02 12:16:53,129 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2018-10-02 12:16:53,297 WARN L178 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2018-10-02 12:16:53,694 WARN L178 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-10-02 12:16:53,918 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2018-10-02 12:16:54,143 WARN L178 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-02 12:16:54,173 INFO L421 ceAbstractionStarter]: At program point L444(lines 441 466) the Hoare annotation is: (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-10-02 12:16:54,173 INFO L421 ceAbstractionStarter]: At program point L337(lines 337 355) the Hoare annotation is: (let ((.cse1 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse1 .cse2 .cse3) (and .cse4 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse1 .cse2 .cse3) (and .cse4 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-10-02 12:16:54,173 INFO L421 ceAbstractionStarter]: At program point L465(lines 465 487) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-10-02 12:16:54,174 INFO L421 ceAbstractionStarter]: At program point L457(lines 457 478) the Hoare annotation is: (and (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-10-02 12:16:54,174 INFO L421 ceAbstractionStarter]: At program point L511(lines 511 515) the Hoare annotation is: false [2018-10-02 12:16:54,174 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 517) no Hoare annotation was computed. [2018-10-02 12:16:54,174 INFO L421 ceAbstractionStarter]: At program point L317(lines 317 334) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse1 .cse2) (and .cse3 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse1 .cse2) (and .cse3 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-10-02 12:16:54,174 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 517) no Hoare annotation was computed. [2018-10-02 12:16:54,175 INFO L421 ceAbstractionStarter]: At program point L408(lines 408 420) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576) .cse1 .cse2 .cse3) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-10-02 12:16:54,175 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 517) no Hoare annotation was computed. [2018-10-02 12:16:54,175 INFO L421 ceAbstractionStarter]: At program point L285(lines 248 285) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-10-02 12:16:54,175 INFO L421 ceAbstractionStarter]: At program point L281(lines 281 300) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-10-02 12:16:54,175 INFO L421 ceAbstractionStarter]: At program point L393(lines 393 405) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576) .cse1 .cse2 .cse3) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-10-02 12:16:54,176 INFO L421 ceAbstractionStarter]: At program point L360(lines 360 371) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (.cse2 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse5 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2 .cse3 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2 .cse3 .cse4 .cse5))) [2018-10-02 12:16:54,176 INFO L421 ceAbstractionStarter]: At program point L261(lines 261 277) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-10-02 12:16:54,176 INFO L421 ceAbstractionStarter]: At program point L480(lines 477 490) the Hoare annotation is: (and (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-10-02 12:16:54,176 INFO L421 ceAbstractionStarter]: At program point L505(lines 276 505) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-10-02 12:16:54,176 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 516) no Hoare annotation was computed. [2018-10-02 12:16:54,177 INFO L421 ceAbstractionStarter]: At program point L373(lines 373 390) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)))) [2018-10-02 12:16:54,177 INFO L421 ceAbstractionStarter]: At program point L435(lines 435 458) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (and .cse0 .cse1 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6))))) [2018-10-02 12:16:54,177 INFO L421 ceAbstractionStarter]: At program point L303(lines 303 314) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-10-02 12:16:54,177 INFO L421 ceAbstractionStarter]: At program point L431(lines 431 442) the Hoare annotation is: (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-10-02 12:16:54,177 INFO L421 ceAbstractionStarter]: At program point L489(lines 489 512) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-10-02 12:16:54,177 INFO L421 ceAbstractionStarter]: At program point L423(lines 423 432) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0 .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse3) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-10-02 12:16:54,178 INFO L421 ceAbstractionStarter]: At program point L514(lines 486 514) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-10-02 12:16:54,197 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:16:54 BoogieIcfgContainer [2018-10-02 12:16:54,197 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:16:54,198 INFO L168 Benchmark]: Toolchain (without parser) took 20427.10 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 127.4 MB). Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 428.8 MB). Peak memory consumption was 556.2 MB. Max. memory is 7.1 GB. [2018-10-02 12:16:54,199 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-02 12:16:54,200 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:16:54,201 INFO L168 Benchmark]: Boogie Preprocessor took 36.53 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-02 12:16:54,201 INFO L168 Benchmark]: RCFGBuilder took 827.48 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-02 12:16:54,202 INFO L168 Benchmark]: TraceAbstraction took 19511.32 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 127.4 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 397.1 MB). Peak memory consumption was 524.5 MB. Max. memory is 7.1 GB. [2018-10-02 12:16:54,207 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.53 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 827.48 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19511.32 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 127.4 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 397.1 MB). Peak memory consumption was 524.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 516]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8448 == ssl3_accept_~s__state~6)) && ssl3_accept_~s__state~6 <= 8576) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6)) || (8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3)) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 477]: Loop Invariant Derived loop invariant: (((((!(8640 == ssl3_accept_~s__state~6) && !(8448 == ssl3_accept_~s__state~6)) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 3) && !(8512 == ssl3_accept_~s__state~6) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8448 == ssl3_accept_~s__state~6)) && ssl3_accept_~s__state~6 <= 8576) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6)) || (8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3)) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((!(8640 == ssl3_accept_~s__state~6) && !(8448 == ssl3_accept_~s__state~6)) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6) - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2)) || (((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && !(8656 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || ((!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 423]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((((((!(8640 == ssl3_accept_~s__state~6) && !(8448 == ssl3_accept_~s__state~6)) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && !(8656 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6))) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 441]: Loop Invariant Derived loop invariant: (((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8656 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6) - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (((!(8448 == ssl3_accept_~s__state~6) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: (((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8656 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. SAFE Result, 19.4s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 10.8s AutomataDifference, 0.0s DeadEndRemovalTime, 4.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 507 SDtfs, 212 SDslu, 262 SDs, 0 SdLazy, 683 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=16, 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.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 206 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 21 PreInvPairs, 292 NumberOfFragments, 760 HoareAnnotationTreeSize, 21 FomulaSimplifications, 12583 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 21 FomulaSimplificationsInter, 2497 FormulaSimplificationTreeSizeReductionInter, 4.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1496 NumberOfCodeBlocks, 1496 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1476 ConstructedInterpolants, 0 QuantifiedInterpolants, 201255 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1211 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 20 InterpolantComputations, 18 PerfectInterpolantSequences, 5308/5324 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.cil.c_23.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_12-16-54-225.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.cil.c_23.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_12-16-54-225.csv Received shutdown request...