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-9f4048f [2018-10-04 12:53:11,063 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:53:11,066 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:53:11,077 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:53:11,078 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:53:11,079 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:53:11,080 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:53:11,082 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:53:11,084 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:53:11,085 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:53:11,085 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:53:11,086 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:53:11,087 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:53:11,088 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:53:11,089 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:53:11,090 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:53:11,091 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:53:11,093 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:53:11,096 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:53:11,098 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:53:11,099 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:53:11,100 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:53:11,103 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:53:11,103 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:53:11,103 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:53:11,104 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:53:11,105 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:53:11,106 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:53:11,107 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:53:11,108 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:53:11,109 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:53:11,110 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:53:11,110 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:53:11,110 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:53:11,111 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:53:11,112 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:53:11,112 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-04 12:53:11,132 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:53:11,132 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:53:11,136 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:53:11,136 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:53:11,137 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:53:11,137 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:53:11,137 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:53:11,137 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:53:11,138 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:53:11,138 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:53:11,138 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:53:11,138 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:53:11,138 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:53:11,138 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:53:11,139 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:53:11,139 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:53:11,139 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:53:11,139 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:53:11,141 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:53:11,141 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:53:11,141 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:53:11,141 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:53:11,142 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:53:11,142 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:53:11,142 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:53:11,142 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:53:11,142 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:53:11,142 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:53:11,143 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:53:11,143 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:53:11,143 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:53:11,195 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:53:11,212 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:53:11,218 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:53:11,220 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:53:11,220 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:53:11,221 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-04 12:53:11,222 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-04 12:53:11,301 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:53:11,302 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:53:11,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:53:11,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:53:11,303 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:53:11,323 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 04.10 12:53:11" (1/1) ... [2018-10-04 12:53:11,340 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 04.10 12:53:11" (1/1) ... [2018-10-04 12:53:11,347 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:53:11,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:53:11,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:53:11,348 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:53:11,360 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 04.10 12:53:11" (1/1) ... [2018-10-04 12:53:11,361 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 04.10 12:53:11" (1/1) ... [2018-10-04 12:53:11,366 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 04.10 12:53:11" (1/1) ... [2018-10-04 12:53:11,367 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 04.10 12:53:11" (1/1) ... [2018-10-04 12:53:11,392 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 04.10 12:53:11" (1/1) ... [2018-10-04 12:53:11,400 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 04.10 12:53:11" (1/1) ... [2018-10-04 12:53:11,403 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 04.10 12:53:11" (1/1) ... [2018-10-04 12:53:11,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:53:11,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:53:11,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:53:11,412 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:53:11,416 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 04.10 12:53:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:53:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:53:11,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:53:12,179 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:53:12,180 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:53:12 BoogieIcfgContainer [2018-10-04 12:53:12,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:53:12,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:53:12,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:53:12,184 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:53:12,185 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 04.10 12:53:11" (1/2) ... [2018-10-04 12:53:12,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ab623 and model type s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:53:12, skipping insertion in model container [2018-10-04 12:53:12,186 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 04.10 12:53:12" (2/2) ... [2018-10-04 12:53:12,188 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil.c_23.bpl [2018-10-04 12:53:12,197 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:53:12,207 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:53:12,249 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:53:12,250 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:53:12,250 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:53:12,251 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:53:12,251 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:53:12,251 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:53:12,251 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:53:12,251 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:53:12,251 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:53:12,267 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-10-04 12:53:12,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:53:12,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:12,279 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:12,280 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:12,285 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:12,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1511424245, now seen corresponding path program 1 times [2018-10-04 12:53:12,287 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:12,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:12,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:12,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:12,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:53:12,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:12,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:12,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:12,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:12,532 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:12,534 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2018-10-04 12:53:12,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:12,911 INFO L93 Difference]: Finished difference Result 60 states and 100 transitions. [2018-10-04 12:53:12,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:12,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 12:53:12,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:12,929 INFO L225 Difference]: With dead ends: 60 [2018-10-04 12:53:12,930 INFO L226 Difference]: Without dead ends: 36 [2018-10-04 12:53:12,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:12,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-04 12:53:12,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-04 12:53:12,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-04 12:53:12,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 60 transitions. [2018-10-04 12:53:12,985 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 60 transitions. Word has length 16 [2018-10-04 12:53:12,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:12,985 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 60 transitions. [2018-10-04 12:53:12,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:12,986 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 60 transitions. [2018-10-04 12:53:12,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 12:53:12,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:12,987 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-04 12:53:12,987 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:12,988 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:12,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1787958207, now seen corresponding path program 1 times [2018-10-04 12:53:12,988 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:12,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:12,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:12,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:12,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:53:13,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:13,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:13,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:13,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:13,100 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:13,100 INFO L87 Difference]: Start difference. First operand 36 states and 60 transitions. Second operand 3 states. [2018-10-04 12:53:13,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:13,269 INFO L93 Difference]: Finished difference Result 87 states and 147 transitions. [2018-10-04 12:53:13,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:13,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-04 12:53:13,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:13,272 INFO L225 Difference]: With dead ends: 87 [2018-10-04 12:53:13,272 INFO L226 Difference]: Without dead ends: 52 [2018-10-04 12:53:13,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:13,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-04 12:53:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-10-04 12:53:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-04 12:53:13,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 86 transitions. [2018-10-04 12:53:13,288 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 86 transitions. Word has length 24 [2018-10-04 12:53:13,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:13,288 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 86 transitions. [2018-10-04 12:53:13,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 86 transitions. [2018-10-04 12:53:13,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 12:53:13,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:13,290 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-04 12:53:13,291 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:13,291 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:13,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1179694243, now seen corresponding path program 1 times [2018-10-04 12:53:13,291 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:13,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:13,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:13,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:13,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:13,370 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-04 12:53:13,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:13,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:13,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:13,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:13,371 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:13,372 INFO L87 Difference]: Start difference. First operand 52 states and 86 transitions. Second operand 3 states. [2018-10-04 12:53:13,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:13,539 INFO L93 Difference]: Finished difference Result 110 states and 183 transitions. [2018-10-04 12:53:13,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:13,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-04 12:53:13,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:13,545 INFO L225 Difference]: With dead ends: 110 [2018-10-04 12:53:13,545 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:53:13,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:13,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:53:13,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-04 12:53:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 12:53:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 95 transitions. [2018-10-04 12:53:13,572 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 95 transitions. Word has length 31 [2018-10-04 12:53:13,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:13,573 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 95 transitions. [2018-10-04 12:53:13,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:13,573 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 95 transitions. [2018-10-04 12:53:13,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 12:53:13,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:13,575 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-04 12:53:13,575 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:13,576 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:13,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1680558917, now seen corresponding path program 1 times [2018-10-04 12:53:13,576 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:13,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:13,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:13,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:13,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:13,745 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-04 12:53:13,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:13,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:13,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:13,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:13,746 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:13,747 INFO L87 Difference]: Start difference. First operand 59 states and 95 transitions. Second operand 3 states. [2018-10-04 12:53:14,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:14,075 INFO L93 Difference]: Finished difference Result 135 states and 220 transitions. [2018-10-04 12:53:14,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:14,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-04 12:53:14,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:14,077 INFO L225 Difference]: With dead ends: 135 [2018-10-04 12:53:14,078 INFO L226 Difference]: Without dead ends: 76 [2018-10-04 12:53:14,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:14,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-04 12:53:14,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-04 12:53:14,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-04 12:53:14,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 123 transitions. [2018-10-04 12:53:14,092 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 123 transitions. Word has length 31 [2018-10-04 12:53:14,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:14,093 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 123 transitions. [2018-10-04 12:53:14,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:14,093 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 123 transitions. [2018-10-04 12:53:14,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 12:53:14,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:14,095 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-04 12:53:14,095 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:14,095 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:14,095 INFO L82 PathProgramCache]: Analyzing trace with hash -2026096289, now seen corresponding path program 1 times [2018-10-04 12:53:14,096 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:14,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:14,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:14,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:14,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:14,151 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-04 12:53:14,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:14,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:14,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:14,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:14,153 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:14,153 INFO L87 Difference]: Start difference. First operand 76 states and 123 transitions. Second operand 3 states. [2018-10-04 12:53:14,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:14,299 INFO L93 Difference]: Finished difference Result 157 states and 255 transitions. [2018-10-04 12:53:14,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:14,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-04 12:53:14,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:14,301 INFO L225 Difference]: With dead ends: 157 [2018-10-04 12:53:14,301 INFO L226 Difference]: Without dead ends: 82 [2018-10-04 12:53:14,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:14,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-04 12:53:14,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-10-04 12:53:14,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-04 12:53:14,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 128 transitions. [2018-10-04 12:53:14,322 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 128 transitions. Word has length 37 [2018-10-04 12:53:14,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:14,322 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 128 transitions. [2018-10-04 12:53:14,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:14,326 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 128 transitions. [2018-10-04 12:53:14,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 12:53:14,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:14,329 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-04 12:53:14,329 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:14,329 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:14,329 INFO L82 PathProgramCache]: Analyzing trace with hash -865281023, now seen corresponding path program 1 times [2018-10-04 12:53:14,329 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:14,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:14,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:14,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:14,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:14,405 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-04 12:53:14,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:14,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:14,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:14,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:14,407 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:14,407 INFO L87 Difference]: Start difference. First operand 82 states and 128 transitions. Second operand 3 states. [2018-10-04 12:53:14,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:14,568 INFO L93 Difference]: Finished difference Result 168 states and 263 transitions. [2018-10-04 12:53:14,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:14,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-04 12:53:14,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:14,571 INFO L225 Difference]: With dead ends: 168 [2018-10-04 12:53:14,571 INFO L226 Difference]: Without dead ends: 87 [2018-10-04 12:53:14,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:14,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-04 12:53:14,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-10-04 12:53:14,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-04 12:53:14,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2018-10-04 12:53:14,588 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 130 transitions. Word has length 42 [2018-10-04 12:53:14,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:14,588 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 130 transitions. [2018-10-04 12:53:14,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:14,588 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 130 transitions. [2018-10-04 12:53:14,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-04 12:53:14,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:14,590 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-04 12:53:14,591 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:14,591 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:14,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1951176091, now seen corresponding path program 1 times [2018-10-04 12:53:14,591 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:14,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:14,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:14,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:14,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:14,647 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-04 12:53:14,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:14,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:14,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:14,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:14,648 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:14,649 INFO L87 Difference]: Start difference. First operand 87 states and 130 transitions. Second operand 3 states. [2018-10-04 12:53:15,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:15,074 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2018-10-04 12:53:15,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:15,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-04 12:53:15,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:15,076 INFO L225 Difference]: With dead ends: 185 [2018-10-04 12:53:15,076 INFO L226 Difference]: Without dead ends: 98 [2018-10-04 12:53:15,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:15,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-04 12:53:15,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-10-04 12:53:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-04 12:53:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2018-10-04 12:53:15,095 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 45 [2018-10-04 12:53:15,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:15,095 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2018-10-04 12:53:15,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:15,095 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2018-10-04 12:53:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 12:53:15,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:15,097 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-04 12:53:15,098 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:15,098 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:15,098 INFO L82 PathProgramCache]: Analyzing trace with hash 2094171455, now seen corresponding path program 1 times [2018-10-04 12:53:15,098 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:15,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:15,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:15,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:15,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:15,223 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-04 12:53:15,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:15,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:15,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:15,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:15,225 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:15,225 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand 3 states. [2018-10-04 12:53:15,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:15,475 INFO L93 Difference]: Finished difference Result 285 states and 418 transitions. [2018-10-04 12:53:15,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:15,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-10-04 12:53:15,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:15,478 INFO L225 Difference]: With dead ends: 285 [2018-10-04 12:53:15,478 INFO L226 Difference]: Without dead ends: 188 [2018-10-04 12:53:15,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:15,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-04 12:53:15,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-10-04 12:53:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-04 12:53:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2018-10-04 12:53:15,529 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 46 [2018-10-04 12:53:15,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:15,530 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2018-10-04 12:53:15,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:15,530 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2018-10-04 12:53:15,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-04 12:53:15,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:15,535 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-04 12:53:15,537 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:15,538 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:15,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1814017687, now seen corresponding path program 1 times [2018-10-04 12:53:15,538 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:15,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:15,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:15,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:15,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:15,718 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-04 12:53:15,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:53:15,718 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-04 12:53:15,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:53:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:15,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:53:16,016 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-04 12:53:16,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:53:16,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-04 12:53:16,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:53:16,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:53:16,039 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:16,039 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand 5 states. [2018-10-04 12:53:18,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:18,249 INFO L93 Difference]: Finished difference Result 695 states and 974 transitions. [2018-10-04 12:53:18,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:53:18,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-10-04 12:53:18,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:18,255 INFO L225 Difference]: With dead ends: 695 [2018-10-04 12:53:18,255 INFO L226 Difference]: Without dead ends: 486 [2018-10-04 12:53:18,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 6 [2018-10-04 12:53:18,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-10-04 12:53:18,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 280. [2018-10-04 12:53:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-04 12:53:18,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 381 transitions. [2018-10-04 12:53:18,315 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 381 transitions. Word has length 49 [2018-10-04 12:53:18,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:18,316 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 381 transitions. [2018-10-04 12:53:18,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:53:18,316 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 381 transitions. [2018-10-04 12:53:18,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-04 12:53:18,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:18,318 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-04 12:53:18,324 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:18,324 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:18,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1561426047, now seen corresponding path program 1 times [2018-10-04 12:53:18,325 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:18,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:18,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:18,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:18,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:18,444 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-04 12:53:18,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:18,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:18,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:18,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:18,446 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:18,446 INFO L87 Difference]: Start difference. First operand 280 states and 381 transitions. Second operand 3 states. [2018-10-04 12:53:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:18,714 INFO L93 Difference]: Finished difference Result 466 states and 642 transitions. [2018-10-04 12:53:18,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:18,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-10-04 12:53:18,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:18,717 INFO L225 Difference]: With dead ends: 466 [2018-10-04 12:53:18,717 INFO L226 Difference]: Without dead ends: 279 [2018-10-04 12:53:18,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:18,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-04 12:53:18,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-10-04 12:53:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-04 12:53:18,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 378 transitions. [2018-10-04 12:53:18,762 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 378 transitions. Word has length 68 [2018-10-04 12:53:18,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:18,762 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 378 transitions. [2018-10-04 12:53:18,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:18,763 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 378 transitions. [2018-10-04 12:53:18,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-04 12:53:18,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:18,764 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-04 12:53:18,765 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:18,765 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:18,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1819686273, now seen corresponding path program 1 times [2018-10-04 12:53:18,765 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:18,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:18,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:18,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:18,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:18,861 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-04 12:53:18,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:18,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:18,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:18,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:18,863 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:18,863 INFO L87 Difference]: Start difference. First operand 279 states and 378 transitions. Second operand 3 states. [2018-10-04 12:53:19,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:19,103 INFO L93 Difference]: Finished difference Result 464 states and 636 transitions. [2018-10-04 12:53:19,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:19,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-10-04 12:53:19,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:19,105 INFO L225 Difference]: With dead ends: 464 [2018-10-04 12:53:19,106 INFO L226 Difference]: Without dead ends: 278 [2018-10-04 12:53:19,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:19,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-04 12:53:19,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-10-04 12:53:19,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-04 12:53:19,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 374 transitions. [2018-10-04 12:53:19,147 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 374 transitions. Word has length 72 [2018-10-04 12:53:19,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:19,147 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 374 transitions. [2018-10-04 12:53:19,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:19,147 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 374 transitions. [2018-10-04 12:53:19,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-04 12:53:19,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:19,149 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-04 12:53:19,149 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:19,149 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:19,149 INFO L82 PathProgramCache]: Analyzing trace with hash 642028047, now seen corresponding path program 1 times [2018-10-04 12:53:19,149 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:19,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:19,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:19,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:19,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:19,212 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-04 12:53:19,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:19,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:19,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:19,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:19,214 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:19,214 INFO L87 Difference]: Start difference. First operand 278 states and 374 transitions. Second operand 3 states. [2018-10-04 12:53:19,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:19,380 INFO L93 Difference]: Finished difference Result 548 states and 739 transitions. [2018-10-04 12:53:19,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:19,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-10-04 12:53:19,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:19,383 INFO L225 Difference]: With dead ends: 548 [2018-10-04 12:53:19,383 INFO L226 Difference]: Without dead ends: 276 [2018-10-04 12:53:19,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:19,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-04 12:53:19,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2018-10-04 12:53:19,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-04 12:53:19,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 364 transitions. [2018-10-04 12:53:19,449 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 364 transitions. Word has length 77 [2018-10-04 12:53:19,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:19,449 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 364 transitions. [2018-10-04 12:53:19,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 364 transitions. [2018-10-04 12:53:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-04 12:53:19,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:19,451 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-04 12:53:19,451 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:19,451 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:19,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1765416395, now seen corresponding path program 1 times [2018-10-04 12:53:19,452 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:19,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:19,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:19,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:19,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:19,562 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-04 12:53:19,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:19,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:19,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:19,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:19,563 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:19,563 INFO L87 Difference]: Start difference. First operand 276 states and 364 transitions. Second operand 3 states. [2018-10-04 12:53:20,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:20,038 INFO L93 Difference]: Finished difference Result 543 states and 718 transitions. [2018-10-04 12:53:20,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:20,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-10-04 12:53:20,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:20,041 INFO L225 Difference]: With dead ends: 543 [2018-10-04 12:53:20,041 INFO L226 Difference]: Without dead ends: 274 [2018-10-04 12:53:20,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:20,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-04 12:53:20,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-10-04 12:53:20,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-04 12:53:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 354 transitions. [2018-10-04 12:53:20,077 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 354 transitions. Word has length 83 [2018-10-04 12:53:20,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:20,077 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 354 transitions. [2018-10-04 12:53:20,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:20,078 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 354 transitions. [2018-10-04 12:53:20,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-04 12:53:20,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:20,079 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-04 12:53:20,079 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:20,079 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:20,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1105856767, now seen corresponding path program 1 times [2018-10-04 12:53:20,080 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:20,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:20,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:20,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:20,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:20,186 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-04 12:53:20,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:20,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:20,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:20,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:20,187 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:20,187 INFO L87 Difference]: Start difference. First operand 274 states and 354 transitions. Second operand 3 states. [2018-10-04 12:53:20,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:20,450 INFO L93 Difference]: Finished difference Result 543 states and 705 transitions. [2018-10-04 12:53:20,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:20,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-10-04 12:53:20,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:20,453 INFO L225 Difference]: With dead ends: 543 [2018-10-04 12:53:20,453 INFO L226 Difference]: Without dead ends: 277 [2018-10-04 12:53:20,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:20,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-04 12:53:20,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-10-04 12:53:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-04 12:53:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 352 transitions. [2018-10-04 12:53:20,484 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 352 transitions. Word has length 90 [2018-10-04 12:53:20,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:20,484 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 352 transitions. [2018-10-04 12:53:20,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:20,485 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 352 transitions. [2018-10-04 12:53:20,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-04 12:53:20,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:20,486 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-04 12:53:20,486 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:20,486 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:20,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1448402059, now seen corresponding path program 1 times [2018-10-04 12:53:20,487 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:20,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:20,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:20,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:20,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:20,585 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-04 12:53:20,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:20,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:20,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:20,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:20,586 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:20,586 INFO L87 Difference]: Start difference. First operand 277 states and 352 transitions. Second operand 3 states. [2018-10-04 12:53:21,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:21,105 INFO L93 Difference]: Finished difference Result 576 states and 736 transitions. [2018-10-04 12:53:21,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:21,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-10-04 12:53:21,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:21,108 INFO L225 Difference]: With dead ends: 576 [2018-10-04 12:53:21,108 INFO L226 Difference]: Without dead ends: 307 [2018-10-04 12:53:21,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:21,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-04 12:53:21,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-10-04 12:53:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-04 12:53:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 382 transitions. [2018-10-04 12:53:21,149 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 382 transitions. Word has length 98 [2018-10-04 12:53:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:21,149 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 382 transitions. [2018-10-04 12:53:21,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:21,150 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 382 transitions. [2018-10-04 12:53:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-04 12:53:21,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:21,151 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-04 12:53:21,152 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:21,152 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:21,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1388837957, now seen corresponding path program 1 times [2018-10-04 12:53:21,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:21,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:21,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:21,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:21,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:21,281 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-04 12:53:21,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:21,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:21,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:21,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:21,283 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:21,283 INFO L87 Difference]: Start difference. First operand 307 states and 382 transitions. Second operand 3 states. [2018-10-04 12:53:21,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:21,610 INFO L93 Difference]: Finished difference Result 606 states and 764 transitions. [2018-10-04 12:53:21,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:21,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-10-04 12:53:21,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:21,616 INFO L225 Difference]: With dead ends: 606 [2018-10-04 12:53:21,616 INFO L226 Difference]: Without dead ends: 403 [2018-10-04 12:53:21,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:21,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-04 12:53:21,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-10-04 12:53:21,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-04 12:53:21,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 505 transitions. [2018-10-04 12:53:21,673 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 505 transitions. Word has length 108 [2018-10-04 12:53:21,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:21,674 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 505 transitions. [2018-10-04 12:53:21,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 505 transitions. [2018-10-04 12:53:21,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-04 12:53:21,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:21,679 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-04 12:53:21,679 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:21,679 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:21,679 INFO L82 PathProgramCache]: Analyzing trace with hash 816352441, now seen corresponding path program 1 times [2018-10-04 12:53:21,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:21,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:21,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:21,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:21,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:21,858 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-04 12:53:21,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:21,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:21,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:21,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:21,860 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:21,860 INFO L87 Difference]: Start difference. First operand 403 states and 505 transitions. Second operand 3 states. [2018-10-04 12:53:22,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:22,365 INFO L93 Difference]: Finished difference Result 798 states and 1001 transitions. [2018-10-04 12:53:22,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:22,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-10-04 12:53:22,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:22,371 INFO L225 Difference]: With dead ends: 798 [2018-10-04 12:53:22,371 INFO L226 Difference]: Without dead ends: 403 [2018-10-04 12:53:22,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:22,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-04 12:53:22,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-10-04 12:53:22,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-04 12:53:22,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 486 transitions. [2018-10-04 12:53:22,418 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 486 transitions. Word has length 148 [2018-10-04 12:53:22,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:22,418 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 486 transitions. [2018-10-04 12:53:22,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:22,419 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 486 transitions. [2018-10-04 12:53:22,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-04 12:53:22,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:22,421 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-04 12:53:22,421 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:22,421 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:22,422 INFO L82 PathProgramCache]: Analyzing trace with hash 155947305, now seen corresponding path program 1 times [2018-10-04 12:53:22,422 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:22,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:22,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:22,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:22,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:22,668 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-04 12:53:22,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:53:22,669 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-04 12:53:22,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:22,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:53:22,907 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-04 12:53:22,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:53:22,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-04 12:53:22,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:53:22,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:53:22,931 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:22,931 INFO L87 Difference]: Start difference. First operand 403 states and 486 transitions. Second operand 5 states. [2018-10-04 12:53:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:23,101 INFO L93 Difference]: Finished difference Result 643 states and 775 transitions. [2018-10-04 12:53:23,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:53:23,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2018-10-04 12:53:23,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:23,103 INFO L225 Difference]: With dead ends: 643 [2018-10-04 12:53:23,103 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:53:23,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 4 [2018-10-04 12:53:23,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:53:23,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:53:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:53:23,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:53:23,105 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 191 [2018-10-04 12:53:23,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:23,105 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:53:23,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:53:23,106 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:53:23,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:53:23,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:53:23,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:23,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:25,588 WARN L178 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-04 12:53:27,588 WARN L178 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-04 12:53:27,784 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-04 12:53:28,289 WARN L178 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-10-04 12:53:28,704 WARN L178 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-04 12:53:29,461 WARN L178 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2018-10-04 12:53:29,701 WARN L178 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-10-04 12:53:29,994 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2018-10-04 12:53:30,185 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2018-10-04 12:53:30,294 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-10-04 12:53:30,625 WARN L178 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2018-10-04 12:53:30,818 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-04 12:53:30,848 INFO L421 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-04 12:53:30,848 INFO L421 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-04 12:53:30,848 INFO L421 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-04 12:53:30,849 INFO L421 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-04 12:53:30,849 INFO L421 ceAbstractionStarter]: At program point L511(lines 511 515) the Hoare annotation is: false [2018-10-04 12:53:30,849 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 517) no Hoare annotation was computed. [2018-10-04 12:53:30,849 INFO L421 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-04 12:53:30,849 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 517) no Hoare annotation was computed. [2018-10-04 12:53:30,849 INFO L421 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-04 12:53:30,849 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 517) no Hoare annotation was computed. [2018-10-04 12:53:30,849 INFO L421 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-04 12:53:30,849 INFO L421 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-04 12:53:30,850 INFO L421 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-04 12:53:30,850 INFO L421 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-04 12:53:30,850 INFO L421 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-04 12:53:30,850 INFO L421 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-04 12:53:30,850 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 516) no Hoare annotation was computed. [2018-10-04 12:53:30,851 INFO L421 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-04 12:53:30,851 INFO L421 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-04 12:53:30,851 INFO L421 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-04 12:53:30,851 INFO L421 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-04 12:53:30,851 INFO L421 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-04 12:53:30,852 INFO L421 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-04 12:53:30,852 INFO L421 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-04 12:53:30,852 INFO L421 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-04 12:53:30,873 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:53:30 BoogieIcfgContainer [2018-10-04 12:53:30,873 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:53:30,874 INFO L168 Benchmark]: Toolchain (without parser) took 19572.60 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 121.1 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 183.3 MB). Peak memory consumption was 587.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:30,875 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:53:30,876 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:53:30,876 INFO L168 Benchmark]: Boogie Preprocessor took 63.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:53:30,877 INFO L168 Benchmark]: RCFGBuilder took 768.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:30,878 INFO L168 Benchmark]: TraceAbstraction took 18691.87 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 121.1 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 151.6 MB). Peak memory consumption was 555.4 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:30,882 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.22 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 44.52 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 63.08 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 768.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18691.87 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 121.1 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 151.6 MB). Peak memory consumption was 555.4 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.6s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 7.2s AutomataDifference, 0.0s DeadEndRemovalTime, 7.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 507 SDtfs, 212 SDslu, 262 SDs, 0 SdLazy, 683 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s 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.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 206 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 21 PreInvPairs, 292 NumberOfFragments, 760 HoareAnnotationTreeSize, 21 FomulaSimplifications, 12583 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 21 FomulaSimplificationsInter, 2497 FormulaSimplificationTreeSizeReductionInter, 7.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s 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-04_12-53-30-900.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-04_12-53-30-900.csv Received shutdown request...