java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_2.cil.c_16.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:22:15,084 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:22:15,086 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:22:15,097 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:22:15,098 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:22:15,099 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:22:15,100 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:22:15,102 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:22:15,103 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:22:15,104 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:22:15,105 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:22:15,105 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:22:15,106 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:22:15,107 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:22:15,108 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:22:15,109 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:22:15,110 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:22:15,112 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:22:15,114 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:22:15,115 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:22:15,116 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:22:15,117 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:22:15,120 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:22:15,120 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:22:15,120 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:22:15,121 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:22:15,126 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:22:15,127 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:22:15,128 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:22:15,131 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:22:15,131 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:22:15,132 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:22:15,132 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:22:15,133 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:22:15,134 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:22:15,137 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:22:15,137 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 09:22:15,162 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:22:15,163 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:22:15,163 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:22:15,164 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:22:15,164 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:22:15,164 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:22:15,165 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:22:15,165 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:22:15,165 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:22:15,165 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:22:15,165 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:22:15,166 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:22:15,166 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:22:15,166 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:22:15,166 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:22:15,166 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:22:15,167 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:22:15,167 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:22:15,167 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:22:15,167 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:22:15,167 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:22:15,167 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:22:15,168 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:22:15,168 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:22:15,168 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:22:15,168 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:22:15,168 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:22:15,169 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:22:15,169 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:22:15,169 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:22:15,232 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:22:15,246 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:22:15,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:22:15,255 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:22:15,255 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:22:15,256 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_2.cil.c_16.bpl [2018-10-04 09:22:15,256 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_2.cil.c_16.bpl' [2018-10-04 09:22:15,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:22:15,355 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:22:15,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:22:15,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:22:15,357 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:22:15,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:15" (1/1) ... [2018-10-04 09:22:15,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:15" (1/1) ... [2018-10-04 09:22:15,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:22:15,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:22:15,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:22:15,410 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:22:15,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:15" (1/1) ... [2018-10-04 09:22:15,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:15" (1/1) ... [2018-10-04 09:22:15,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:15" (1/1) ... [2018-10-04 09:22:15,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:15" (1/1) ... [2018-10-04 09:22:15,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:15" (1/1) ... [2018-10-04 09:22:15,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:15" (1/1) ... [2018-10-04 09:22:15,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:15" (1/1) ... [2018-10-04 09:22:15,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:22:15,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:22:15,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:22:15,461 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:22:15,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:22:15,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:22:15,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:22:16,038 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:22:16,039 INFO L202 PluginConnector]: Adding new model s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:22:16 BoogieIcfgContainer [2018-10-04 09:22:16,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:22:16,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:22:16,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:22:16,043 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:22:16,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:15" (1/2) ... [2018-10-04 09:22:16,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c916996 and model type s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:22:16, skipping insertion in model container [2018-10-04 09:22:16,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:22:16" (2/2) ... [2018-10-04 09:22:16,047 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil.c_16.bpl [2018-10-04 09:22:16,056 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:22:16,064 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:22:16,113 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:22:16,114 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:22:16,114 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:22:16,115 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:22:16,115 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:22:16,115 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:22:16,115 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:22:16,115 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:22:16,116 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:22:16,131 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-10-04 09:22:16,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:22:16,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:16,138 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:16,139 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:16,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:16,145 INFO L82 PathProgramCache]: Analyzing trace with hash 212232665, now seen corresponding path program 1 times [2018-10-04 09:22:16,148 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:16,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:16,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:16,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:16,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:22:16,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:16,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:22:16,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:16,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:16,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:16,390 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2018-10-04 09:22:16,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:16,522 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2018-10-04 09:22:16,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:16,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-10-04 09:22:16,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:16,537 INFO L225 Difference]: With dead ends: 31 [2018-10-04 09:22:16,537 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 09:22:16,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:16,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 09:22:16,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-04 09:22:16,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 09:22:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 09:22:16,581 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 8 [2018-10-04 09:22:16,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:16,582 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 09:22:16,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:16,582 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 09:22:16,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:22:16,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:16,583 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:16,583 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:16,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:16,584 INFO L82 PathProgramCache]: Analyzing trace with hash -250815183, now seen corresponding path program 1 times [2018-10-04 09:22:16,584 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:16,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:16,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:16,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:16,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:22:16,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:16,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:16,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:16,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:16,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:16,698 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 3 states. [2018-10-04 09:22:16,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:16,857 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2018-10-04 09:22:16,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:16,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-10-04 09:22:16,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:16,858 INFO L225 Difference]: With dead ends: 33 [2018-10-04 09:22:16,858 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 09:22:16,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:16,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 09:22:16,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-04 09:22:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:22:16,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-10-04 09:22:16,865 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 11 [2018-10-04 09:22:16,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:16,866 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-10-04 09:22:16,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:16,866 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2018-10-04 09:22:16,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:22:16,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:16,867 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:16,867 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:16,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:16,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1316450759, now seen corresponding path program 1 times [2018-10-04 09:22:16,868 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:16,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:16,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:16,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:16,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:17,008 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 09:22:17,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:17,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:17,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:17,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:17,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:17,011 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 3 states. [2018-10-04 09:22:17,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:17,101 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2018-10-04 09:22:17,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:17,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-04 09:22:17,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:17,103 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:22:17,103 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 09:22:17,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:17,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 09:22:17,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-04 09:22:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:22:17,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-10-04 09:22:17,110 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2018-10-04 09:22:17,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:17,110 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-10-04 09:22:17,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:17,111 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2018-10-04 09:22:17,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 09:22:17,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:17,112 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:17,112 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:17,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:17,113 INFO L82 PathProgramCache]: Analyzing trace with hash 494540425, now seen corresponding path program 1 times [2018-10-04 09:22:17,113 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:17,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:17,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:17,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:17,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:17,251 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-04 09:22:17,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:17,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:17,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:17,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:17,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:17,256 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 3 states. [2018-10-04 09:22:17,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:17,432 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2018-10-04 09:22:17,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:17,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-04 09:22:17,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:17,434 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:22:17,435 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:22:17,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:17,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:22:17,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-10-04 09:22:17,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-04 09:22:17,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2018-10-04 09:22:17,454 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 25 [2018-10-04 09:22:17,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:17,457 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2018-10-04 09:22:17,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:17,457 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2018-10-04 09:22:17,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 09:22:17,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:17,459 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:17,459 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:17,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:17,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1892631291, now seen corresponding path program 1 times [2018-10-04 09:22:17,460 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:17,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:17,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:17,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:17,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 09:22:17,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:17,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:17,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:17,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:17,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:17,579 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 3 states. [2018-10-04 09:22:17,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:17,652 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2018-10-04 09:22:17,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:17,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-04 09:22:17,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:17,654 INFO L225 Difference]: With dead ends: 82 [2018-10-04 09:22:17,654 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:22:17,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:17,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:22:17,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 09:22:17,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 09:22:17,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2018-10-04 09:22:17,667 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 25 [2018-10-04 09:22:17,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:17,667 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2018-10-04 09:22:17,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:17,668 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2018-10-04 09:22:17,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 09:22:17,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:17,669 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:17,669 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:17,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:17,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1225606051, now seen corresponding path program 1 times [2018-10-04 09:22:17,670 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:17,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:17,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:17,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:17,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-04 09:22:17,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:17,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:17,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:17,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:17,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:17,773 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand 3 states. [2018-10-04 09:22:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:17,899 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2018-10-04 09:22:17,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:17,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-10-04 09:22:17,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:17,901 INFO L225 Difference]: With dead ends: 95 [2018-10-04 09:22:17,902 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:22:17,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:17,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:22:17,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-04 09:22:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-04 09:22:17,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2018-10-04 09:22:17,912 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 39 [2018-10-04 09:22:17,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:17,912 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2018-10-04 09:22:17,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:17,913 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2018-10-04 09:22:17,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 09:22:17,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:17,914 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:17,914 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:17,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:17,915 INFO L82 PathProgramCache]: Analyzing trace with hash -2017163281, now seen corresponding path program 1 times [2018-10-04 09:22:17,915 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:17,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:17,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:17,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:17,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:18,006 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-04 09:22:18,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:18,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:18,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:18,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:18,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:18,010 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 3 states. [2018-10-04 09:22:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:18,226 INFO L93 Difference]: Finished difference Result 119 states and 149 transitions. [2018-10-04 09:22:18,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:18,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-10-04 09:22:18,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:18,228 INFO L225 Difference]: With dead ends: 119 [2018-10-04 09:22:18,229 INFO L226 Difference]: Without dead ends: 65 [2018-10-04 09:22:18,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:18,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-04 09:22:18,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-10-04 09:22:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-04 09:22:18,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2018-10-04 09:22:18,241 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 46 [2018-10-04 09:22:18,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:18,241 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2018-10-04 09:22:18,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:18,242 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2018-10-04 09:22:18,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-04 09:22:18,243 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:18,243 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:18,244 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:18,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:18,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1034165711, now seen corresponding path program 1 times [2018-10-04 09:22:18,244 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:18,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:18,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:18,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:18,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:18,369 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 89 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-04 09:22:18,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:22:18,369 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) [2018-10-04 09:22:18,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:22:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:18,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 89 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-04 09:22:18,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:22:18,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 09:22:18,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:22:18,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:22:18,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:22:18,554 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 4 states. [2018-10-04 09:22:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:18,981 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2018-10-04 09:22:18,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:22:18,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-10-04 09:22:18,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:18,983 INFO L225 Difference]: With dead ends: 106 [2018-10-04 09:22:18,983 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:22:18,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:22:18,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:22:18,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:22:18,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:22:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:22:18,986 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2018-10-04 09:22:18,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:18,987 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:22:18,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:22:18,987 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:22:18,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:22:18,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:22:19,549 WARN L178 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2018-10-04 09:22:19,920 WARN L178 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 18 [2018-10-04 09:22:20,130 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2018-10-04 09:22:20,324 INFO L421 ceAbstractionStarter]: At program point L271(lines 271 287) the Hoare annotation is: (let ((.cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8464)) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8448)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse1 .cse0 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 1) (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)))) [2018-10-04 09:22:20,324 INFO L421 ceAbstractionStarter]: At program point L383(lines 383 398) the Hoare annotation is: false [2018-10-04 09:22:20,324 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 400) no Hoare annotation was computed. [2018-10-04 09:22:20,325 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 400) no Hoare annotation was computed. [2018-10-04 09:22:20,325 INFO L421 ceAbstractionStarter]: At program point L326(lines 321 345) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) [2018-10-04 09:22:20,325 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 400) no Hoare annotation was computed. [2018-10-04 09:22:20,325 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 399) no Hoare annotation was computed. [2018-10-04 09:22:20,325 INFO L421 ceAbstractionStarter]: At program point L368(lines 368 384) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) [2018-10-04 09:22:20,326 INFO L421 ceAbstractionStarter]: At program point L397(lines 286 397) the Hoare annotation is: (let ((.cse0 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8448)) (and .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse0 .cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 1) (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)))) [2018-10-04 09:22:20,326 INFO L421 ceAbstractionStarter]: At program point L360(lines 360 375) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) [2018-10-04 09:22:20,326 INFO L421 ceAbstractionStarter]: At program point L315(lines 315 334) the Hoare annotation is: (let ((.cse0 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8448)) (and .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse0 .cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-04 09:22:20,326 INFO L421 ceAbstractionStarter]: At program point L377(lines 374 392) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) [2018-10-04 09:22:20,327 INFO L421 ceAbstractionStarter]: At program point L344(lines 344 361) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5) .cse0 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~s__state~5 8448))) [2018-10-04 09:22:20,327 INFO L421 ceAbstractionStarter]: At program point L303(lines 303 322) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8496) (= ULTIMATE.start_ssl3_accept_~blastFlag~5 1)) [2018-10-04 09:22:20,327 INFO L421 ceAbstractionStarter]: At program point L295(lines 258 295) the Hoare annotation is: (let ((.cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8464)) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8448)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse1 .cse0 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 1) (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)))) [2018-10-04 09:22:20,327 INFO L421 ceAbstractionStarter]: At program point L291(lines 291 304) the Hoare annotation is: (let ((.cse0 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8448)) (and .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse0 .cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 1) (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)))) [2018-10-04 09:22:20,342 INFO L202 PluginConnector]: Adding new model s3_srvr_2.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:22:20 BoogieIcfgContainer [2018-10-04 09:22:20,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:22:20,343 INFO L168 Benchmark]: Toolchain (without parser) took 4988.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 245.8 MB). Peak memory consumption was 245.8 MB. Max. memory is 7.1 GB. [2018-10-04 09:22:20,344 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 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-04 09:22:20,345 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.10 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-04 09:22:20,345 INFO L168 Benchmark]: Boogie Preprocessor took 45.58 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-04 09:22:20,346 INFO L168 Benchmark]: RCFGBuilder took 583.73 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-04 09:22:20,347 INFO L168 Benchmark]: TraceAbstraction took 4301.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 214.1 MB). Peak memory consumption was 214.1 MB. Max. memory is 7.1 GB. [2018-10-04 09:22:20,351 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.18 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 52.10 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 45.58 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 583.73 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 4301.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 214.1 MB). Peak memory consumption was 214.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 399]: 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: 271]: Loop Invariant Derived loop invariant: (((((ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8464) || ((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~5 && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__state~5 <= 8448)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8656)) || ((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~5 && ssl3_accept_~blastFlag~5 <= 3) && 8640 <= ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 == 1 && ssl3_accept_~s__state~5 == 8496) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: ssl3_accept_~s__state~5 == 8496 && ssl3_accept_~blastFlag~5 == 1 - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8656 - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: (((ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8656)) || ((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~5 && ssl3_accept_~blastFlag~5 <= 3) && 8640 <= ssl3_accept_~s__state~5)) || ssl3_accept_~s__state~5 <= 8448 - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8656 - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: (((((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~5 && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__state~5 <= 8448) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8656)) || ((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~5 && ssl3_accept_~blastFlag~5 <= 3) && 8640 <= ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 == 1 && ssl3_accept_~s__state~5 == 8496) - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: (((((ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8464) || ((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~5 && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__state~5 <= 8448)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8656)) || ((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~5 && ssl3_accept_~blastFlag~5 <= 3) && 8640 <= ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 == 1 && ssl3_accept_~s__state~5 == 8496) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8496 - InvariantResult [Line: 315]: Loop Invariant Derived loop invariant: ((((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~5 && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__state~5 <= 8448) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8656)) || ((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~5 && ssl3_accept_~blastFlag~5 <= 3) && 8640 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: (((((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~5 && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__state~5 <= 8448) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8656)) || ((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~5 && ssl3_accept_~blastFlag~5 <= 3) && 8640 <= ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 == 1 && ssl3_accept_~s__state~5 == 8496) - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5 - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. SAFE Result, 4.2s OverallTime, 8 OverallIterations, 8 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 32 SDslu, 67 SDs, 0 SdLazy, 125 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 57 NumberOfFragments, 281 HoareAnnotationTreeSize, 12 FomulaSimplifications, 135 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 57 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 13414 SizeOfPredicates, 2 NumberOfNonLiveVariables, 410 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 429/437 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_2.cil.c_16.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-22-20-369.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_2.cil.c_16.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-22-20-369.csv Received shutdown request...