java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-bd42740 [2018-09-23 21:31:40,226 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 21:31:40,228 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 21:31:40,246 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 21:31:40,246 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 21:31:40,247 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 21:31:40,248 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 21:31:40,251 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 21:31:40,255 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 21:31:40,257 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 21:31:40,258 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 21:31:40,258 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 21:31:40,259 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 21:31:40,260 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 21:31:40,261 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 21:31:40,262 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 21:31:40,262 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 21:31:40,264 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 21:31:40,266 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 21:31:40,268 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 21:31:40,269 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 21:31:40,270 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 21:31:40,273 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 21:31:40,273 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 21:31:40,273 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 21:31:40,274 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 21:31:40,275 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 21:31:40,276 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 21:31:40,276 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 21:31:40,277 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 21:31:40,278 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 21:31:40,278 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 21:31:40,278 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 21:31:40,279 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 21:31:40,280 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 21:31:40,280 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 21:31:40,281 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-23 21:31:40,298 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 21:31:40,299 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 21:31:40,301 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 21:31:40,301 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 21:31:40,302 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 21:31:40,302 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 21:31:40,302 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 21:31:40,302 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 21:31:40,303 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 21:31:40,303 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 21:31:40,303 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 21:31:40,303 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 21:31:40,303 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 21:31:40,304 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 21:31:40,304 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 21:31:40,304 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 21:31:40,304 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 21:31:40,306 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 21:31:40,307 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 21:31:40,307 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 21:31:40,307 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 21:31:40,307 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 21:31:40,308 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 21:31:40,308 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 21:31:40,308 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 21:31:40,308 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 21:31:40,308 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 21:31:40,309 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 21:31:40,309 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 21:31:40,309 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 21:31:40,361 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 21:31:40,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 21:31:40,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 21:31:40,378 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 21:31:40,379 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 21:31:40,380 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl [2018-09-23 21:31:40,380 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl' [2018-09-23 21:31:40,472 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 21:31:40,475 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 21:31:40,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 21:31:40,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 21:31:40,477 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 21:31:40,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:40" (1/1) ... [2018-09-23 21:31:40,514 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:40" (1/1) ... [2018-09-23 21:31:40,521 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 21:31:40,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 21:31:40,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 21:31:40,523 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 21:31:40,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:40" (1/1) ... [2018-09-23 21:31:40,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:40" (1/1) ... [2018-09-23 21:31:40,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:40" (1/1) ... [2018-09-23 21:31:40,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:40" (1/1) ... [2018-09-23 21:31:40,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:40" (1/1) ... [2018-09-23 21:31:40,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:40" (1/1) ... [2018-09-23 21:31:40,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:40" (1/1) ... [2018-09-23 21:31:40,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 21:31:40,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 21:31:40,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 21:31:40,586 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 21:31:40,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 21:31:40,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-23 21:31:40,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-23 21:31:41,380 INFO L354 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-23 21:31:41,380 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 09:31:41 BoogieIcfgContainer [2018-09-23 21:31:41,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 21:31:41,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 21:31:41,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 21:31:41,385 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 21:31:41,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:40" (1/2) ... [2018-09-23 21:31:41,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a58d3db and model type s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 09:31:41, skipping insertion in model container [2018-09-23 21:31:41,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 09:31:41" (2/2) ... [2018-09-23 21:31:41,388 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil.c_23.bpl [2018-09-23 21:31:41,398 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 21:31:41,411 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-23 21:31:41,470 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 21:31:41,471 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 21:31:41,472 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 21:31:41,472 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 21:31:41,472 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 21:31:41,472 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 21:31:41,472 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 21:31:41,475 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 21:31:41,475 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 21:31:41,496 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-09-23 21:31:41,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:31:41,513 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:41,515 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:41,516 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:41,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:41,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1511424245, now seen corresponding path program 1 times [2018-09-23 21:31:41,525 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:41,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:41,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:41,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:41,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:41,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:31:41,772 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:41,772 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:31:41,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:41,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:41,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:41,792 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2018-09-23 21:31:42,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:42,257 INFO L93 Difference]: Finished difference Result 60 states and 100 transitions. [2018-09-23 21:31:42,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:42,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-23 21:31:42,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:42,295 INFO L225 Difference]: With dead ends: 60 [2018-09-23 21:31:42,296 INFO L226 Difference]: Without dead ends: 36 [2018-09-23 21:31:42,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:42,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-23 21:31:42,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-23 21:31:42,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-23 21:31:42,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 60 transitions. [2018-09-23 21:31:42,361 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 60 transitions. Word has length 16 [2018-09-23 21:31:42,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:42,361 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 60 transitions. [2018-09-23 21:31:42,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 60 transitions. [2018-09-23 21:31:42,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-23 21:31:42,363 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:42,363 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:42,364 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:42,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:42,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1787958207, now seen corresponding path program 1 times [2018-09-23 21:31:42,365 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:42,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:42,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:42,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:42,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:31:42,450 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:42,451 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:31:42,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:42,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:42,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:42,454 INFO L87 Difference]: Start difference. First operand 36 states and 60 transitions. Second operand 3 states. [2018-09-23 21:31:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:42,667 INFO L93 Difference]: Finished difference Result 87 states and 147 transitions. [2018-09-23 21:31:42,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:42,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-09-23 21:31:42,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:42,669 INFO L225 Difference]: With dead ends: 87 [2018-09-23 21:31:42,670 INFO L226 Difference]: Without dead ends: 52 [2018-09-23 21:31:42,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:42,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-23 21:31:42,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-09-23 21:31:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-23 21:31:42,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 86 transitions. [2018-09-23 21:31:42,685 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 86 transitions. Word has length 24 [2018-09-23 21:31:42,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:42,686 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 86 transitions. [2018-09-23 21:31:42,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:42,686 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 86 transitions. [2018-09-23 21:31:42,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-23 21:31:42,687 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:42,687 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:42,688 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:42,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:42,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1179694243, now seen corresponding path program 1 times [2018-09-23 21:31:42,688 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:42,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:42,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:42,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:42,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:42,776 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-23 21:31:42,776 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:42,777 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:31:42,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:42,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:42,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:42,778 INFO L87 Difference]: Start difference. First operand 52 states and 86 transitions. Second operand 3 states. [2018-09-23 21:31:42,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:42,980 INFO L93 Difference]: Finished difference Result 110 states and 183 transitions. [2018-09-23 21:31:42,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:42,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-09-23 21:31:42,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:42,982 INFO L225 Difference]: With dead ends: 110 [2018-09-23 21:31:42,983 INFO L226 Difference]: Without dead ends: 59 [2018-09-23 21:31:42,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-23 21:31:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-23 21:31:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-23 21:31:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 95 transitions. [2018-09-23 21:31:42,997 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 95 transitions. Word has length 31 [2018-09-23 21:31:42,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:42,998 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 95 transitions. [2018-09-23 21:31:42,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:42,998 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 95 transitions. [2018-09-23 21:31:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-23 21:31:42,999 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:43,000 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:43,000 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:43,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:43,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1680558917, now seen corresponding path program 1 times [2018-09-23 21:31:43,001 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:43,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:43,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:43,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:43,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:31:43,089 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:43,089 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:31:43,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:43,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:43,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:43,093 INFO L87 Difference]: Start difference. First operand 59 states and 95 transitions. Second operand 3 states. [2018-09-23 21:31:43,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:43,636 INFO L93 Difference]: Finished difference Result 135 states and 220 transitions. [2018-09-23 21:31:43,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:43,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-09-23 21:31:43,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:43,638 INFO L225 Difference]: With dead ends: 135 [2018-09-23 21:31:43,638 INFO L226 Difference]: Without dead ends: 76 [2018-09-23 21:31:43,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:43,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-23 21:31:43,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-09-23 21:31:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-23 21:31:43,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 123 transitions. [2018-09-23 21:31:43,654 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 123 transitions. Word has length 31 [2018-09-23 21:31:43,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:43,654 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 123 transitions. [2018-09-23 21:31:43,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:43,655 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 123 transitions. [2018-09-23 21:31:43,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-23 21:31:43,656 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:43,656 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:43,657 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:43,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:43,657 INFO L82 PathProgramCache]: Analyzing trace with hash -2026096289, now seen corresponding path program 1 times [2018-09-23 21:31:43,657 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:43,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:43,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:43,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:43,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:43,747 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-09-23 21:31:43,747 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:43,748 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:31:43,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:43,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:43,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:43,749 INFO L87 Difference]: Start difference. First operand 76 states and 123 transitions. Second operand 3 states. [2018-09-23 21:31:44,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:44,022 INFO L93 Difference]: Finished difference Result 157 states and 255 transitions. [2018-09-23 21:31:44,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:44,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-09-23 21:31:44,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:44,025 INFO L225 Difference]: With dead ends: 157 [2018-09-23 21:31:44,025 INFO L226 Difference]: Without dead ends: 82 [2018-09-23 21:31:44,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:44,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-23 21:31:44,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-09-23 21:31:44,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-23 21:31:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 128 transitions. [2018-09-23 21:31:44,041 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 128 transitions. Word has length 37 [2018-09-23 21:31:44,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:44,042 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 128 transitions. [2018-09-23 21:31:44,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:44,042 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 128 transitions. [2018-09-23 21:31:44,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-23 21:31:44,044 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:44,044 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:44,044 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:44,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:44,045 INFO L82 PathProgramCache]: Analyzing trace with hash -865281023, now seen corresponding path program 1 times [2018-09-23 21:31:44,045 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:44,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:44,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:44,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:44,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:44,091 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-23 21:31:44,091 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:44,091 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:31:44,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:44,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:44,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:44,093 INFO L87 Difference]: Start difference. First operand 82 states and 128 transitions. Second operand 3 states. [2018-09-23 21:31:44,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:44,239 INFO L93 Difference]: Finished difference Result 168 states and 263 transitions. [2018-09-23 21:31:44,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:44,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-09-23 21:31:44,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:44,241 INFO L225 Difference]: With dead ends: 168 [2018-09-23 21:31:44,241 INFO L226 Difference]: Without dead ends: 87 [2018-09-23 21:31:44,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:44,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-23 21:31:44,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-23 21:31:44,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-23 21:31:44,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2018-09-23 21:31:44,264 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 130 transitions. Word has length 42 [2018-09-23 21:31:44,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:44,264 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 130 transitions. [2018-09-23 21:31:44,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:44,265 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 130 transitions. [2018-09-23 21:31:44,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-23 21:31:44,266 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:44,266 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:44,267 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:44,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:44,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1951176091, now seen corresponding path program 1 times [2018-09-23 21:31:44,267 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:44,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:44,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:44,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:44,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-23 21:31:44,328 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:44,328 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:31:44,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:44,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:44,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:44,329 INFO L87 Difference]: Start difference. First operand 87 states and 130 transitions. Second operand 3 states. [2018-09-23 21:31:44,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:44,779 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2018-09-23 21:31:44,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:44,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-09-23 21:31:44,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:44,781 INFO L225 Difference]: With dead ends: 185 [2018-09-23 21:31:44,782 INFO L226 Difference]: Without dead ends: 98 [2018-09-23 21:31:44,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:44,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-23 21:31:44,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-09-23 21:31:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-23 21:31:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2018-09-23 21:31:44,799 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 45 [2018-09-23 21:31:44,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:44,800 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2018-09-23 21:31:44,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:44,800 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2018-09-23 21:31:44,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-23 21:31:44,802 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:44,802 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:44,802 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:44,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:44,803 INFO L82 PathProgramCache]: Analyzing trace with hash 2094171455, now seen corresponding path program 1 times [2018-09-23 21:31:44,803 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:44,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:44,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:44,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:44,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:44,878 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-09-23 21:31:44,878 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:44,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:31:44,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:44,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:44,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:44,883 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand 3 states. [2018-09-23 21:31:45,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:45,132 INFO L93 Difference]: Finished difference Result 285 states and 418 transitions. [2018-09-23 21:31:45,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:45,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-09-23 21:31:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:45,134 INFO L225 Difference]: With dead ends: 285 [2018-09-23 21:31:45,134 INFO L226 Difference]: Without dead ends: 188 [2018-09-23 21:31:45,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:45,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-09-23 21:31:45,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-09-23 21:31:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-09-23 21:31:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2018-09-23 21:31:45,166 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 46 [2018-09-23 21:31:45,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:45,167 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2018-09-23 21:31:45,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:45,167 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2018-09-23 21:31:45,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-23 21:31:45,169 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:45,169 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:45,170 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:45,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:45,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1814017687, now seen corresponding path program 1 times [2018-09-23 21:31:45,170 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:45,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:45,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:45,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:45,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:45,369 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-23 21:31:45,370 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:31:45,370 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:31:45,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:45,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:31:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-09-23 21:31:45,586 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-23 21:31:45,586 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-09-23 21:31:45,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-23 21:31:45,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-23 21:31:45,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-23 21:31:45,587 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand 5 states. [2018-09-23 21:31:46,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:46,830 INFO L93 Difference]: Finished difference Result 695 states and 974 transitions. [2018-09-23 21:31:46,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-23 21:31:46,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-09-23 21:31:46,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:46,836 INFO L225 Difference]: With dead ends: 695 [2018-09-23 21:31:46,837 INFO L226 Difference]: Without dead ends: 486 [2018-09-23 21:31:46,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-23 21:31:46,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-09-23 21:31:46,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 280. [2018-09-23 21:31:46,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-09-23 21:31:46,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 381 transitions. [2018-09-23 21:31:46,904 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 381 transitions. Word has length 49 [2018-09-23 21:31:46,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:46,905 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 381 transitions. [2018-09-23 21:31:46,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-23 21:31:46,905 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 381 transitions. [2018-09-23 21:31:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-23 21:31:46,908 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:46,908 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:46,908 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:46,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:46,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1561426047, now seen corresponding path program 1 times [2018-09-23 21:31:46,909 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:46,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:46,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:46,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:46,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-09-23 21:31:46,993 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:46,993 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:31:46,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:46,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:46,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:46,994 INFO L87 Difference]: Start difference. First operand 280 states and 381 transitions. Second operand 3 states. [2018-09-23 21:31:47,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:47,210 INFO L93 Difference]: Finished difference Result 466 states and 642 transitions. [2018-09-23 21:31:47,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:47,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-09-23 21:31:47,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:47,212 INFO L225 Difference]: With dead ends: 466 [2018-09-23 21:31:47,213 INFO L226 Difference]: Without dead ends: 279 [2018-09-23 21:31:47,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:47,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-09-23 21:31:47,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-09-23 21:31:47,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-09-23 21:31:47,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 378 transitions. [2018-09-23 21:31:47,255 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 378 transitions. Word has length 68 [2018-09-23 21:31:47,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:47,255 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 378 transitions. [2018-09-23 21:31:47,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:47,255 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 378 transitions. [2018-09-23 21:31:47,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-23 21:31:47,257 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:47,257 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:47,257 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:47,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:47,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1819686273, now seen corresponding path program 1 times [2018-09-23 21:31:47,258 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:47,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:47,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:47,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:47,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-09-23 21:31:47,345 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:47,345 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:31:47,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:47,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:47,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:47,346 INFO L87 Difference]: Start difference. First operand 279 states and 378 transitions. Second operand 3 states. [2018-09-23 21:31:47,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:47,741 INFO L93 Difference]: Finished difference Result 464 states and 636 transitions. [2018-09-23 21:31:47,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:47,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-09-23 21:31:47,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:47,743 INFO L225 Difference]: With dead ends: 464 [2018-09-23 21:31:47,743 INFO L226 Difference]: Without dead ends: 278 [2018-09-23 21:31:47,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:47,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-23 21:31:47,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-09-23 21:31:47,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-09-23 21:31:47,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 374 transitions. [2018-09-23 21:31:47,786 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 374 transitions. Word has length 72 [2018-09-23 21:31:47,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:47,786 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 374 transitions. [2018-09-23 21:31:47,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:47,787 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 374 transitions. [2018-09-23 21:31:47,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-23 21:31:47,788 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:47,788 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:47,788 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:47,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:47,789 INFO L82 PathProgramCache]: Analyzing trace with hash 642028047, now seen corresponding path program 1 times [2018-09-23 21:31:47,789 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:47,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:47,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:47,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:47,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-09-23 21:31:47,881 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:47,882 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:31:47,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:47,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:47,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:47,883 INFO L87 Difference]: Start difference. First operand 278 states and 374 transitions. Second operand 3 states. [2018-09-23 21:31:48,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:48,068 INFO L93 Difference]: Finished difference Result 548 states and 739 transitions. [2018-09-23 21:31:48,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:48,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-09-23 21:31:48,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:48,071 INFO L225 Difference]: With dead ends: 548 [2018-09-23 21:31:48,071 INFO L226 Difference]: Without dead ends: 276 [2018-09-23 21:31:48,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:48,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-09-23 21:31:48,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2018-09-23 21:31:48,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-09-23 21:31:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 364 transitions. [2018-09-23 21:31:48,111 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 364 transitions. Word has length 77 [2018-09-23 21:31:48,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:48,112 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 364 transitions. [2018-09-23 21:31:48,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:48,112 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 364 transitions. [2018-09-23 21:31:48,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-23 21:31:48,113 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:48,113 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:48,114 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:48,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:48,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1765416395, now seen corresponding path program 1 times [2018-09-23 21:31:48,114 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:48,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:48,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:48,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:48,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-09-23 21:31:48,231 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:48,232 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:31:48,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:48,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:48,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:48,233 INFO L87 Difference]: Start difference. First operand 276 states and 364 transitions. Second operand 3 states. [2018-09-23 21:31:48,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:48,600 INFO L93 Difference]: Finished difference Result 543 states and 718 transitions. [2018-09-23 21:31:48,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:48,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-09-23 21:31:48,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:48,603 INFO L225 Difference]: With dead ends: 543 [2018-09-23 21:31:48,603 INFO L226 Difference]: Without dead ends: 274 [2018-09-23 21:31:48,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:48,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-23 21:31:48,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-09-23 21:31:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-09-23 21:31:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 354 transitions. [2018-09-23 21:31:48,644 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 354 transitions. Word has length 83 [2018-09-23 21:31:48,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:48,644 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 354 transitions. [2018-09-23 21:31:48,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:48,645 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 354 transitions. [2018-09-23 21:31:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-23 21:31:48,646 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:48,646 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:48,647 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:48,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:48,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1105856767, now seen corresponding path program 1 times [2018-09-23 21:31:48,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:48,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:48,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:48,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:48,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:48,775 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-23 21:31:48,776 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:48,776 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:31:48,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:48,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:48,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:48,777 INFO L87 Difference]: Start difference. First operand 274 states and 354 transitions. Second operand 3 states. [2018-09-23 21:31:49,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:49,276 INFO L93 Difference]: Finished difference Result 543 states and 705 transitions. [2018-09-23 21:31:49,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:49,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-09-23 21:31:49,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:49,279 INFO L225 Difference]: With dead ends: 543 [2018-09-23 21:31:49,279 INFO L226 Difference]: Without dead ends: 277 [2018-09-23 21:31:49,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:49,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-09-23 21:31:49,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-09-23 21:31:49,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-09-23 21:31:49,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 352 transitions. [2018-09-23 21:31:49,318 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 352 transitions. Word has length 90 [2018-09-23 21:31:49,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:49,318 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 352 transitions. [2018-09-23 21:31:49,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:49,318 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 352 transitions. [2018-09-23 21:31:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-23 21:31:49,320 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:49,320 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:49,320 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:49,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:49,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1448402059, now seen corresponding path program 1 times [2018-09-23 21:31:49,321 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:49,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:49,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:49,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:49,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:49,436 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-09-23 21:31:49,436 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:49,436 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:31:49,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:49,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:49,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:49,437 INFO L87 Difference]: Start difference. First operand 277 states and 352 transitions. Second operand 3 states. [2018-09-23 21:31:49,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:49,744 INFO L93 Difference]: Finished difference Result 576 states and 736 transitions. [2018-09-23 21:31:49,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:49,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-09-23 21:31:49,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:49,747 INFO L225 Difference]: With dead ends: 576 [2018-09-23 21:31:49,747 INFO L226 Difference]: Without dead ends: 307 [2018-09-23 21:31:49,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:49,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-09-23 21:31:49,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-09-23 21:31:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-09-23 21:31:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 382 transitions. [2018-09-23 21:31:49,785 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 382 transitions. Word has length 98 [2018-09-23 21:31:49,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:49,786 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 382 transitions. [2018-09-23 21:31:49,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:49,786 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 382 transitions. [2018-09-23 21:31:49,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-23 21:31:49,787 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:49,788 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:49,788 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:49,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:49,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1388837957, now seen corresponding path program 1 times [2018-09-23 21:31:49,788 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:49,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:49,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:49,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:49,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-09-23 21:31:49,940 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:49,940 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:31:49,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:49,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:49,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:49,941 INFO L87 Difference]: Start difference. First operand 307 states and 382 transitions. Second operand 3 states. [2018-09-23 21:31:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:50,033 INFO L93 Difference]: Finished difference Result 606 states and 764 transitions. [2018-09-23 21:31:50,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:50,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-09-23 21:31:50,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:50,036 INFO L225 Difference]: With dead ends: 606 [2018-09-23 21:31:50,037 INFO L226 Difference]: Without dead ends: 403 [2018-09-23 21:31:50,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:50,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-09-23 21:31:50,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-09-23 21:31:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-09-23 21:31:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 505 transitions. [2018-09-23 21:31:50,088 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 505 transitions. Word has length 108 [2018-09-23 21:31:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:50,088 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 505 transitions. [2018-09-23 21:31:50,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 505 transitions. [2018-09-23 21:31:50,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-23 21:31:50,092 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:50,093 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 12, 11, 10, 9, 8, 7, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:50,093 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:50,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:50,093 INFO L82 PathProgramCache]: Analyzing trace with hash 816352441, now seen corresponding path program 1 times [2018-09-23 21:31:50,093 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:50,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:50,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:50,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:50,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-09-23 21:31:50,250 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:50,250 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:31:50,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:50,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:50,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:50,251 INFO L87 Difference]: Start difference. First operand 403 states and 505 transitions. Second operand 3 states. [2018-09-23 21:31:50,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:50,841 INFO L93 Difference]: Finished difference Result 798 states and 1001 transitions. [2018-09-23 21:31:50,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:50,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-09-23 21:31:50,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:50,845 INFO L225 Difference]: With dead ends: 798 [2018-09-23 21:31:50,845 INFO L226 Difference]: Without dead ends: 403 [2018-09-23 21:31:50,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:50,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-09-23 21:31:50,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-09-23 21:31:50,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-09-23 21:31:50,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 486 transitions. [2018-09-23 21:31:50,898 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 486 transitions. Word has length 148 [2018-09-23 21:31:50,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:50,898 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 486 transitions. [2018-09-23 21:31:50,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 486 transitions. [2018-09-23 21:31:50,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-09-23 21:31:50,901 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:50,901 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 14, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:50,901 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:50,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:50,902 INFO L82 PathProgramCache]: Analyzing trace with hash 155947305, now seen corresponding path program 1 times [2018-09-23 21:31:50,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:50,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:50,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:50,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:50,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 741 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-09-23 21:31:51,105 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:31:51,105 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:31:51,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:51,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:31:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2018-09-23 21:31:51,343 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-23 21:31:51,343 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-09-23 21:31:51,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-23 21:31:51,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-23 21:31:51,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-23 21:31:51,344 INFO L87 Difference]: Start difference. First operand 403 states and 486 transitions. Second operand 5 states. [2018-09-23 21:31:51,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:51,488 INFO L93 Difference]: Finished difference Result 643 states and 775 transitions. [2018-09-23 21:31:51,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-23 21:31:51,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2018-09-23 21:31:51,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:51,491 INFO L225 Difference]: With dead ends: 643 [2018-09-23 21:31:51,491 INFO L226 Difference]: Without dead ends: 0 [2018-09-23 21:31:51,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-23 21:31:51,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-23 21:31:51,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-23 21:31:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-23 21:31:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-23 21:31:51,494 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 191 [2018-09-23 21:31:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:51,495 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-23 21:31:51,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-23 21:31:51,495 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-23 21:31:51,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-23 21:31:51,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-23 21:31:51,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:51,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:31:53,344 WARN L178 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-09-23 21:31:53,827 WARN L178 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-09-23 21:31:54,167 WARN L178 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-09-23 21:31:54,337 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-09-23 21:31:54,543 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-09-23 21:31:55,684 WARN L178 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2018-09-23 21:31:55,994 WARN L178 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-09-23 21:31:56,305 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2018-09-23 21:31:56,472 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2018-09-23 21:31:56,856 WARN L178 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-09-23 21:31:57,087 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2018-09-23 21:31:57,241 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-09-23 21:31:57,289 INFO L422 ceAbstractionStarter]: At program point L444(lines 441 466) the Hoare annotation is: (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-09-23 21:31:57,289 INFO L422 ceAbstractionStarter]: At program point L337(lines 337 355) the Hoare annotation is: (let ((.cse1 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse1 .cse2 .cse3) (and .cse4 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse1 .cse2 .cse3) (and .cse4 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-09-23 21:31:57,290 INFO L422 ceAbstractionStarter]: At program point L465(lines 465 487) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-09-23 21:31:57,290 INFO L422 ceAbstractionStarter]: At program point L457(lines 457 478) the Hoare annotation is: (and (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-09-23 21:31:57,290 INFO L422 ceAbstractionStarter]: At program point L511(lines 511 515) the Hoare annotation is: false [2018-09-23 21:31:57,290 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 517) no Hoare annotation was computed. [2018-09-23 21:31:57,290 INFO L422 ceAbstractionStarter]: At program point L317(lines 317 334) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse1 .cse2) (and .cse3 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse1 .cse2) (and .cse3 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-09-23 21:31:57,291 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 517) no Hoare annotation was computed. [2018-09-23 21:31:57,291 INFO L422 ceAbstractionStarter]: At program point L408(lines 408 420) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576) .cse1 .cse2 .cse3) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-09-23 21:31:57,291 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 517) no Hoare annotation was computed. [2018-09-23 21:31:57,291 INFO L422 ceAbstractionStarter]: At program point L285(lines 248 285) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-09-23 21:31:57,291 INFO L422 ceAbstractionStarter]: At program point L281(lines 281 300) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-09-23 21:31:57,291 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 516) no Hoare annotation was computed. [2018-09-23 21:31:57,291 INFO L422 ceAbstractionStarter]: At program point L393(lines 393 405) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576) .cse1 .cse2 .cse3) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-09-23 21:31:57,292 INFO L422 ceAbstractionStarter]: At program point L360(lines 360 371) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (.cse2 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse5 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2 .cse3 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2 .cse3 .cse4 .cse5))) [2018-09-23 21:31:57,292 INFO L422 ceAbstractionStarter]: At program point L261(lines 261 277) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-09-23 21:31:57,292 INFO L422 ceAbstractionStarter]: At program point L480(lines 477 490) the Hoare annotation is: (and (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-09-23 21:31:57,292 INFO L422 ceAbstractionStarter]: At program point L505(lines 276 505) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-09-23 21:31:57,292 INFO L422 ceAbstractionStarter]: At program point L373(lines 373 390) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)))) [2018-09-23 21:31:57,293 INFO L422 ceAbstractionStarter]: At program point L435(lines 435 458) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (and .cse0 .cse1 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6))))) [2018-09-23 21:31:57,293 INFO L422 ceAbstractionStarter]: At program point L303(lines 303 314) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-09-23 21:31:57,293 INFO L422 ceAbstractionStarter]: At program point L431(lines 431 442) the Hoare annotation is: (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-09-23 21:31:57,293 INFO L422 ceAbstractionStarter]: At program point L489(lines 489 512) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-09-23 21:31:57,293 INFO L422 ceAbstractionStarter]: At program point L423(lines 423 432) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0 .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse3) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-09-23 21:31:57,293 INFO L422 ceAbstractionStarter]: At program point L514(lines 486 514) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-09-23 21:31:57,311 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 09:31:57 BoogieIcfgContainer [2018-09-23 21:31:57,311 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 21:31:57,312 INFO L168 Benchmark]: Toolchain (without parser) took 16839.39 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 112.2 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 134.9 MB). Peak memory consumption was 587.5 MB. Max. memory is 7.1 GB. [2018-09-23 21:31:57,313 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 21:31:57,314 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 21:31:57,314 INFO L168 Benchmark]: Boogie Preprocessor took 62.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 21:31:57,315 INFO L168 Benchmark]: RCFGBuilder took 794.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-23 21:31:57,316 INFO L168 Benchmark]: TraceAbstraction took 15929.81 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 112.2 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 103.1 MB). Peak memory consumption was 555.7 MB. Max. memory is 7.1 GB. [2018-09-23 21:31:57,320 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.27 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 62.94 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 794.92 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 15929.81 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 112.2 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 103.1 MB). Peak memory consumption was 555.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 516]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8448 == ssl3_accept_~s__state~6)) && ssl3_accept_~s__state~6 <= 8576) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6)) || (8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3)) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 477]: Loop Invariant Derived loop invariant: (((((!(8640 == ssl3_accept_~s__state~6) && !(8448 == ssl3_accept_~s__state~6)) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 3) && !(8512 == ssl3_accept_~s__state~6) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8448 == ssl3_accept_~s__state~6)) && ssl3_accept_~s__state~6 <= 8576) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6)) || (8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3)) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((!(8640 == ssl3_accept_~s__state~6) && !(8448 == ssl3_accept_~s__state~6)) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6) - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2)) || (((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && !(8656 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || ((!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 423]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((((((!(8640 == ssl3_accept_~s__state~6) && !(8448 == ssl3_accept_~s__state~6)) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && !(8656 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6))) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 441]: Loop Invariant Derived loop invariant: (((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8656 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6) - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (((!(8448 == ssl3_accept_~s__state~6) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: (((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8656 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. SAFE Result, 15.8s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 6.7s AutomataDifference, 0.0s DeadEndRemovalTime, 5.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 507 SDtfs, 212 SDslu, 262 SDs, 0 SdLazy, 683 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 295 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 206 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 21 PreInvPairs, 292 NumberOfFragments, 760 HoareAnnotationTreeSize, 21 FomulaSimplifications, 12583 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 21 FomulaSimplificationsInter, 2497 FormulaSimplificationTreeSizeReductionInter, 5.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1496 NumberOfCodeBlocks, 1496 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1476 ConstructedInterpolants, 0 QuantifiedInterpolants, 201255 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1211 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 20 InterpolantComputations, 18 PerfectInterpolantSequences, 5308/5324 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.cil.c_23.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_21-31-57-340.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.cil.c_23.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_21-31-57-340.csv Received shutdown request...