java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:56:12,379 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:56:12,381 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:56:12,401 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:56:12,401 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:56:12,403 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:56:12,405 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:56:12,407 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:56:12,409 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:56:12,412 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:56:12,414 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:56:12,415 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:56:12,416 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:56:12,418 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:56:12,424 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:56:12,425 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:56:12,426 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:56:12,428 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:56:12,430 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:56:12,432 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:56:12,433 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:56:12,434 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:56:12,437 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:56:12,437 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:56:12,438 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:56:12,439 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:56:12,440 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:56:12,441 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:56:12,441 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:56:12,442 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:56:12,443 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:56:12,447 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:56:12,447 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:56:12,447 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:56:12,448 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:56:12,451 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:56:12,451 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:56:12,482 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:56:12,483 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:56:12,484 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:56:12,485 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:56:12,485 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:56:12,486 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:56:12,486 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:56:12,486 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:56:12,487 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:56:12,488 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:56:12,488 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:56:12,488 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:56:12,488 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:56:12,488 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:56:12,489 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:56:12,489 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:56:12,489 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:56:12,489 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:56:12,491 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:56:12,491 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:56:12,491 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:56:12,491 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:56:12,491 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:56:12,492 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:56:12,492 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:56:12,492 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:56:12,492 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:56:12,492 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:56:12,493 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:56:12,493 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:56:12,493 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:56:12,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:56:12,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:56:12,579 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:56:12,580 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:56:12,581 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:56:12,582 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl [2018-10-01 00:56:12,582 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl' [2018-10-01 00:56:12,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:56:12,707 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:56:12,708 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:56:12,708 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:56:12,708 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:56:12,729 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 01.10 12:56:12" (1/1) ... [2018-10-01 00:56:12,749 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 01.10 12:56:12" (1/1) ... [2018-10-01 00:56:12,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:56:12,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:56:12,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:56:12,766 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:56:12,777 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 01.10 12:56:12" (1/1) ... [2018-10-01 00:56:12,777 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 01.10 12:56:12" (1/1) ... [2018-10-01 00:56:12,781 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 01.10 12:56:12" (1/1) ... [2018-10-01 00:56:12,781 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 01.10 12:56:12" (1/1) ... [2018-10-01 00:56:12,790 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 01.10 12:56:12" (1/1) ... [2018-10-01 00:56:12,793 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 01.10 12:56:12" (1/1) ... [2018-10-01 00:56:12,796 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 01.10 12:56:12" (1/1) ... [2018-10-01 00:56:12,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:56:12,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:56:12,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:56:12,804 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:56:12,805 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 01.10 12:56:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:56:12,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:56:12,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:56:13,562 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:56:13,562 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:56:13 BoogieIcfgContainer [2018-10-01 00:56:13,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:56:13,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:56:13,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:56:13,568 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:56:13,568 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 01.10 12:56:12" (1/2) ... [2018-10-01 00:56:13,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148e44b0 and model type s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:56:13, skipping insertion in model container [2018-10-01 00:56:13,570 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 01.10 12:56:13" (2/2) ... [2018-10-01 00:56:13,572 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil.c_23.bpl [2018-10-01 00:56:13,583 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:56:13,595 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:56:13,655 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:56:13,656 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:56:13,656 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:56:13,656 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:56:13,656 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:56:13,659 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:56:13,659 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:56:13,659 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:56:13,659 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:56:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-10-01 00:56:13,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:56:13,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:13,697 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:13,698 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:13,705 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:13,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1511424245, now seen corresponding path program 1 times [2018-10-01 00:56:13,709 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:13,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:13,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:13,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:13,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:56:13,975 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:13,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:13,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:13,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:13,992 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:13,994 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2018-10-01 00:56:14,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:14,844 INFO L93 Difference]: Finished difference Result 60 states and 100 transitions. [2018-10-01 00:56:14,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:14,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-01 00:56:14,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:14,859 INFO L225 Difference]: With dead ends: 60 [2018-10-01 00:56:14,860 INFO L226 Difference]: Without dead ends: 36 [2018-10-01 00:56:14,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:14,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-01 00:56:14,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-01 00:56:14,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-01 00:56:14,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 60 transitions. [2018-10-01 00:56:14,910 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 60 transitions. Word has length 16 [2018-10-01 00:56:14,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:14,911 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 60 transitions. [2018-10-01 00:56:14,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:14,911 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 60 transitions. [2018-10-01 00:56:14,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-01 00:56:14,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:14,913 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:14,914 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:14,914 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:14,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1787958207, now seen corresponding path program 1 times [2018-10-01 00:56:14,915 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:14,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:14,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:14,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:14,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:15,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:56:15,043 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:15,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:15,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:15,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:15,046 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:15,046 INFO L87 Difference]: Start difference. First operand 36 states and 60 transitions. Second operand 3 states. [2018-10-01 00:56:15,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:15,535 INFO L93 Difference]: Finished difference Result 87 states and 147 transitions. [2018-10-01 00:56:15,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:15,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-01 00:56:15,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:15,538 INFO L225 Difference]: With dead ends: 87 [2018-10-01 00:56:15,538 INFO L226 Difference]: Without dead ends: 52 [2018-10-01 00:56:15,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:15,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-01 00:56:15,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-10-01 00:56:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-01 00:56:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 86 transitions. [2018-10-01 00:56:15,570 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 86 transitions. Word has length 24 [2018-10-01 00:56:15,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:15,572 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 86 transitions. [2018-10-01 00:56:15,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:15,572 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 86 transitions. [2018-10-01 00:56:15,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-01 00:56:15,574 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:15,574 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:15,574 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:15,575 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:15,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1179694243, now seen corresponding path program 1 times [2018-10-01 00:56:15,575 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:15,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:15,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:15,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:15,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-01 00:56:15,648 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:15,648 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:15,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:15,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:15,649 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:15,649 INFO L87 Difference]: Start difference. First operand 52 states and 86 transitions. Second operand 3 states. [2018-10-01 00:56:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:16,268 INFO L93 Difference]: Finished difference Result 110 states and 183 transitions. [2018-10-01 00:56:16,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:16,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-01 00:56:16,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:16,270 INFO L225 Difference]: With dead ends: 110 [2018-10-01 00:56:16,272 INFO L226 Difference]: Without dead ends: 59 [2018-10-01 00:56:16,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:16,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-01 00:56:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-01 00:56:16,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-01 00:56:16,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 95 transitions. [2018-10-01 00:56:16,296 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 95 transitions. Word has length 31 [2018-10-01 00:56:16,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:16,297 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 95 transitions. [2018-10-01 00:56:16,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:16,297 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 95 transitions. [2018-10-01 00:56:16,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-01 00:56:16,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:16,299 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:16,299 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:16,299 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:16,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1680558917, now seen corresponding path program 1 times [2018-10-01 00:56:16,300 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:16,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:16,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:16,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:16,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:56:16,414 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:16,415 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:16,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:16,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:16,417 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:16,417 INFO L87 Difference]: Start difference. First operand 59 states and 95 transitions. Second operand 3 states. [2018-10-01 00:56:16,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:16,804 INFO L93 Difference]: Finished difference Result 135 states and 220 transitions. [2018-10-01 00:56:16,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:16,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-01 00:56:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:16,806 INFO L225 Difference]: With dead ends: 135 [2018-10-01 00:56:16,806 INFO L226 Difference]: Without dead ends: 76 [2018-10-01 00:56:16,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:16,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-01 00:56:16,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-01 00:56:16,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-01 00:56:16,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 123 transitions. [2018-10-01 00:56:16,821 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 123 transitions. Word has length 31 [2018-10-01 00:56:16,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:16,821 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 123 transitions. [2018-10-01 00:56:16,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:16,822 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 123 transitions. [2018-10-01 00:56:16,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-01 00:56:16,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:16,823 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:16,824 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:16,824 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:16,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2026096289, now seen corresponding path program 1 times [2018-10-01 00:56:16,824 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:16,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:16,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:16,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:16,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:16,899 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-01 00:56:16,899 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:16,899 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:16,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:16,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:16,900 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:16,901 INFO L87 Difference]: Start difference. First operand 76 states and 123 transitions. Second operand 3 states. [2018-10-01 00:56:17,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:17,155 INFO L93 Difference]: Finished difference Result 157 states and 255 transitions. [2018-10-01 00:56:17,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:17,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-01 00:56:17,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:17,158 INFO L225 Difference]: With dead ends: 157 [2018-10-01 00:56:17,158 INFO L226 Difference]: Without dead ends: 82 [2018-10-01 00:56:17,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:17,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-01 00:56:17,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-10-01 00:56:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-01 00:56:17,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 128 transitions. [2018-10-01 00:56:17,174 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 128 transitions. Word has length 37 [2018-10-01 00:56:17,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:17,174 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 128 transitions. [2018-10-01 00:56:17,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:17,174 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 128 transitions. [2018-10-01 00:56:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-01 00:56:17,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:17,176 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:17,177 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:17,177 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:17,177 INFO L82 PathProgramCache]: Analyzing trace with hash -865281023, now seen corresponding path program 1 times [2018-10-01 00:56:17,177 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:17,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:17,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:17,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:17,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-01 00:56:17,234 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:17,234 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:17,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:17,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:17,235 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:17,236 INFO L87 Difference]: Start difference. First operand 82 states and 128 transitions. Second operand 3 states. [2018-10-01 00:56:17,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:17,521 INFO L93 Difference]: Finished difference Result 168 states and 263 transitions. [2018-10-01 00:56:17,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:17,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-01 00:56:17,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:17,524 INFO L225 Difference]: With dead ends: 168 [2018-10-01 00:56:17,524 INFO L226 Difference]: Without dead ends: 87 [2018-10-01 00:56:17,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:17,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-01 00:56:17,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-10-01 00:56:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-01 00:56:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2018-10-01 00:56:17,542 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 130 transitions. Word has length 42 [2018-10-01 00:56:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:17,542 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 130 transitions. [2018-10-01 00:56:17,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:17,542 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 130 transitions. [2018-10-01 00:56:17,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-01 00:56:17,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:17,544 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:17,545 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:17,545 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:17,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1951176091, now seen corresponding path program 1 times [2018-10-01 00:56:17,545 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:17,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:17,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:17,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:17,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:17,593 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-01 00:56:17,594 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:17,594 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:17,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:17,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:17,595 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:17,595 INFO L87 Difference]: Start difference. First operand 87 states and 130 transitions. Second operand 3 states. [2018-10-01 00:56:18,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:18,105 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2018-10-01 00:56:18,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:18,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-01 00:56:18,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:18,110 INFO L225 Difference]: With dead ends: 185 [2018-10-01 00:56:18,110 INFO L226 Difference]: Without dead ends: 98 [2018-10-01 00:56:18,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:18,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-01 00:56:18,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-10-01 00:56:18,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-01 00:56:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2018-10-01 00:56:18,135 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 45 [2018-10-01 00:56:18,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:18,136 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2018-10-01 00:56:18,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:18,136 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2018-10-01 00:56:18,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-01 00:56:18,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:18,142 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:18,142 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:18,143 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:18,143 INFO L82 PathProgramCache]: Analyzing trace with hash 2094171455, now seen corresponding path program 1 times [2018-10-01 00:56:18,143 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:18,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:18,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:18,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:18,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-01 00:56:18,266 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:18,267 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:18,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:18,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:18,267 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:18,268 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand 3 states. [2018-10-01 00:56:18,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:18,445 INFO L93 Difference]: Finished difference Result 285 states and 418 transitions. [2018-10-01 00:56:18,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:18,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-10-01 00:56:18,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:18,447 INFO L225 Difference]: With dead ends: 285 [2018-10-01 00:56:18,448 INFO L226 Difference]: Without dead ends: 188 [2018-10-01 00:56:18,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:18,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-01 00:56:18,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-10-01 00:56:18,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-01 00:56:18,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2018-10-01 00:56:18,477 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 46 [2018-10-01 00:56:18,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:18,477 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2018-10-01 00:56:18,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:18,478 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2018-10-01 00:56:18,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-01 00:56:18,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:18,480 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:18,480 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:18,481 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:18,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1814017687, now seen corresponding path program 1 times [2018-10-01 00:56:18,481 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:18,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:18,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:18,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:18,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-01 00:56:18,656 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:56:18,656 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:56:18,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:18,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:56:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-01 00:56:19,107 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:56:19,107 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-01 00:56:19,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:56:19,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:56:19,108 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:19,108 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand 5 states. [2018-10-01 00:56:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:21,940 INFO L93 Difference]: Finished difference Result 695 states and 974 transitions. [2018-10-01 00:56:21,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 00:56:21,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-10-01 00:56:21,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:21,943 INFO L225 Difference]: With dead ends: 695 [2018-10-01 00:56:21,943 INFO L226 Difference]: Without dead ends: 486 [2018-10-01 00:56:21,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:56:21,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-10-01 00:56:21,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 280. [2018-10-01 00:56:21,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-01 00:56:21,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 381 transitions. [2018-10-01 00:56:21,989 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 381 transitions. Word has length 49 [2018-10-01 00:56:21,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:21,990 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 381 transitions. [2018-10-01 00:56:21,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:56:21,990 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 381 transitions. [2018-10-01 00:56:21,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-01 00:56:21,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:21,992 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:21,993 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:21,993 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:21,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1561426047, now seen corresponding path program 1 times [2018-10-01 00:56:21,993 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:21,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:21,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:21,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:21,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-01 00:56:22,046 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:22,046 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:22,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:22,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:22,047 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:22,047 INFO L87 Difference]: Start difference. First operand 280 states and 381 transitions. Second operand 3 states. [2018-10-01 00:56:22,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:22,441 INFO L93 Difference]: Finished difference Result 466 states and 642 transitions. [2018-10-01 00:56:22,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:22,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-10-01 00:56:22,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:22,451 INFO L225 Difference]: With dead ends: 466 [2018-10-01 00:56:22,451 INFO L226 Difference]: Without dead ends: 279 [2018-10-01 00:56:22,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:22,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-01 00:56:22,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-10-01 00:56:22,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-01 00:56:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 378 transitions. [2018-10-01 00:56:22,484 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 378 transitions. Word has length 68 [2018-10-01 00:56:22,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:22,484 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 378 transitions. [2018-10-01 00:56:22,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 378 transitions. [2018-10-01 00:56:22,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-01 00:56:22,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:22,486 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:22,487 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:22,487 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:22,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1819686273, now seen corresponding path program 1 times [2018-10-01 00:56:22,487 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:22,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:22,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:22,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:22,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-10-01 00:56:22,595 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:22,595 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:22,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:22,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:22,596 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:22,599 INFO L87 Difference]: Start difference. First operand 279 states and 378 transitions. Second operand 3 states. [2018-10-01 00:56:23,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:23,326 INFO L93 Difference]: Finished difference Result 464 states and 636 transitions. [2018-10-01 00:56:23,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:23,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-10-01 00:56:23,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:23,328 INFO L225 Difference]: With dead ends: 464 [2018-10-01 00:56:23,328 INFO L226 Difference]: Without dead ends: 278 [2018-10-01 00:56:23,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:23,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-01 00:56:23,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-10-01 00:56:23,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-01 00:56:23,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 374 transitions. [2018-10-01 00:56:23,361 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 374 transitions. Word has length 72 [2018-10-01 00:56:23,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:23,361 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 374 transitions. [2018-10-01 00:56:23,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:23,361 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 374 transitions. [2018-10-01 00:56:23,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-01 00:56:23,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:23,363 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:23,363 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:23,363 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:23,363 INFO L82 PathProgramCache]: Analyzing trace with hash 642028047, now seen corresponding path program 1 times [2018-10-01 00:56:23,363 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:23,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:23,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:23,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:23,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:23,453 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-01 00:56:23,453 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:23,453 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:23,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:23,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:23,454 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:23,454 INFO L87 Difference]: Start difference. First operand 278 states and 374 transitions. Second operand 3 states. [2018-10-01 00:56:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:23,645 INFO L93 Difference]: Finished difference Result 548 states and 739 transitions. [2018-10-01 00:56:23,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:23,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-10-01 00:56:23,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:23,650 INFO L225 Difference]: With dead ends: 548 [2018-10-01 00:56:23,651 INFO L226 Difference]: Without dead ends: 276 [2018-10-01 00:56:23,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:23,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-01 00:56:23,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2018-10-01 00:56:23,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-01 00:56:23,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 364 transitions. [2018-10-01 00:56:23,683 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 364 transitions. Word has length 77 [2018-10-01 00:56:23,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:23,684 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 364 transitions. [2018-10-01 00:56:23,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:23,684 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 364 transitions. [2018-10-01 00:56:23,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-01 00:56:23,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:23,685 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:23,685 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:23,685 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:23,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1765416395, now seen corresponding path program 1 times [2018-10-01 00:56:23,686 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:23,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:23,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:23,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:23,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:23,757 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-01 00:56:23,757 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:23,757 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:23,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:23,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:23,758 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:23,758 INFO L87 Difference]: Start difference. First operand 276 states and 364 transitions. Second operand 3 states. [2018-10-01 00:56:25,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:25,073 INFO L93 Difference]: Finished difference Result 543 states and 718 transitions. [2018-10-01 00:56:25,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:25,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-10-01 00:56:25,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:25,078 INFO L225 Difference]: With dead ends: 543 [2018-10-01 00:56:25,078 INFO L226 Difference]: Without dead ends: 274 [2018-10-01 00:56:25,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:25,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-01 00:56:25,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-10-01 00:56:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-01 00:56:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 354 transitions. [2018-10-01 00:56:25,107 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 354 transitions. Word has length 83 [2018-10-01 00:56:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:25,108 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 354 transitions. [2018-10-01 00:56:25,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:25,108 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 354 transitions. [2018-10-01 00:56:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-01 00:56:25,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:25,109 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:25,110 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:25,110 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:25,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1105856767, now seen corresponding path program 1 times [2018-10-01 00:56:25,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:25,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:25,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:25,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:25,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-10-01 00:56:25,232 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:25,232 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:25,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:25,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:25,233 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:25,233 INFO L87 Difference]: Start difference. First operand 274 states and 354 transitions. Second operand 3 states. [2018-10-01 00:56:25,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:25,412 INFO L93 Difference]: Finished difference Result 543 states and 705 transitions. [2018-10-01 00:56:25,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:25,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-10-01 00:56:25,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:25,420 INFO L225 Difference]: With dead ends: 543 [2018-10-01 00:56:25,420 INFO L226 Difference]: Without dead ends: 277 [2018-10-01 00:56:25,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:25,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-01 00:56:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-10-01 00:56:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-01 00:56:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 352 transitions. [2018-10-01 00:56:25,452 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 352 transitions. Word has length 90 [2018-10-01 00:56:25,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:25,453 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 352 transitions. [2018-10-01 00:56:25,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 352 transitions. [2018-10-01 00:56:25,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-01 00:56:25,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:25,454 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:25,455 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:25,455 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:25,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1448402059, now seen corresponding path program 1 times [2018-10-01 00:56:25,455 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:25,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:25,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:25,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:25,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-01 00:56:25,587 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:25,588 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:25,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:25,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:25,588 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:25,588 INFO L87 Difference]: Start difference. First operand 277 states and 352 transitions. Second operand 3 states. [2018-10-01 00:56:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:25,818 INFO L93 Difference]: Finished difference Result 576 states and 736 transitions. [2018-10-01 00:56:25,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:25,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-10-01 00:56:25,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:25,821 INFO L225 Difference]: With dead ends: 576 [2018-10-01 00:56:25,821 INFO L226 Difference]: Without dead ends: 307 [2018-10-01 00:56:25,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:25,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-01 00:56:25,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-10-01 00:56:25,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-01 00:56:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 382 transitions. [2018-10-01 00:56:25,859 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 382 transitions. Word has length 98 [2018-10-01 00:56:25,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:25,859 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 382 transitions. [2018-10-01 00:56:25,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 382 transitions. [2018-10-01 00:56:25,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-01 00:56:25,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:25,861 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:25,861 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:25,861 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:25,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1388837957, now seen corresponding path program 1 times [2018-10-01 00:56:25,862 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:25,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:25,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:25,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:25,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-10-01 00:56:26,019 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:26,019 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:26,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:26,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:26,020 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:26,020 INFO L87 Difference]: Start difference. First operand 307 states and 382 transitions. Second operand 3 states. [2018-10-01 00:56:26,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:26,171 INFO L93 Difference]: Finished difference Result 606 states and 764 transitions. [2018-10-01 00:56:26,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:26,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-10-01 00:56:26,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:26,178 INFO L225 Difference]: With dead ends: 606 [2018-10-01 00:56:26,178 INFO L226 Difference]: Without dead ends: 403 [2018-10-01 00:56:26,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:26,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-01 00:56:26,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-10-01 00:56:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-01 00:56:26,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 505 transitions. [2018-10-01 00:56:26,231 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 505 transitions. Word has length 108 [2018-10-01 00:56:26,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:26,231 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 505 transitions. [2018-10-01 00:56:26,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:26,231 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 505 transitions. [2018-10-01 00:56:26,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-01 00:56:26,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:26,235 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 12, 11, 10, 9, 8, 7, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:26,235 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:26,235 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:26,236 INFO L82 PathProgramCache]: Analyzing trace with hash 816352441, now seen corresponding path program 1 times [2018-10-01 00:56:26,236 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:26,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:26,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:26,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:26,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-10-01 00:56:26,408 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:26,408 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:26,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:26,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:26,409 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:26,409 INFO L87 Difference]: Start difference. First operand 403 states and 505 transitions. Second operand 3 states. [2018-10-01 00:56:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:26,872 INFO L93 Difference]: Finished difference Result 798 states and 1001 transitions. [2018-10-01 00:56:26,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:26,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-10-01 00:56:26,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:26,875 INFO L225 Difference]: With dead ends: 798 [2018-10-01 00:56:26,875 INFO L226 Difference]: Without dead ends: 403 [2018-10-01 00:56:26,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:26,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-01 00:56:26,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-10-01 00:56:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-01 00:56:26,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 486 transitions. [2018-10-01 00:56:26,937 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 486 transitions. Word has length 148 [2018-10-01 00:56:26,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:26,938 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 486 transitions. [2018-10-01 00:56:26,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:26,938 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 486 transitions. [2018-10-01 00:56:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-01 00:56:26,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:26,941 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 14, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:26,941 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:26,941 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:26,942 INFO L82 PathProgramCache]: Analyzing trace with hash 155947305, now seen corresponding path program 1 times [2018-10-01 00:56:26,942 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:26,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:26,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:26,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:26,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:27,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 741 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-10-01 00:56:27,222 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:56:27,222 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:56:27,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:27,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:56:27,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2018-10-01 00:56:27,818 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:56:27,818 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-01 00:56:27,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:56:27,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:56:27,819 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:27,819 INFO L87 Difference]: Start difference. First operand 403 states and 486 transitions. Second operand 5 states. [2018-10-01 00:56:28,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:28,146 INFO L93 Difference]: Finished difference Result 643 states and 775 transitions. [2018-10-01 00:56:28,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:56:28,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2018-10-01 00:56:28,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:28,150 INFO L225 Difference]: With dead ends: 643 [2018-10-01 00:56:28,150 INFO L226 Difference]: Without dead ends: 0 [2018-10-01 00:56:28,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:56:28,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-01 00:56:28,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-01 00:56:28,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-01 00:56:28,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-01 00:56:28,152 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 191 [2018-10-01 00:56:28,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:28,153 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-01 00:56:28,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:56:28,153 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-01 00:56:28,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 00:56:28,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-01 00:56:28,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:28,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:29,391 WARN L178 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-01 00:56:29,736 WARN L178 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-01 00:56:29,891 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-01 00:56:30,062 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-10-01 00:56:30,234 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-01 00:56:30,498 WARN L178 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2018-10-01 00:56:30,642 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-10-01 00:56:30,830 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-10-01 00:56:31,011 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 7 [2018-10-01 00:56:31,221 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2018-10-01 00:56:31,387 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2018-10-01 00:56:32,068 WARN L178 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-10-01 00:56:32,312 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2018-10-01 00:56:32,546 WARN L178 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-01 00:56:32,588 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-10-01 00:56:32,588 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-10-01 00:56:32,588 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-10-01 00:56:32,588 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-10-01 00:56:32,588 INFO L422 ceAbstractionStarter]: At program point L511(lines 511 515) the Hoare annotation is: false [2018-10-01 00:56:32,588 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 517) no Hoare annotation was computed. [2018-10-01 00:56:32,589 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-10-01 00:56:32,589 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 517) no Hoare annotation was computed. [2018-10-01 00:56:32,589 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-10-01 00:56:32,589 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 516) no Hoare annotation was computed. [2018-10-01 00:56:32,589 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 517) no Hoare annotation was computed. [2018-10-01 00:56:32,589 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-10-01 00:56:32,589 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-10-01 00:56:32,589 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-10-01 00:56:32,590 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-10-01 00:56:32,590 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-10-01 00:56:32,590 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-10-01 00:56:32,590 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-10-01 00:56:32,590 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-10-01 00:56:32,591 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-10-01 00:56:32,591 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-10-01 00:56:32,591 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-10-01 00:56:32,591 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-10-01 00:56:32,591 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-10-01 00:56:32,591 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-10-01 00:56:32,612 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:56:32 BoogieIcfgContainer [2018-10-01 00:56:32,612 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:56:32,613 INFO L168 Benchmark]: Toolchain (without parser) took 19909.54 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 137.4 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 399.8 MB). Peak memory consumption was 537.2 MB. Max. memory is 7.1 GB. [2018-10-01 00:56:32,615 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:56:32,615 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:56:32,616 INFO L168 Benchmark]: Boogie Preprocessor took 36.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:56:32,616 INFO L168 Benchmark]: RCFGBuilder took 759.49 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-01 00:56:32,617 INFO L168 Benchmark]: TraceAbstraction took 19048.93 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 137.4 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 357.6 MB). Peak memory consumption was 494.9 MB. Max. memory is 7.1 GB. [2018-10-01 00:56:32,622 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.73 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 759.49 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19048.93 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 137.4 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 357.6 MB). Peak memory consumption was 494.9 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, 18.9s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 10.5s AutomataDifference, 0.0s DeadEndRemovalTime, 4.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 507 SDtfs, 212 SDslu, 262 SDs, 0 SdLazy, 683 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s 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, 3.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1496 NumberOfCodeBlocks, 1496 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1476 ConstructedInterpolants, 0 QuantifiedInterpolants, 201255 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1211 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 20 InterpolantComputations, 18 PerfectInterpolantSequences, 5308/5324 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.cil.c_23.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-56-32-640.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.cil.c_23.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-56-32-640.csv Received shutdown request...