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_clnt_3.cil.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:22:08,231 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:22:08,233 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:22:08,246 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:22:08,247 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:22:08,248 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:22:08,249 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:22:08,252 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:22:08,253 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:22:08,254 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:22:08,255 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:22:08,255 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:22:08,256 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:22:08,257 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:22:08,258 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:22:08,259 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:22:08,260 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:22:08,262 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:22:08,264 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:22:08,266 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:22:08,267 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:22:08,268 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:22:08,270 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:22:08,271 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:22:08,271 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:22:08,272 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:22:08,273 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:22:08,274 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:22:08,274 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:22:08,276 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:22:08,276 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:22:08,276 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:22:08,277 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:22:08,277 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:22:08,278 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:22:08,279 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:22:08,279 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:08,299 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:22:08,300 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:22:08,300 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:22:08,301 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:22:08,301 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:22:08,302 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:22:08,302 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:22:08,302 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:22:08,302 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:22:08,303 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:22:08,303 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:22:08,303 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:22:08,303 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:22:08,303 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:22:08,304 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:22:08,305 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:22:08,305 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:22:08,305 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:22:08,305 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:22:08,306 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:22:08,306 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:22:08,306 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:22:08,306 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:22:08,306 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:22:08,307 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:22:08,308 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:22:08,308 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:22:08,308 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:22:08,308 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:22:08,309 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:22:08,367 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:22:08,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:22:08,386 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:22:08,388 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:22:08,388 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:22:08,389 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.cil.c_21.bpl [2018-10-04 09:22:08,389 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.cil.c_21.bpl' [2018-10-04 09:22:08,495 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:22:08,496 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:22:08,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:22:08,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:22:08,498 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:22:08,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:08" (1/1) ... [2018-10-04 09:22:08,535 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:08" (1/1) ... [2018-10-04 09:22:08,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:22:08,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:22:08,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:22:08,544 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:22:08,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:08" (1/1) ... [2018-10-04 09:22:08,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:08" (1/1) ... [2018-10-04 09:22:08,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:08" (1/1) ... [2018-10-04 09:22:08,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:08" (1/1) ... [2018-10-04 09:22:08,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:08" (1/1) ... [2018-10-04 09:22:08,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:08" (1/1) ... [2018-10-04 09:22:08,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:08" (1/1) ... [2018-10-04 09:22:08,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:22:08,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:22:08,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:22:08,614 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:22:08,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:08" (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:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:22:08,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:22:09,467 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:22:09,468 INFO L202 PluginConnector]: Adding new model s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:22:09 BoogieIcfgContainer [2018-10-04 09:22:09,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:22:09,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:22:09,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:22:09,472 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:22:09,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:08" (1/2) ... [2018-10-04 09:22:09,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e01056 and model type s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:22:09, skipping insertion in model container [2018-10-04 09:22:09,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:22:09" (2/2) ... [2018-10-04 09:22:09,478 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil.c_21.bpl [2018-10-04 09:22:09,488 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:22:09,496 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:22:09,547 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:22:09,548 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:22:09,548 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:22:09,548 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:22:09,548 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:22:09,548 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:22:09,548 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:22:09,549 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:22:09,549 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:22:09,565 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-10-04 09:22:09,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 09:22:09,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:09,573 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:09,574 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:09,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:09,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1918575661, now seen corresponding path program 1 times [2018-10-04 09:22:09,583 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:09,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:09,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:09,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:09,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:09,810 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:09,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:09,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:22:09,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:09,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:09,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:09,831 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2018-10-04 09:22:10,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:10,204 INFO L93 Difference]: Finished difference Result 51 states and 85 transitions. [2018-10-04 09:22:10,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:10,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-04 09:22:10,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:10,217 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:22:10,218 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 09:22:10,222 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:10,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 09:22:10,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-04 09:22:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:22:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 48 transitions. [2018-10-04 09:22:10,265 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 48 transitions. Word has length 10 [2018-10-04 09:22:10,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:10,265 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 48 transitions. [2018-10-04 09:22:10,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:10,266 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 48 transitions. [2018-10-04 09:22:10,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:22:10,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:10,267 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:10,267 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:10,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:10,268 INFO L82 PathProgramCache]: Analyzing trace with hash -469243037, now seen corresponding path program 1 times [2018-10-04 09:22:10,268 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:10,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:10,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:10,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:10,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:22:10,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:10,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:22:10,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:10,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:10,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:10,426 INFO L87 Difference]: Start difference. First operand 30 states and 48 transitions. Second operand 3 states. [2018-10-04 09:22:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:10,785 INFO L93 Difference]: Finished difference Result 73 states and 119 transitions. [2018-10-04 09:22:10,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:10,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-04 09:22:10,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:10,788 INFO L225 Difference]: With dead ends: 73 [2018-10-04 09:22:10,788 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 09:22:10,789 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:10,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 09:22:10,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-04 09:22:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 09:22:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2018-10-04 09:22:10,804 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 19 [2018-10-04 09:22:10,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:10,805 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 70 transitions. [2018-10-04 09:22:10,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:10,805 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2018-10-04 09:22:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 09:22:10,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:10,806 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:10,807 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:10,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:10,807 INFO L82 PathProgramCache]: Analyzing trace with hash -215353290, now seen corresponding path program 1 times [2018-10-04 09:22:10,807 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:10,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:10,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:10,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:10,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:10,915 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:22:10,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:10,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:22:10,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:10,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:10,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:10,917 INFO L87 Difference]: Start difference. First operand 44 states and 70 transitions. Second operand 3 states. [2018-10-04 09:22:11,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:11,152 INFO L93 Difference]: Finished difference Result 100 states and 161 transitions. [2018-10-04 09:22:11,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:11,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-04 09:22:11,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:11,154 INFO L225 Difference]: With dead ends: 100 [2018-10-04 09:22:11,154 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:22:11,156 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:11,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:22:11,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-04 09:22:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 09:22:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 91 transitions. [2018-10-04 09:22:11,169 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 91 transitions. Word has length 22 [2018-10-04 09:22:11,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:11,169 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 91 transitions. [2018-10-04 09:22:11,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 91 transitions. [2018-10-04 09:22:11,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-04 09:22:11,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:11,171 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:11,172 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:11,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:11,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1101636687, now seen corresponding path program 1 times [2018-10-04 09:22:11,172 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:11,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:11,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:11,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:11,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-04 09:22:11,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:11,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:22:11,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:11,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:11,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:11,228 INFO L87 Difference]: Start difference. First operand 57 states and 91 transitions. Second operand 3 states. [2018-10-04 09:22:11,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:11,687 INFO L93 Difference]: Finished difference Result 119 states and 191 transitions. [2018-10-04 09:22:11,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:11,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-04 09:22:11,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:11,689 INFO L225 Difference]: With dead ends: 119 [2018-10-04 09:22:11,689 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 09:22:11,690 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:11,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 09:22:11,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-04 09:22:11,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 09:22:11,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 97 transitions. [2018-10-04 09:22:11,707 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 97 transitions. Word has length 27 [2018-10-04 09:22:11,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:11,708 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 97 transitions. [2018-10-04 09:22:11,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:11,708 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 97 transitions. [2018-10-04 09:22:11,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 09:22:11,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:11,710 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:11,710 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:11,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:11,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1650874841, now seen corresponding path program 1 times [2018-10-04 09:22:11,711 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:11,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:11,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:11,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:11,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:11,793 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-04 09:22:11,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:11,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:22:11,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:11,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:11,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:11,795 INFO L87 Difference]: Start difference. First operand 63 states and 97 transitions. Second operand 3 states. [2018-10-04 09:22:11,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:11,917 INFO L93 Difference]: Finished difference Result 130 states and 201 transitions. [2018-10-04 09:22:11,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:11,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 09:22:11,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:11,918 INFO L225 Difference]: With dead ends: 130 [2018-10-04 09:22:11,919 INFO L226 Difference]: Without dead ends: 68 [2018-10-04 09:22:11,920 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:11,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-04 09:22:11,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-04 09:22:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-04 09:22:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2018-10-04 09:22:11,938 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 34 [2018-10-04 09:22:11,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:11,938 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2018-10-04 09:22:11,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:11,939 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2018-10-04 09:22:11,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 09:22:11,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:11,940 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:11,941 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:11,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:11,941 INFO L82 PathProgramCache]: Analyzing trace with hash -23931843, now seen corresponding path program 1 times [2018-10-04 09:22:11,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:11,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:11,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:11,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:11,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:12,065 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-04 09:22:12,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:12,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:22:12,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:12,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:12,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:12,067 INFO L87 Difference]: Start difference. First operand 68 states and 100 transitions. Second operand 3 states. [2018-10-04 09:22:12,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:12,224 INFO L93 Difference]: Finished difference Result 151 states and 224 transitions. [2018-10-04 09:22:12,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:12,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 09:22:12,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:12,226 INFO L225 Difference]: With dead ends: 151 [2018-10-04 09:22:12,226 INFO L226 Difference]: Without dead ends: 83 [2018-10-04 09:22:12,227 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:12,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-04 09:22:12,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-10-04 09:22:12,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-04 09:22:12,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 122 transitions. [2018-10-04 09:22:12,243 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 122 transitions. Word has length 34 [2018-10-04 09:22:12,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:12,244 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 122 transitions. [2018-10-04 09:22:12,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:12,244 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 122 transitions. [2018-10-04 09:22:12,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 09:22:12,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:12,246 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:12,246 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:12,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:12,246 INFO L82 PathProgramCache]: Analyzing trace with hash -870093467, now seen corresponding path program 1 times [2018-10-04 09:22:12,246 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:12,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:12,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:12,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:12,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:12,317 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-04 09:22:12,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:12,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:22:12,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:12,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:12,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:12,319 INFO L87 Difference]: Start difference. First operand 83 states and 122 transitions. Second operand 3 states. [2018-10-04 09:22:12,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:12,723 INFO L93 Difference]: Finished difference Result 169 states and 249 transitions. [2018-10-04 09:22:12,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:12,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-10-04 09:22:12,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:12,725 INFO L225 Difference]: With dead ends: 169 [2018-10-04 09:22:12,725 INFO L226 Difference]: Without dead ends: 87 [2018-10-04 09:22:12,726 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:12,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-04 09:22:12,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-10-04 09:22:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-04 09:22:12,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2018-10-04 09:22:12,743 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 38 [2018-10-04 09:22:12,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:12,743 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2018-10-04 09:22:12,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:12,744 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2018-10-04 09:22:12,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 09:22:12,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:12,745 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:12,746 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:12,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:12,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1006859965, now seen corresponding path program 1 times [2018-10-04 09:22:12,746 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:12,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:12,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:12,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:12,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:12,875 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:12,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:12,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:12,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:12,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:12,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:12,877 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. Second operand 3 states. [2018-10-04 09:22:13,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:13,140 INFO L93 Difference]: Finished difference Result 252 states and 353 transitions. [2018-10-04 09:22:13,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:13,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-04 09:22:13,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:13,142 INFO L225 Difference]: With dead ends: 252 [2018-10-04 09:22:13,142 INFO L226 Difference]: Without dead ends: 166 [2018-10-04 09:22:13,146 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:13,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-04 09:22:13,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-10-04 09:22:13,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-04 09:22:13,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 230 transitions. [2018-10-04 09:22:13,190 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 230 transitions. Word has length 41 [2018-10-04 09:22:13,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:13,191 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 230 transitions. [2018-10-04 09:22:13,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:13,191 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 230 transitions. [2018-10-04 09:22:13,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 09:22:13,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:13,193 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:13,193 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:13,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:13,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1429561791, now seen corresponding path program 1 times [2018-10-04 09:22:13,194 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:13,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:13,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:13,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:13,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-04 09:22:13,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:13,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:13,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:13,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:13,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:13,290 INFO L87 Difference]: Start difference. First operand 166 states and 230 transitions. Second operand 3 states. [2018-10-04 09:22:13,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:13,496 INFO L93 Difference]: Finished difference Result 240 states and 334 transitions. [2018-10-04 09:22:13,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:13,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-04 09:22:13,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:13,499 INFO L225 Difference]: With dead ends: 240 [2018-10-04 09:22:13,499 INFO L226 Difference]: Without dead ends: 238 [2018-10-04 09:22:13,500 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:13,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-04 09:22:13,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-10-04 09:22:13,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-04 09:22:13,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 330 transitions. [2018-10-04 09:22:13,551 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 330 transitions. Word has length 41 [2018-10-04 09:22:13,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:13,551 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 330 transitions. [2018-10-04 09:22:13,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:13,552 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 330 transitions. [2018-10-04 09:22:13,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-04 09:22:13,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:13,561 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 7, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:13,566 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:13,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:13,566 INFO L82 PathProgramCache]: Analyzing trace with hash -159729293, now seen corresponding path program 1 times [2018-10-04 09:22:13,567 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:13,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:13,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:13,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:13,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-04 09:22:13,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:13,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:13,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:13,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:13,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:13,670 INFO L87 Difference]: Start difference. First operand 237 states and 330 transitions. Second operand 3 states. [2018-10-04 09:22:14,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:14,108 INFO L93 Difference]: Finished difference Result 473 states and 659 transitions. [2018-10-04 09:22:14,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:14,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-10-04 09:22:14,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:14,113 INFO L225 Difference]: With dead ends: 473 [2018-10-04 09:22:14,113 INFO L226 Difference]: Without dead ends: 237 [2018-10-04 09:22:14,114 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:14,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-04 09:22:14,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-10-04 09:22:14,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-04 09:22:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 324 transitions. [2018-10-04 09:22:14,141 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 324 transitions. Word has length 91 [2018-10-04 09:22:14,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:14,142 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 324 transitions. [2018-10-04 09:22:14,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 324 transitions. [2018-10-04 09:22:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-04 09:22:14,143 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:14,144 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 8, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:14,144 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:14,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:14,145 INFO L82 PathProgramCache]: Analyzing trace with hash -2023902907, now seen corresponding path program 1 times [2018-10-04 09:22:14,145 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:14,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:14,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:14,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:14,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:14,276 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-10-04 09:22:14,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:14,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:14,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:14,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:14,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:14,278 INFO L87 Difference]: Start difference. First operand 237 states and 324 transitions. Second operand 3 states. [2018-10-04 09:22:14,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:14,612 INFO L93 Difference]: Finished difference Result 473 states and 647 transitions. [2018-10-04 09:22:14,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:14,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-10-04 09:22:14,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:14,615 INFO L225 Difference]: With dead ends: 473 [2018-10-04 09:22:14,615 INFO L226 Difference]: Without dead ends: 237 [2018-10-04 09:22:14,616 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:14,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-04 09:22:14,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-10-04 09:22:14,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-04 09:22:14,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 318 transitions. [2018-10-04 09:22:14,643 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 318 transitions. Word has length 100 [2018-10-04 09:22:14,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:14,644 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 318 transitions. [2018-10-04 09:22:14,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:14,644 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 318 transitions. [2018-10-04 09:22:14,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-04 09:22:14,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:14,646 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 9, 7, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:14,646 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:14,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:14,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1040365903, now seen corresponding path program 1 times [2018-10-04 09:22:14,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:14,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:14,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:14,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:14,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-10-04 09:22:14,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:14,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:14,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:14,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:14,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:14,768 INFO L87 Difference]: Start difference. First operand 237 states and 318 transitions. Second operand 3 states. [2018-10-04 09:22:14,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:14,929 INFO L93 Difference]: Finished difference Result 500 states and 668 transitions. [2018-10-04 09:22:14,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:14,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-10-04 09:22:14,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:14,932 INFO L225 Difference]: With dead ends: 500 [2018-10-04 09:22:14,932 INFO L226 Difference]: Without dead ends: 264 [2018-10-04 09:22:14,933 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:14,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-04 09:22:14,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-10-04 09:22:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-10-04 09:22:14,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 345 transitions. [2018-10-04 09:22:14,964 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 345 transitions. Word has length 109 [2018-10-04 09:22:14,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:14,964 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 345 transitions. [2018-10-04 09:22:14,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:14,965 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 345 transitions. [2018-10-04 09:22:14,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-04 09:22:14,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:14,967 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 10, 8, 6, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:14,967 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:14,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:14,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2115374141, now seen corresponding path program 1 times [2018-10-04 09:22:14,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:14,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:14,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:14,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:14,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-10-04 09:22:15,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:15,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:15,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:15,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:15,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:15,072 INFO L87 Difference]: Start difference. First operand 264 states and 345 transitions. Second operand 3 states. [2018-10-04 09:22:15,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:15,300 INFO L93 Difference]: Finished difference Result 557 states and 728 transitions. [2018-10-04 09:22:15,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:15,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2018-10-04 09:22:15,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:15,304 INFO L225 Difference]: With dead ends: 557 [2018-10-04 09:22:15,304 INFO L226 Difference]: Without dead ends: 294 [2018-10-04 09:22:15,305 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:15,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-10-04 09:22:15,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2018-10-04 09:22:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-04 09:22:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 375 transitions. [2018-10-04 09:22:15,335 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 375 transitions. Word has length 118 [2018-10-04 09:22:15,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:15,336 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 375 transitions. [2018-10-04 09:22:15,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 375 transitions. [2018-10-04 09:22:15,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-04 09:22:15,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:15,338 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 11, 9, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:15,339 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:15,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:15,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1302152706, now seen corresponding path program 1 times [2018-10-04 09:22:15,339 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:15,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:15,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:15,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:15,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 339 proven. 5 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-10-04 09:22:15,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:22:15,563 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:22:15,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:15,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:15,781 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 339 proven. 5 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-10-04 09:22:15,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:22:15,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 09:22:15,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:22:15,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:22:15,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:22:15,826 INFO L87 Difference]: Start difference. First operand 294 states and 375 transitions. Second operand 4 states. [2018-10-04 09:22:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:17,067 INFO L93 Difference]: Finished difference Result 640 states and 800 transitions. [2018-10-04 09:22:17,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:22:17,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-10-04 09:22:17,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:17,068 INFO L225 Difference]: With dead ends: 640 [2018-10-04 09:22:17,069 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:22:17,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 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-10-04 09:22:17,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:22:17,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:22:17,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:22:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:22:17,071 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2018-10-04 09:22:17,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:17,071 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:22:17,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:22:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:22:17,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:22:17,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:22:18,399 WARN L178 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 35 DAG size of output: 25 [2018-10-04 09:22:18,526 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 7 [2018-10-04 09:22:18,944 WARN L178 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-10-04 09:22:19,135 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-10-04 09:22:19,515 WARN L178 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 25 [2018-10-04 09:22:19,712 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 22 [2018-10-04 09:22:20,459 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-10-04 09:22:20,595 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 22 [2018-10-04 09:22:20,780 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-10-04 09:22:20,783 INFO L421 ceAbstractionStarter]: At program point L539(lines 310 539) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse3) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse2))) [2018-10-04 09:22:20,783 INFO L421 ceAbstractionStarter]: At program point L354(lines 354 372) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse4 (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse2 .cse3 .cse4))) [2018-10-04 09:22:20,783 INFO L421 ceAbstractionStarter]: At program point L321(lines 279 321) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse3) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse2))) [2018-10-04 09:22:20,784 INFO L421 ceAbstractionStarter]: At program point L350(lines 350 361) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4528 ULTIMATE.start_ssl3_connect_~s__state~4))) [2018-10-04 09:22:20,785 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 540) no Hoare annotation was computed. [2018-10-04 09:22:20,785 INFO L421 ceAbstractionStarter]: At program point L317(lines 317 339) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse3) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse2))) [2018-10-04 09:22:20,785 INFO L421 ceAbstractionStarter]: At program point L445(lines 445 472) the Hoare annotation is: false [2018-10-04 09:22:20,785 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 540) no Hoare annotation was computed. [2018-10-04 09:22:20,785 INFO L421 ceAbstractionStarter]: At program point L284(lines 284 311) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse3) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse2))) [2018-10-04 09:22:20,785 INFO L421 ceAbstractionStarter]: At program point L474(lines 471 488) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse4 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse5 (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse4 .cse5))) [2018-10-04 09:22:20,786 INFO L421 ceAbstractionStarter]: At program point L408(lines 408 430) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse4 (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse3 .cse4))) [2018-10-04 09:22:20,786 INFO L421 ceAbstractionStarter]: At program point L375(lines 375 405) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) .cse2 .cse3) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse2 .cse3))) [2018-10-04 09:22:20,786 INFO L421 ceAbstractionStarter]: At program point L342(lines 342 351) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse4 (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse2 .cse4))) [2018-10-04 09:22:20,786 INFO L421 ceAbstractionStarter]: At program point L404(lines 404 419) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4416)) [2018-10-04 09:22:20,786 INFO L421 ceAbstractionStarter]: At program point L371(lines 371 388) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4528 ULTIMATE.start_ssl3_connect_~s__state~4))) [2018-10-04 09:22:20,786 INFO L421 ceAbstractionStarter]: At program point L433(lines 433 464) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse4 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse5 (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse4 .cse5))) [2018-10-04 09:22:20,786 INFO L421 ceAbstractionStarter]: At program point L429(lines 429 446) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) [2018-10-04 09:22:20,786 INFO L421 ceAbstractionStarter]: At program point L396(lines 387 409) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4528 ULTIMATE.start_ssl3_connect_~s__state~4))) [2018-10-04 09:22:20,787 INFO L421 ceAbstractionStarter]: At program point L421(lines 418 434) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4416)) [2018-10-04 09:22:20,787 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 540) no Hoare annotation was computed. [2018-10-04 09:22:20,787 INFO L421 ceAbstractionStarter]: At program point L513(lines 513 530) the Hoare annotation is: (let ((.cse2 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse4 (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse5 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 4528 ULTIMATE.start_ssl3_connect_~s__state~4))) (and .cse0 .cse1 .cse3 .cse4 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse5))) [2018-10-04 09:22:20,787 INFO L421 ceAbstractionStarter]: At program point L365(lines 360 376) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4528 ULTIMATE.start_ssl3_connect_~s__state~4))) [2018-10-04 09:22:20,787 INFO L421 ceAbstractionStarter]: At program point L493(lines 493 510) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse4 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse5 (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse4 .cse5))) [2018-10-04 09:22:20,787 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 473) no Hoare annotation was computed. [2018-10-04 09:22:20,805 INFO L202 PluginConnector]: Adding new model s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:22:20 BoogieIcfgContainer [2018-10-04 09:22:20,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:22:20,807 INFO L168 Benchmark]: Toolchain (without parser) took 12311.12 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 46.1 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 280.5 MB). Peak memory consumption was 326.6 MB. Max. memory is 7.1 GB. [2018-10-04 09:22:20,808 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:22:20,808 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.88 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,809 INFO L168 Benchmark]: Boogie Preprocessor took 69.66 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,809 INFO L168 Benchmark]: RCFGBuilder took 854.22 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,810 INFO L168 Benchmark]: TraceAbstraction took 11336.85 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 46.1 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 248.8 MB). Peak memory consumption was 294.9 MB. Max. memory is 7.1 GB. [2018-10-04 09:22:20,814 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.88 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 69.66 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 854.22 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 11336.85 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 46.1 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 248.8 MB). Peak memory consumption was 294.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 473]: 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: 408]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || (((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 2 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) && !(4528 == ssl3_connect_~s__state~4) - InvariantResult [Line: 429]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432 - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || ((((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4))) || (((ssl3_connect_~blastFlag~4 <= 2 && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) || (((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4))) || (ssl3_connect_~blastFlag~4 <= 2 && !(4352 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 4 && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) && !(4528 == ssl3_connect_~s__state~4) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) || (((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4))) || (ssl3_connect_~blastFlag~4 <= 2 && !(4352 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) || (((((!(4400 == ssl3_connect_~s__state~4) && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4528 == ssl3_connect_~s__state~4))) || (((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4))) || ((ssl3_connect_~blastFlag~4 <= 2 && !(4352 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4416 - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 2 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) && !(4528 == ssl3_connect_~s__state~4) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 2 && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) && !(4528 == ssl3_connect_~s__state~4) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) || (((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4))) || (ssl3_connect_~blastFlag~4 <= 2 && !(4352 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || ((((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) || (((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4))) || (ssl3_connect_~blastFlag~4 <= 2 && !(4352 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4416 - InvariantResult [Line: 471]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || ((((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. SAFE Result, 11.2s OverallTime, 14 OverallIterations, 15 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 3.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 358 SDtfs, 175 SDslu, 130 SDs, 0 SdLazy, 432 SolverSat, 127 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=294occurred in iteration=13, 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.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 367 NumberOfFragments, 731 HoareAnnotationTreeSize, 20 FomulaSimplifications, 9497 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 20 FomulaSimplificationsInter, 1387 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 940 NumberOfCodeBlocks, 940 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 925 ConstructedInterpolants, 0 QuantifiedInterpolants, 105119 SizeOfPredicates, 2 NumberOfNonLiveVariables, 600 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 3039/3049 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_clnt_3.cil.c_21.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-22-20-833.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.cil.c_21.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-22-20-833.csv Received shutdown request...