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_7.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:26:25,282 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:26:25,284 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:26:25,297 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:26:25,299 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:26:25,300 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:26:25,302 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:26:25,304 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:26:25,307 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:26:25,307 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:26:25,308 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:26:25,318 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:26:25,319 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:26:25,320 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:26:25,321 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:26:25,322 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:26:25,322 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:26:25,324 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:26:25,326 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:26:25,327 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:26:25,328 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:26:25,329 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:26:25,331 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:26:25,331 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:26:25,332 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:26:25,332 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:26:25,333 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:26:25,334 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:26:25,335 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:26:25,336 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:26:25,336 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:26:25,337 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:26:25,337 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:26:25,337 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:26:25,338 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:26:25,339 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:26:25,339 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-26 21:26:25,362 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:26:25,363 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:26:25,363 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:26:25,364 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:26:25,365 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:26:25,365 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:26:25,366 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:26:25,366 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:26:25,366 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:26:25,366 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:26:25,367 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:26:25,367 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:26:25,367 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:26:25,367 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:26:25,367 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:26:25,368 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:26:25,368 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:26:25,368 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:26:25,368 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:26:25,368 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:26:25,369 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:26:25,369 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:26:25,369 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:26:25,370 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:26:25,371 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:26:25,371 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:26:25,371 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:26:25,371 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:26:25,372 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:26:25,372 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:26:25,440 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:26:25,454 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:26:25,461 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:26:25,462 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:26:25,463 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:26:25,464 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_7.cil.c_19.bpl [2018-09-26 21:26:25,464 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_7.cil.c_19.bpl' [2018-09-26 21:26:25,576 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:26:25,579 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:26:25,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:26:25,580 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:26:25,580 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:26:25,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:26:25" (1/1) ... [2018-09-26 21:26:25,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:26:25" (1/1) ... [2018-09-26 21:26:25,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:26:25,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:26:25,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:26:25,634 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:26:25,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:26:25" (1/1) ... [2018-09-26 21:26:25,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:26:25" (1/1) ... [2018-09-26 21:26:25,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:26:25" (1/1) ... [2018-09-26 21:26:25,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:26:25" (1/1) ... [2018-09-26 21:26:25,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:26:25" (1/1) ... [2018-09-26 21:26:25,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:26:25" (1/1) ... [2018-09-26 21:26:25,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:26:25" (1/1) ... [2018-09-26 21:26:25,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:26:25,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:26:25,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:26:25,664 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:26:25,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:26:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:26:25,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:26:25,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:26:26,274 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:26:26,275 INFO L202 PluginConnector]: Adding new model s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:26:26 BoogieIcfgContainer [2018-09-26 21:26:26,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:26:26,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:26:26,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:26:26,279 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:26:26,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:26:25" (1/2) ... [2018-09-26 21:26:26,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db4602d and model type s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:26:26, skipping insertion in model container [2018-09-26 21:26:26,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:26:26" (2/2) ... [2018-09-26 21:26:26,282 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.c_19.bpl [2018-09-26 21:26:26,291 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:26:26,300 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:26:26,348 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:26:26,349 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:26:26,350 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:26:26,350 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:26:26,350 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:26:26,350 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:26:26,350 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:26:26,350 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:26:26,350 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:26:26,370 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-09-26 21:26:26,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 21:26:26,385 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:26,386 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:26:26,387 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:26,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:26,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1807955439, now seen corresponding path program 1 times [2018-09-26 21:26:26,394 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:26,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:26,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:26,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:26,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:26:26,601 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:26,602 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:26:26,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:26,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:26,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:26,624 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-09-26 21:26:26,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:26,743 INFO L93 Difference]: Finished difference Result 29 states and 44 transitions. [2018-09-26 21:26:26,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:26,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-09-26 21:26:26,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:26,756 INFO L225 Difference]: With dead ends: 29 [2018-09-26 21:26:26,756 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 21:26:26,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 21:26:26,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 21:26:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 21:26:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-09-26 21:26:26,800 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 7 [2018-09-26 21:26:26,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:26,800 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-09-26 21:26:26,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-09-26 21:26:26,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:26:26,801 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:26,802 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:26:26,802 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:26,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:26,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1100281751, now seen corresponding path program 1 times [2018-09-26 21:26:26,803 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:26,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:26,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:26,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:26,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:26:26,922 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:26,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:26,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:26,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:26,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:26,926 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 3 states. [2018-09-26 21:26:27,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:27,107 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2018-09-26 21:26:27,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:27,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-09-26 21:26:27,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:27,108 INFO L225 Difference]: With dead ends: 33 [2018-09-26 21:26:27,108 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 21:26:27,110 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-09-26 21:26:27,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 21:26:27,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-26 21:26:27,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 21:26:27,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-09-26 21:26:27,116 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 10 [2018-09-26 21:26:27,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:27,116 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-09-26 21:26:27,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:27,117 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2018-09-26 21:26:27,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 21:26:27,117 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:27,118 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:26:27,118 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:27,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:27,118 INFO L82 PathProgramCache]: Analyzing trace with hash -2082374887, now seen corresponding path program 1 times [2018-09-26 21:26:27,119 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:27,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:27,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:27,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:27,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 21:26:27,223 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:27,224 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:27,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:27,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:27,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:27,225 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 3 states. [2018-09-26 21:26:27,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:27,451 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2018-09-26 21:26:27,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:27,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-09-26 21:26:27,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:27,452 INFO L225 Difference]: With dead ends: 44 [2018-09-26 21:26:27,452 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 21:26:27,453 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-09-26 21:26:27,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 21:26:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-09-26 21:26:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 21:26:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-09-26 21:26:27,460 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 14 [2018-09-26 21:26:27,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:27,461 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-09-26 21:26:27,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:27,461 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2018-09-26 21:26:27,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 21:26:27,462 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:27,463 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:26:27,464 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:27,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:27,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1026052440, now seen corresponding path program 1 times [2018-09-26 21:26:27,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:27,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:27,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:27,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:27,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 21:26:27,604 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:27,604 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:27,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:27,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:27,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:27,606 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 3 states. [2018-09-26 21:26:27,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:27,691 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2018-09-26 21:26:27,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:27,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-09-26 21:26:27,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:27,695 INFO L225 Difference]: With dead ends: 56 [2018-09-26 21:26:27,695 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 21:26:27,696 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-09-26 21:26:27,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 21:26:27,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 21:26:27,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 21:26:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-09-26 21:26:27,703 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 23 [2018-09-26 21:26:27,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:27,703 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-09-26 21:26:27,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:27,704 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-09-26 21:26:27,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 21:26:27,705 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:27,705 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:26:27,705 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:27,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:27,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1274183299, now seen corresponding path program 1 times [2018-09-26 21:26:27,706 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:27,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:27,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:27,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:27,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:27,799 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-26 21:26:27,799 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:27,799 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:27,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:27,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:27,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:27,801 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2018-09-26 21:26:27,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:27,853 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2018-09-26 21:26:27,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:27,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-09-26 21:26:27,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:27,855 INFO L225 Difference]: With dead ends: 73 [2018-09-26 21:26:27,855 INFO L226 Difference]: Without dead ends: 42 [2018-09-26 21:26:27,857 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-09-26 21:26:27,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-26 21:26:27,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-09-26 21:26:27,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-26 21:26:27,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-09-26 21:26:27,866 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 32 [2018-09-26 21:26:27,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:27,866 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-09-26 21:26:27,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:27,867 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-09-26 21:26:27,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 21:26:27,868 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:27,868 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:26:27,868 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:27,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:27,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1954241669, now seen corresponding path program 1 times [2018-09-26 21:26:27,869 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:27,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:27,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:27,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:27,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:27,966 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-09-26 21:26:27,966 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:27,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:27,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:27,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:27,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:27,969 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 3 states. [2018-09-26 21:26:28,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:28,160 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2018-09-26 21:26:28,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:28,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-09-26 21:26:28,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:28,162 INFO L225 Difference]: With dead ends: 86 [2018-09-26 21:26:28,162 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 21:26:28,163 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-09-26 21:26:28,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 21:26:28,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 21:26:28,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 21:26:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-09-26 21:26:28,179 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 32 [2018-09-26 21:26:28,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:28,180 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-09-26 21:26:28,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:28,180 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-09-26 21:26:28,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 21:26:28,183 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:28,183 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:26:28,184 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:28,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:28,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1319638523, now seen corresponding path program 1 times [2018-09-26 21:26:28,186 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:28,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:28,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:28,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:28,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:28,274 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-26 21:26:28,275 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:28,275 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:28,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:28,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:28,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:28,276 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 3 states. [2018-09-26 21:26:28,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:28,364 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-09-26 21:26:28,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:28,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-09-26 21:26:28,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:28,367 INFO L225 Difference]: With dead ends: 64 [2018-09-26 21:26:28,367 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 21:26:28,368 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-09-26 21:26:28,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 21:26:28,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-09-26 21:26:28,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 21:26:28,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2018-09-26 21:26:28,378 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 37 [2018-09-26 21:26:28,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:28,379 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2018-09-26 21:26:28,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:28,379 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2018-09-26 21:26:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 21:26:28,380 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:28,380 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:26:28,381 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:28,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:28,381 INFO L82 PathProgramCache]: Analyzing trace with hash 158773189, now seen corresponding path program 1 times [2018-09-26 21:26:28,381 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:28,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:28,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:28,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:28,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:28,467 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-26 21:26:28,468 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:28,468 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:28,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:28,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:28,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:28,469 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 3 states. [2018-09-26 21:26:28,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:28,528 INFO L93 Difference]: Finished difference Result 120 states and 143 transitions. [2018-09-26 21:26:28,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:28,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-09-26 21:26:28,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:28,531 INFO L225 Difference]: With dead ends: 120 [2018-09-26 21:26:28,531 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 21:26:28,532 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-09-26 21:26:28,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 21:26:28,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-09-26 21:26:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-26 21:26:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2018-09-26 21:26:28,545 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 37 [2018-09-26 21:26:28,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:28,546 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-09-26 21:26:28,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:28,547 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2018-09-26 21:26:28,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 21:26:28,548 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:28,551 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:26:28,552 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:28,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:28,552 INFO L82 PathProgramCache]: Analyzing trace with hash 336869209, now seen corresponding path program 1 times [2018-09-26 21:26:28,552 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:28,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:28,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:28,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:28,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:28,729 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 127 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-09-26 21:26:28,729 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:26:28,730 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:26:28,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:28,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:26:28,877 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 127 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-09-26 21:26:28,907 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:26:28,907 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-26 21:26:28,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:26:28,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:26:28,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 21:26:28,909 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 4 states. [2018-09-26 21:26:29,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:29,400 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2018-09-26 21:26:29,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:26:29,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-09-26 21:26:29,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:29,401 INFO L225 Difference]: With dead ends: 118 [2018-09-26 21:26:29,401 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:26:29,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 21:26:29,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:26:29,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:26:29,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:26:29,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:26:29,403 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2018-09-26 21:26:29,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:29,403 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:26:29,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:26:29,403 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:26:29,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:26:29,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:26:29,864 WARN L178 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 22 [2018-09-26 21:26:29,989 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2018-09-26 21:26:30,233 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2018-09-26 21:26:30,499 INFO L422 ceAbstractionStarter]: At program point L382(lines 377 392) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) [2018-09-26 21:26:30,500 INFO L422 ceAbstractionStarter]: At program point L337(lines 337 348) the Hoare annotation is: (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4) (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656))) [2018-09-26 21:26:30,500 INFO L422 ceAbstractionStarter]: At program point L271(lines 271 287) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8464)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)))) [2018-09-26 21:26:30,500 INFO L422 ceAbstractionStarter]: At program point L391(lines 388 398) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) [2018-09-26 21:26:30,500 INFO L422 ceAbstractionStarter]: At program point L354(lines 351 364) the Hoare annotation is: (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4) (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640))) [2018-09-26 21:26:30,501 INFO L422 ceAbstractionStarter]: At program point L321(lines 321 329) the Hoare annotation is: (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4) (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656))) [2018-09-26 21:26:30,501 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 405) no Hoare annotation was computed. [2018-09-26 21:26:30,501 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 405) no Hoare annotation was computed. [2018-09-26 21:26:30,501 INFO L422 ceAbstractionStarter]: At program point L404(lines 286 404) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)))) [2018-09-26 21:26:30,501 INFO L422 ceAbstractionStarter]: At program point L371(lines 371 389) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) [2018-09-26 21:26:30,502 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 353) no Hoare annotation was computed. [2018-09-26 21:26:30,502 INFO L422 ceAbstractionStarter]: At program point L363(lines 363 378) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8656))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) .cse0))) [2018-09-26 21:26:30,502 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 405) no Hoare annotation was computed. [2018-09-26 21:26:30,502 INFO L422 ceAbstractionStarter]: At program point L347(lines 347 352) the Hoare annotation is: false [2018-09-26 21:26:30,502 INFO L422 ceAbstractionStarter]: At program point L295(lines 258 295) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8464)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)))) [2018-09-26 21:26:30,503 INFO L422 ceAbstractionStarter]: At program point L291(lines 291 310) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)))) [2018-09-26 21:26:30,516 INFO L202 PluginConnector]: Adding new model s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:26:30 BoogieIcfgContainer [2018-09-26 21:26:30,517 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:26:30,517 INFO L168 Benchmark]: Toolchain (without parser) took 4940.81 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: 267.0 MB). Peak memory consumption was 267.0 MB. Max. memory is 7.1 GB. [2018-09-26 21:26:30,519 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:26:30,519 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.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-09-26 21:26:30,520 INFO L168 Benchmark]: Boogie Preprocessor took 28.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:26:30,521 INFO L168 Benchmark]: RCFGBuilder took 611.74 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-09-26 21:26:30,522 INFO L168 Benchmark]: TraceAbstraction took 4240.97 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: 235.2 MB). Peak memory consumption was 235.2 MB. Max. memory is 7.1 GB. [2018-09-26 21:26:30,526 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.20 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 53.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. * Boogie Preprocessor took 28.98 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 611.74 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 4240.97 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: 235.2 MB). Peak memory consumption was 235.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 353]: 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 <= 4 && ssl3_accept_~s__state~5 == 8496) || (ssl3_accept_~blastFlag~5 == 3 && 8656 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 4) && ssl3_accept_~s__state~5 <= 8640)) || (ssl3_accept_~blastFlag~5 <= 4 && ssl3_accept_~s__state~5 == 8464)) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: (((ssl3_accept_~blastFlag~5 <= 4 && ssl3_accept_~s__state~5 == 8496) || (ssl3_accept_~blastFlag~5 == 3 && 8656 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 4) && ssl3_accept_~s__state~5 <= 8640)) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 == 3 && ssl3_accept_~s__state~5 == 8656 - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 == 3 && 8656 <= ssl3_accept_~s__state~5 - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: ((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || ssl3_accept_~blastFlag~5 == 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 4) && ssl3_accept_~s__state~5 <= 8640) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 4 && 8656 <= ssl3_accept_~s__state~5 - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 <= 4 && ssl3_accept_~s__state~5 == 8496) || (ssl3_accept_~blastFlag~5 == 3 && 8656 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 4) && ssl3_accept_~s__state~5 <= 8640)) || (ssl3_accept_~blastFlag~5 <= 4 && ssl3_accept_~s__state~5 == 8464)) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: ((ssl3_accept_~blastFlag~5 == 3 && 8656 <= ssl3_accept_~s__state~5) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 4) && ssl3_accept_~s__state~5 <= 8640)) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: ((ssl3_accept_~blastFlag~5 == 3 && 8656 <= ssl3_accept_~s__state~5) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 4) && ssl3_accept_~s__state~5 <= 8640)) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || (ssl3_accept_~blastFlag~5 == 3 && ssl3_accept_~s__state~5 == 8656) - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: (((ssl3_accept_~blastFlag~5 <= 4 && ssl3_accept_~s__state~5 == 8496) || (ssl3_accept_~blastFlag~5 == 3 && 8656 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 4) && ssl3_accept_~s__state~5 <= 8640)) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. SAFE Result, 4.1s OverallTime, 9 OverallIterations, 9 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 170 SDtfs, 25 SDslu, 75 SDs, 0 SdLazy, 143 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=8, 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, 9 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 71 NumberOfFragments, 250 HoareAnnotationTreeSize, 12 FomulaSimplifications, 381 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 94 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 17946 SizeOfPredicates, 2 NumberOfNonLiveVariables, 463 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 556/566 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_7.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-26-30-545.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_7.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-26-30-545.csv Received shutdown request...