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_clnt_2.cil.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:53:00,142 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:53:00,144 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:53:00,161 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:53:00,162 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:53:00,163 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:53:00,164 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:53:00,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:53:00,168 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:53:00,168 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:53:00,169 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:53:00,170 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:53:00,170 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:53:00,172 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:53:00,176 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:53:00,180 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:53:00,181 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:53:00,185 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:53:00,190 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:53:00,191 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:53:00,195 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:53:00,197 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:53:00,203 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:53:00,203 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:53:00,203 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:53:00,204 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:53:00,205 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:53:00,208 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:53:00,209 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:53:00,210 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:53:00,210 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:53:00,212 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:53:00,212 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:53:00,213 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:53:00,214 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:53:00,214 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:53:00,215 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:00,242 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:53:00,243 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:53:00,244 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:53:00,244 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:53:00,247 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:53:00,247 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:53:00,248 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:53:00,251 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:53:00,251 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:53:00,251 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:53:00,251 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:53:00,252 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:53:00,252 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:53:00,252 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:53:00,252 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:53:00,252 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:53:00,253 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:53:00,253 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:53:00,253 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:53:00,253 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:53:00,253 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:53:00,254 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:53:00,255 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:53:00,255 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:53:00,255 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:53:00,255 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:53:00,256 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:53:00,256 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:53:00,256 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:53:00,256 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:53:00,256 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:53:00,308 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:53:00,321 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:53:00,326 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:53:00,327 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:53:00,328 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:53:00,329 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_2.cil.c_21.bpl [2018-10-04 12:53:00,329 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_2.cil.c_21.bpl' [2018-10-04 12:53:00,417 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:53:00,423 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:53:00,423 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:53:00,424 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:53:00,424 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:53:00,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:00" (1/1) ... [2018-10-04 12:53:00,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:00" (1/1) ... [2018-10-04 12:53:00,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:53:00,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:53:00,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:53:00,482 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:53:00,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:00" (1/1) ... [2018-10-04 12:53:00,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:00" (1/1) ... [2018-10-04 12:53:00,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:00" (1/1) ... [2018-10-04 12:53:00,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:00" (1/1) ... [2018-10-04 12:53:00,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:00" (1/1) ... [2018-10-04 12:53:00,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:00" (1/1) ... [2018-10-04 12:53:00,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:00" (1/1) ... [2018-10-04 12:53:00,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:53:00,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:53:00,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:53:00,537 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:53:00,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:00" (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:00,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:53:00,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:53:01,513 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:53:01,514 INFO L202 PluginConnector]: Adding new model s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:53:01 BoogieIcfgContainer [2018-10-04 12:53:01,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:53:01,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:53:01,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:53:01,522 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:53:01,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:00" (1/2) ... [2018-10-04 12:53:01,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2387696b and model type s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:53:01, skipping insertion in model container [2018-10-04 12:53:01,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:53:01" (2/2) ... [2018-10-04 12:53:01,527 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil.c_21.bpl [2018-10-04 12:53:01,536 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:53:01,550 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:53:01,605 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:53:01,606 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:53:01,606 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:53:01,606 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:53:01,606 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:53:01,607 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:53:01,609 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:53:01,609 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:53:01,610 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:53:01,629 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-10-04 12:53:01,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:53:01,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:01,644 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:01,646 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:01,652 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:01,653 INFO L82 PathProgramCache]: Analyzing trace with hash 2097985007, now seen corresponding path program 1 times [2018-10-04 12:53:01,655 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:01,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:01,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:01,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:01,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:01,847 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:01,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:01,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:01,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:01,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:01,868 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:01,870 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2018-10-04 12:53:02,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:02,052 INFO L93 Difference]: Finished difference Result 49 states and 80 transitions. [2018-10-04 12:53:02,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:02,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-04 12:53:02,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:02,069 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:53:02,069 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 12:53:02,073 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:02,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 12:53:02,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-04 12:53:02,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:53:02,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2018-10-04 12:53:02,116 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 40 transitions. Word has length 10 [2018-10-04 12:53:02,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:02,116 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 40 transitions. [2018-10-04 12:53:02,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 40 transitions. [2018-10-04 12:53:02,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:53:02,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:02,118 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:02,118 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:02,118 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:02,119 INFO L82 PathProgramCache]: Analyzing trace with hash -509365433, now seen corresponding path program 1 times [2018-10-04 12:53:02,119 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:02,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:02,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:02,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:02,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:02,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:53:02,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:02,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:02,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:02,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:02,222 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:02,222 INFO L87 Difference]: Start difference. First operand 26 states and 40 transitions. Second operand 3 states. [2018-10-04 12:53:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:02,513 INFO L93 Difference]: Finished difference Result 53 states and 83 transitions. [2018-10-04 12:53:02,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:02,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-04 12:53:02,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:02,516 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:53:02,516 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 12:53:02,518 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:02,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 12:53:02,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-04 12:53:02,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:53:02,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2018-10-04 12:53:02,528 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 13 [2018-10-04 12:53:02,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:02,530 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2018-10-04 12:53:02,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:02,531 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2018-10-04 12:53:02,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:53:02,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:02,532 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:02,533 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:02,533 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:02,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1912029775, now seen corresponding path program 1 times [2018-10-04 12:53:02,534 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:02,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:02,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:02,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:02,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:53:02,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:02,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:02,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:02,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:02,612 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:02,613 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 3 states. [2018-10-04 12:53:02,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:02,775 INFO L93 Difference]: Finished difference Result 62 states and 93 transitions. [2018-10-04 12:53:02,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:02,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-04 12:53:02,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:02,778 INFO L225 Difference]: With dead ends: 62 [2018-10-04 12:53:02,778 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:53:02,779 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:02,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:53:02,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 12:53:02,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 12:53:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-10-04 12:53:02,788 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 19 [2018-10-04 12:53:02,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:02,788 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-10-04 12:53:02,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:02,789 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-10-04 12:53:02,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 12:53:02,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:02,790 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:02,790 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:02,791 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:02,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1719277757, now seen corresponding path program 1 times [2018-10-04 12:53:02,791 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:02,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:02,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:02,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:02,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-04 12:53:02,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:02,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:02,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:02,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:02,862 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:02,862 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-10-04 12:53:03,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:03,050 INFO L93 Difference]: Finished difference Result 73 states and 105 transitions. [2018-10-04 12:53:03,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:03,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-04 12:53:03,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:03,052 INFO L225 Difference]: With dead ends: 73 [2018-10-04 12:53:03,052 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:53:03,053 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:03,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:53:03,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-04 12:53:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 12:53:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2018-10-04 12:53:03,060 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 26 [2018-10-04 12:53:03,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:03,060 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2018-10-04 12:53:03,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:03,061 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2018-10-04 12:53:03,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:53:03,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:03,062 INFO L375 BasicCegarLoop]: trace histogram [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:03,062 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:03,063 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:03,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1612801811, now seen corresponding path program 1 times [2018-10-04 12:53:03,063 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:03,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:03,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:03,175 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-04 12:53:03,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:03,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:03,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:03,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:03,178 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:03,178 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand 3 states. [2018-10-04 12:53:03,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:03,405 INFO L93 Difference]: Finished difference Result 86 states and 119 transitions. [2018-10-04 12:53:03,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:03,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 12:53:03,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:03,410 INFO L225 Difference]: With dead ends: 86 [2018-10-04 12:53:03,410 INFO L226 Difference]: Without dead ends: 48 [2018-10-04 12:53:03,413 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:03,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-04 12:53:03,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-10-04 12:53:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-04 12:53:03,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2018-10-04 12:53:03,429 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 34 [2018-10-04 12:53:03,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:03,429 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2018-10-04 12:53:03,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:03,430 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2018-10-04 12:53:03,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 12:53:03,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:03,431 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:03,431 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:03,432 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:03,432 INFO L82 PathProgramCache]: Analyzing trace with hash -168763707, now seen corresponding path program 1 times [2018-10-04 12:53:03,432 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:03,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:03,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:03,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:03,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:03,607 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-04 12:53:03,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:03,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:03,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:03,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:03,609 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:03,609 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand 3 states. [2018-10-04 12:53:03,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:03,732 INFO L93 Difference]: Finished difference Result 136 states and 179 transitions. [2018-10-04 12:53:03,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:03,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-10-04 12:53:03,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:03,734 INFO L225 Difference]: With dead ends: 136 [2018-10-04 12:53:03,734 INFO L226 Difference]: Without dead ends: 91 [2018-10-04 12:53:03,735 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:03,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-04 12:53:03,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-10-04 12:53:03,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-04 12:53:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2018-10-04 12:53:03,749 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 43 [2018-10-04 12:53:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:03,749 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2018-10-04 12:53:03,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:03,750 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2018-10-04 12:53:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 12:53:03,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:03,751 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:03,752 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:03,752 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:03,752 INFO L82 PathProgramCache]: Analyzing trace with hash 253938119, now seen corresponding path program 1 times [2018-10-04 12:53:03,752 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:03,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:03,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:03,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:03,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:03,876 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-04 12:53:03,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:03,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:03,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:03,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:03,877 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:03,878 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand 3 states. [2018-10-04 12:53:03,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:03,932 INFO L93 Difference]: Finished difference Result 188 states and 241 transitions. [2018-10-04 12:53:03,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:03,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-10-04 12:53:03,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:03,936 INFO L225 Difference]: With dead ends: 188 [2018-10-04 12:53:03,936 INFO L226 Difference]: Without dead ends: 100 [2018-10-04 12:53:03,937 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:03,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-04 12:53:03,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-10-04 12:53:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-04 12:53:03,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 126 transitions. [2018-10-04 12:53:03,950 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 126 transitions. Word has length 43 [2018-10-04 12:53:03,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:03,951 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 126 transitions. [2018-10-04 12:53:03,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:03,952 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 126 transitions. [2018-10-04 12:53:03,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 12:53:03,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:03,953 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:03,954 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:03,954 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:03,954 INFO L82 PathProgramCache]: Analyzing trace with hash -4227319, now seen corresponding path program 1 times [2018-10-04 12:53:03,954 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:03,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:03,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:03,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:03,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-04 12:53:04,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:04,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:04,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:04,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:04,018 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:04,018 INFO L87 Difference]: Start difference. First operand 100 states and 126 transitions. Second operand 3 states. [2018-10-04 12:53:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:04,133 INFO L93 Difference]: Finished difference Result 139 states and 179 transitions. [2018-10-04 12:53:04,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:04,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-10-04 12:53:04,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:04,136 INFO L225 Difference]: With dead ends: 139 [2018-10-04 12:53:04,136 INFO L226 Difference]: Without dead ends: 137 [2018-10-04 12:53:04,137 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:04,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-04 12:53:04,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2018-10-04 12:53:04,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-04 12:53:04,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 171 transitions. [2018-10-04 12:53:04,155 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 171 transitions. Word has length 43 [2018-10-04 12:53:04,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:04,156 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 171 transitions. [2018-10-04 12:53:04,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:04,156 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 171 transitions. [2018-10-04 12:53:04,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-04 12:53:04,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:04,158 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 7, 5, 3, 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:04,159 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:04,159 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:04,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1562207431, now seen corresponding path program 1 times [2018-10-04 12:53:04,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:04,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:04,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:04,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:04,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:04,274 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-04 12:53:04,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:04,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:04,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:04,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:04,275 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:04,276 INFO L87 Difference]: Start difference. First operand 132 states and 171 transitions. Second operand 3 states. [2018-10-04 12:53:04,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:04,791 INFO L93 Difference]: Finished difference Result 297 states and 405 transitions. [2018-10-04 12:53:04,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:04,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-10-04 12:53:04,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:04,793 INFO L225 Difference]: With dead ends: 297 [2018-10-04 12:53:04,793 INFO L226 Difference]: Without dead ends: 168 [2018-10-04 12:53:04,794 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:04,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-04 12:53:04,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-10-04 12:53:04,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-04 12:53:04,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 222 transitions. [2018-10-04 12:53:04,825 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 222 transitions. Word has length 73 [2018-10-04 12:53:04,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:04,826 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 222 transitions. [2018-10-04 12:53:04,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:04,826 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 222 transitions. [2018-10-04 12:53:04,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-04 12:53:04,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:04,828 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 9, 7, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:04,828 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:04,829 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:04,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1926453931, now seen corresponding path program 2 times [2018-10-04 12:53:04,829 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:04,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:04,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:04,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:04,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:04,976 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-04 12:53:04,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:04,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:04,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:04,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:04,977 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:04,978 INFO L87 Difference]: Start difference. First operand 168 states and 222 transitions. Second operand 3 states. [2018-10-04 12:53:05,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:05,602 INFO L93 Difference]: Finished difference Result 405 states and 558 transitions. [2018-10-04 12:53:05,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:05,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-10-04 12:53:05,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:05,604 INFO L225 Difference]: With dead ends: 405 [2018-10-04 12:53:05,605 INFO L226 Difference]: Without dead ends: 228 [2018-10-04 12:53:05,606 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:05,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-10-04 12:53:05,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-10-04 12:53:05,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-10-04 12:53:05,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 297 transitions. [2018-10-04 12:53:05,646 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 297 transitions. Word has length 76 [2018-10-04 12:53:05,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:05,647 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 297 transitions. [2018-10-04 12:53:05,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:05,647 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 297 transitions. [2018-10-04 12:53:05,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-04 12:53:05,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:05,655 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:05,655 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:05,655 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:05,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1254900833, now seen corresponding path program 1 times [2018-10-04 12:53:05,656 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:05,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:05,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:05,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:53:05,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:05,783 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-10-04 12:53:05,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:05,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:05,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:05,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:05,785 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:05,785 INFO L87 Difference]: Start difference. First operand 228 states and 297 transitions. Second operand 3 states. [2018-10-04 12:53:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:06,369 INFO L93 Difference]: Finished difference Result 489 states and 642 transitions. [2018-10-04 12:53:06,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:06,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-10-04 12:53:06,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:06,371 INFO L225 Difference]: With dead ends: 489 [2018-10-04 12:53:06,372 INFO L226 Difference]: Without dead ends: 255 [2018-10-04 12:53:06,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:06,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-04 12:53:06,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-10-04 12:53:06,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-04 12:53:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 327 transitions. [2018-10-04 12:53:06,397 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 327 transitions. Word has length 85 [2018-10-04 12:53:06,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:06,398 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 327 transitions. [2018-10-04 12:53:06,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:06,398 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 327 transitions. [2018-10-04 12:53:06,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-04 12:53:06,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:06,400 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 11, 9, 7, 5, 3, 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:06,400 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:06,401 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:06,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1359801879, now seen corresponding path program 1 times [2018-10-04 12:53:06,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:06,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:06,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:06,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:06,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:06,503 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-04 12:53:06,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:06,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:06,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:06,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:06,504 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:06,504 INFO L87 Difference]: Start difference. First operand 255 states and 327 transitions. Second operand 3 states. [2018-10-04 12:53:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:07,012 INFO L93 Difference]: Finished difference Result 543 states and 702 transitions. [2018-10-04 12:53:07,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:07,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-10-04 12:53:07,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:07,014 INFO L225 Difference]: With dead ends: 543 [2018-10-04 12:53:07,015 INFO L226 Difference]: Without dead ends: 285 [2018-10-04 12:53:07,015 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:07,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-10-04 12:53:07,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-10-04 12:53:07,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-04 12:53:07,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 363 transitions. [2018-10-04 12:53:07,039 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 363 transitions. Word has length 94 [2018-10-04 12:53:07,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:07,040 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 363 transitions. [2018-10-04 12:53:07,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:07,040 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 363 transitions. [2018-10-04 12:53:07,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-04 12:53:07,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:07,042 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:07,042 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:07,042 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:07,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1195726822, now seen corresponding path program 1 times [2018-10-04 12:53:07,043 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:07,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:07,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:07,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:07,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-10-04 12:53:07,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:07,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:07,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:07,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:07,153 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:07,153 INFO L87 Difference]: Start difference. First operand 285 states and 363 transitions. Second operand 3 states. [2018-10-04 12:53:07,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:07,604 INFO L93 Difference]: Finished difference Result 603 states and 774 transitions. [2018-10-04 12:53:07,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:07,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-10-04 12:53:07,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:07,607 INFO L225 Difference]: With dead ends: 603 [2018-10-04 12:53:07,607 INFO L226 Difference]: Without dead ends: 318 [2018-10-04 12:53:07,608 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:07,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-04 12:53:07,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-10-04 12:53:07,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-10-04 12:53:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 405 transitions. [2018-10-04 12:53:07,634 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 405 transitions. Word has length 104 [2018-10-04 12:53:07,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:07,634 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 405 transitions. [2018-10-04 12:53:07,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:07,634 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 405 transitions. [2018-10-04 12:53:07,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-04 12:53:07,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:07,636 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 13, 11, 9, 7, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:07,636 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:07,636 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:07,637 INFO L82 PathProgramCache]: Analyzing trace with hash -32649186, now seen corresponding path program 1 times [2018-10-04 12:53:07,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:07,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:07,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:07,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:07,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-10-04 12:53:07,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:07,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:07,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:07,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:07,740 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:07,741 INFO L87 Difference]: Start difference. First operand 318 states and 405 transitions. Second operand 3 states. [2018-10-04 12:53:08,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:08,019 INFO L93 Difference]: Finished difference Result 633 states and 807 transitions. [2018-10-04 12:53:08,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:08,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-10-04 12:53:08,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:08,021 INFO L225 Difference]: With dead ends: 633 [2018-10-04 12:53:08,022 INFO L226 Difference]: Without dead ends: 318 [2018-10-04 12:53:08,023 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:08,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-04 12:53:08,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-10-04 12:53:08,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-10-04 12:53:08,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 402 transitions. [2018-10-04 12:53:08,051 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 402 transitions. Word has length 115 [2018-10-04 12:53:08,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:08,051 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 402 transitions. [2018-10-04 12:53:08,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:08,051 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 402 transitions. [2018-10-04 12:53:08,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-04 12:53:08,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:08,053 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 12, 10, 8, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:08,053 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:08,054 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:08,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1066373693, now seen corresponding path program 1 times [2018-10-04 12:53:08,054 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:08,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:08,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:08,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:08,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:08,203 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-10-04 12:53:08,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:08,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:08,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:08,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:08,204 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:08,204 INFO L87 Difference]: Start difference. First operand 318 states and 402 transitions. Second operand 3 states. [2018-10-04 12:53:08,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:08,772 INFO L93 Difference]: Finished difference Result 633 states and 801 transitions. [2018-10-04 12:53:08,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:08,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-10-04 12:53:08,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:08,774 INFO L225 Difference]: With dead ends: 633 [2018-10-04 12:53:08,775 INFO L226 Difference]: Without dead ends: 318 [2018-10-04 12:53:08,776 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:08,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-04 12:53:08,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-10-04 12:53:08,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-10-04 12:53:08,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 387 transitions. [2018-10-04 12:53:08,846 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 387 transitions. Word has length 124 [2018-10-04 12:53:08,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:08,846 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 387 transitions. [2018-10-04 12:53:08,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:08,846 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 387 transitions. [2018-10-04 12:53:08,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-04 12:53:08,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:08,850 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 13, 11, 9, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:08,850 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:08,850 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:08,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1427413192, now seen corresponding path program 1 times [2018-10-04 12:53:08,851 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:08,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:08,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:08,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:08,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:09,085 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 385 proven. 4 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-10-04 12:53:09,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:53:09,086 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:53:09,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:09,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:53:09,755 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 385 proven. 4 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-10-04 12:53:09,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:53:09,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:53:09,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:53:09,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:53:09,790 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:09,790 INFO L87 Difference]: Start difference. First operand 318 states and 387 transitions. Second operand 4 states. [2018-10-04 12:53:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:10,445 INFO L93 Difference]: Finished difference Result 757 states and 914 transitions. [2018-10-04 12:53:10,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:53:10,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2018-10-04 12:53:10,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:10,448 INFO L225 Difference]: With dead ends: 757 [2018-10-04 12:53:10,448 INFO L226 Difference]: Without dead ends: 415 [2018-10-04 12:53:10,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.1s impTime 3 [2018-10-04 12:53:10,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-10-04 12:53:10,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 255. [2018-10-04 12:53:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-04 12:53:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 291 transitions. [2018-10-04 12:53:10,488 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 291 transitions. Word has length 136 [2018-10-04 12:53:10,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:10,489 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 291 transitions. [2018-10-04 12:53:10,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:53:10,489 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 291 transitions. [2018-10-04 12:53:10,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-04 12:53:10,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:10,491 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 15, 13, 11, 9, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:10,491 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:10,491 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:10,491 INFO L82 PathProgramCache]: Analyzing trace with hash 2065701642, now seen corresponding path program 2 times [2018-10-04 12:53:10,492 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:10,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:10,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:10,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:10,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 417 proven. 3 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2018-10-04 12:53:10,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:53:10,729 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:10,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:53:10,860 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:53:10,861 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:53:10,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:53:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 417 proven. 3 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2018-10-04 12:53:11,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:53:11,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:53:11,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:53:11,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:53:11,057 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:11,057 INFO L87 Difference]: Start difference. First operand 255 states and 291 transitions. Second operand 4 states. [2018-10-04 12:53:11,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:11,908 INFO L93 Difference]: Finished difference Result 429 states and 487 transitions. [2018-10-04 12:53:11,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:53:11,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-10-04 12:53:11,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:11,909 INFO L225 Difference]: With dead ends: 429 [2018-10-04 12:53:11,909 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:53:11,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 3 [2018-10-04 12:53:11,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:53:11,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:53:11,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:53:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:53:11,911 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 139 [2018-10-04 12:53:11,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:11,914 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:53:11,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:53:11,914 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:53:11,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:53:11,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:53:11,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:11,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:11,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:11,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:12,511 WARN L178 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 7 [2018-10-04 12:53:13,310 WARN L178 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2018-10-04 12:53:13,463 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2018-10-04 12:53:14,069 WARN L178 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-10-04 12:53:14,282 WARN L178 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 7 [2018-10-04 12:53:14,590 WARN L178 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-10-04 12:53:14,905 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2018-10-04 12:53:15,232 WARN L178 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-10-04 12:53:15,604 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-10-04 12:53:15,793 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2018-10-04 12:53:15,814 INFO L421 ceAbstractionStarter]: At program point L415(lines 415 432) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4432) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-04 12:53:15,814 INFO L421 ceAbstractionStarter]: At program point L382(lines 373 395) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)))) [2018-10-04 12:53:15,814 INFO L421 ceAbstractionStarter]: At program point L407(lines 404 420) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4416)) [2018-10-04 12:53:15,814 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 459) no Hoare annotation was computed. [2018-10-04 12:53:15,815 INFO L421 ceAbstractionStarter]: At program point L300(lines 261 300) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560)) (.cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse4 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 12292)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4560) .cse3 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 .cse4))) [2018-10-04 12:53:15,815 INFO L421 ceAbstractionStarter]: At program point L296(lines 296 310) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse2 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1) (and .cse0 .cse2))) [2018-10-04 12:53:15,815 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 526) no Hoare annotation was computed. [2018-10-04 12:53:15,815 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 526) no Hoare annotation was computed. [2018-10-04 12:53:15,815 INFO L421 ceAbstractionStarter]: At program point L313(lines 313 333) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse2 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1) (and .cse0 .cse2))) [2018-10-04 12:53:15,816 INFO L421 ceAbstractionStarter]: At program point L309(lines 309 320) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) [2018-10-04 12:53:15,816 INFO L421 ceAbstractionStarter]: At program point L499(lines 499 516) the Hoare annotation is: (let ((.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4))) (or (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) .cse1) (and .cse0 .cse1 .cse2))) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse2))) [2018-10-04 12:53:15,816 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 526) no Hoare annotation was computed. [2018-10-04 12:53:15,816 INFO L421 ceAbstractionStarter]: At program point L351(lines 348 362) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) [2018-10-04 12:53:15,816 INFO L421 ceAbstractionStarter]: At program point L479(lines 479 496) the Hoare annotation is: (let ((.cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) .cse0) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1))) [2018-10-04 12:53:15,816 INFO L421 ceAbstractionStarter]: At program point L525(lines 289 525) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4560) (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse2) (and .cse3 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 .cse3))) [2018-10-04 12:53:15,817 INFO L421 ceAbstractionStarter]: At program point L336(lines 336 358) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse2 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1) (and .cse0 .cse2))) [2018-10-04 12:53:15,817 INFO L421 ceAbstractionStarter]: At program point L431(lines 431 458) the Hoare annotation is: false [2018-10-04 12:53:15,817 INFO L421 ceAbstractionStarter]: At program point L332(lines 332 349) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) [2018-10-04 12:53:15,817 INFO L421 ceAbstractionStarter]: At program point L460(lines 457 474) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4448)))) [2018-10-04 12:53:15,817 INFO L421 ceAbstractionStarter]: At program point L266(lines 266 290) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560)) (.cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse4 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 12292)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4560) .cse3 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 .cse4))) [2018-10-04 12:53:15,817 INFO L421 ceAbstractionStarter]: At program point L394(lines 394 416) the Hoare annotation is: (let ((.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse0))) [2018-10-04 12:53:15,817 INFO L421 ceAbstractionStarter]: At program point L361(lines 361 391) the Hoare annotation is: (let ((.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse1 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse1 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse1))) [2018-10-04 12:53:15,818 INFO L421 ceAbstractionStarter]: At program point L390(lines 390 405) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse0))) [2018-10-04 12:53:15,818 INFO L421 ceAbstractionStarter]: At program point L357(lines 357 374) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) [2018-10-04 12:53:15,818 INFO L421 ceAbstractionStarter]: At program point L324(lines 319 337) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) [2018-10-04 12:53:15,818 INFO L421 ceAbstractionStarter]: At program point L419(lines 419 450) the Hoare annotation is: (let ((.cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4432) .cse0) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1))) [2018-10-04 12:53:15,838 INFO L202 PluginConnector]: Adding new model s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:53:15 BoogieIcfgContainer [2018-10-04 12:53:15,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:53:15,840 INFO L168 Benchmark]: Toolchain (without parser) took 15421.39 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 32.5 MB). Free memory was 1.5 GB in the beginning and 915.0 MB in the end (delta: 561.6 MB). Peak memory consumption was 594.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:15,841 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 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:15,842 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.95 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:15,842 INFO L168 Benchmark]: Boogie Preprocessor took 54.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:53:15,843 INFO L168 Benchmark]: RCFGBuilder took 977.48 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:15,844 INFO L168 Benchmark]: TraceAbstraction took 14321.57 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 32.5 MB). Free memory was 1.4 GB in the beginning and 915.0 MB in the end (delta: 529.9 MB). Peak memory consumption was 562.4 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:15,850 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.24 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 57.95 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 54.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 977.48 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 14321.57 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 32.5 MB). Free memory was 1.4 GB in the beginning and 915.0 MB in the end (delta: 529.9 MB). Peak memory consumption was 562.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 459]: 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: 319]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368 - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: (((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~s__state~4 <= 4432 && 4432 <= ssl3_connect_~s__state~4)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: ((((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && ssl3_connect_~s__state~4 <= 4560) && 4560 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4416 - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (4432 <= ssl3_connect_~s__state~4 && ssl3_connect_~s__state~4 <= 4448) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: ((((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368 - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384 - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: (ssl3_connect_~s__state~4 <= 4432 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 479]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (4432 <= ssl3_connect_~s__state~4 && ssl3_connect_~s__state~4 <= 4480)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: ((((((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 12292)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && ssl3_connect_~s__state~4 <= 4560) && 4560 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || ((ssl3_connect_~blastFlag~4 <= 2 && 4560 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400) || (ssl3_connect_~s__state~4 == 4400 && ssl3_connect_~blastFlag~4 == 3) - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || ((ssl3_connect_~s__state~4 <= 4528 && 4432 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (4432 <= ssl3_connect_~s__state~4 && ssl3_connect_~s__state~4 <= 4512)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 12292)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && ssl3_connect_~s__state~4 <= 4560) && 4560 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || ((ssl3_connect_~blastFlag~4 <= 2 && 4560 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400 - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 1 error locations. SAFE Result, 14.2s OverallTime, 17 OverallIterations, 17 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 3.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 545 SDtfs, 240 SDslu, 220 SDs, 0 SdLazy, 533 SolverSat, 139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 165 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 253 NumberOfFragments, 713 HoareAnnotationTreeSize, 22 FomulaSimplifications, 6566 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1150 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1452 NumberOfCodeBlocks, 1452 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1433 ConstructedInterpolants, 0 QuantifiedInterpolants, 173573 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1255 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 5594/5608 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_2.cil.c_21.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-53-15-871.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_2.cil.c_21.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-53-15-871.csv Received shutdown request...