java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.BV.c.cil.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:53:10,831 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:53:10,833 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:53:10,849 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:53:10,849 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:53:10,850 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:53:10,852 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:53:10,855 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:53:10,858 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:53:10,859 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:53:10,859 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:53:10,861 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:53:10,862 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:53:10,870 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:53:10,871 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:53:10,872 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:53:10,873 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:53:10,877 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:53:10,878 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:53:10,881 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:53:10,884 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:53:10,885 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:53:10,889 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:53:10,889 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:53:10,890 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:53:10,891 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:53:10,891 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:53:10,893 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:53:10,895 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:53:10,896 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:53:10,896 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:53:10,897 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:53:10,897 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:53:10,897 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:53:10,899 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:53:10,901 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:53:10,901 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:10,929 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:53:10,929 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:53:10,930 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:53:10,930 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:53:10,932 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:53:10,932 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:53:10,932 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:53:10,932 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:53:10,932 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:53:10,932 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:53:10,933 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:53:10,933 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:53:10,933 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:53:10,933 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:53:10,933 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:53:10,933 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:53:10,934 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:53:10,934 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:53:10,934 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:53:10,934 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:53:10,934 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:53:10,934 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:53:10,935 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:53:10,935 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:53:10,935 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:53:10,935 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:53:10,935 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:53:10,936 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:53:10,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:53:10,936 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:53:10,936 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:53:10,997 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:53:11,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:53:11,013 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:53:11,014 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:53:11,015 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:53:11,016 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.BV.c.cil.c_21.bpl [2018-10-04 12:53:11,016 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.BV.c.cil.c_21.bpl' [2018-10-04 12:53:11,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:53:11,118 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:53:11,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:53:11,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:53:11,119 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:53:11,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:11" (1/1) ... [2018-10-04 12:53:11,157 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:11" (1/1) ... [2018-10-04 12:53:11,168 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:53:11,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:53:11,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:53:11,169 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:53:11,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:11" (1/1) ... [2018-10-04 12:53:11,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:11" (1/1) ... [2018-10-04 12:53:11,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:11" (1/1) ... [2018-10-04 12:53:11,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:11" (1/1) ... [2018-10-04 12:53:11,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:11" (1/1) ... [2018-10-04 12:53:11,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:11" (1/1) ... [2018-10-04 12:53:11,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:11" (1/1) ... [2018-10-04 12:53:11,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:53:11,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:53:11,219 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:53:11,220 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:53:11,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:53:11,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:53:11,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:53:12,036 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:53:12,037 INFO L202 PluginConnector]: Adding new model s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:53:12 BoogieIcfgContainer [2018-10-04 12:53:12,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:53:12,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:53:12,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:53:12,042 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:53:12,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:11" (1/2) ... [2018-10-04 12:53:12,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b7e07 and model type s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:53:12, skipping insertion in model container [2018-10-04 12:53:12,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:53:12" (2/2) ... [2018-10-04 12:53:12,045 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.BV.c.cil.c_21.bpl [2018-10-04 12:53:12,055 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:53:12,063 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:53:12,113 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:53:12,114 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:53:12,114 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:53:12,114 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:53:12,114 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:53:12,115 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:53:12,115 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:53:12,115 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:53:12,115 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:53:12,131 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-10-04 12:53:12,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:53:12,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:12,139 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:12,140 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:12,147 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:12,147 INFO L82 PathProgramCache]: Analyzing trace with hash -505433777, now seen corresponding path program 1 times [2018-10-04 12:53:12,149 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:12,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:12,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:12,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:12,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:12,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:53:12,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:12,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:12,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:12,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:12,381 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:12,383 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-10-04 12:53:12,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:12,744 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-10-04 12:53:12,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:12,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 12:53:12,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:12,761 INFO L225 Difference]: With dead ends: 56 [2018-10-04 12:53:12,761 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 12:53:12,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:12,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 12:53:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-04 12:53:12,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:53:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-10-04 12:53:12,829 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-10-04 12:53:12,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:12,830 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-10-04 12:53:12,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:12,830 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-10-04 12:53:12,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 12:53:12,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:12,832 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:12,832 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:12,833 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:12,833 INFO L82 PathProgramCache]: Analyzing trace with hash -912155323, now seen corresponding path program 1 times [2018-10-04 12:53:12,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:12,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:12,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:12,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:12,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:12,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:53:12,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:12,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:12,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:12,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:12,959 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:12,959 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-10-04 12:53:13,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:13,129 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-10-04 12:53:13,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:13,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-04 12:53:13,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:13,131 INFO L225 Difference]: With dead ends: 83 [2018-10-04 12:53:13,132 INFO L226 Difference]: Without dead ends: 50 [2018-10-04 12:53:13,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:13,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-04 12:53:13,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-04 12:53:13,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-04 12:53:13,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-10-04 12:53:13,148 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-10-04 12:53:13,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:13,149 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-10-04 12:53:13,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-10-04 12:53:13,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 12:53:13,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:13,152 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:13,153 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:13,153 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:13,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527905, now seen corresponding path program 1 times [2018-10-04 12:53:13,153 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:13,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:13,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:13,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:13,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-04 12:53:13,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:13,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:13,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:13,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:13,260 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:13,260 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-10-04 12:53:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:13,453 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-10-04 12:53:13,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:13,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 12:53:13,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:13,455 INFO L225 Difference]: With dead ends: 106 [2018-10-04 12:53:13,455 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:53:13,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:13,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:53:13,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-04 12:53:13,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 12:53:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-10-04 12:53:13,469 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-10-04 12:53:13,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:13,470 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-10-04 12:53:13,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:13,470 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-10-04 12:53:13,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 12:53:13,471 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:13,472 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:13,472 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:13,472 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:13,472 INFO L82 PathProgramCache]: Analyzing trace with hash 222883017, now seen corresponding path program 1 times [2018-10-04 12:53:13,473 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:13,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:13,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:13,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:13,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:13,545 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:53:13,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:13,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:13,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:13,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:13,547 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:13,547 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-10-04 12:53:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:13,783 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-10-04 12:53:13,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:13,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 12:53:13,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:13,788 INFO L225 Difference]: With dead ends: 131 [2018-10-04 12:53:13,788 INFO L226 Difference]: Without dead ends: 74 [2018-10-04 12:53:13,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:13,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-04 12:53:13,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-04 12:53:13,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-04 12:53:13,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-10-04 12:53:13,805 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-10-04 12:53:13,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:13,806 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-10-04 12:53:13,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:13,806 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-10-04 12:53:13,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 12:53:13,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:13,808 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:13,808 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:13,808 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:13,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189339, now seen corresponding path program 1 times [2018-10-04 12:53:13,809 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:13,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:13,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:13,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:13,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:13,927 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-04 12:53:13,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:13,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:13,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:13,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:13,929 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:13,929 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-10-04 12:53:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:14,270 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-10-04 12:53:14,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:14,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-04 12:53:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:14,272 INFO L225 Difference]: With dead ends: 153 [2018-10-04 12:53:14,272 INFO L226 Difference]: Without dead ends: 80 [2018-10-04 12:53:14,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:14,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-04 12:53:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-04 12:53:14,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-04 12:53:14,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-10-04 12:53:14,289 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-10-04 12:53:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:14,289 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-10-04 12:53:14,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-10-04 12:53:14,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 12:53:14,291 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:14,291 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:14,292 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:14,292 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:14,292 INFO L82 PathProgramCache]: Analyzing trace with hash -720649021, now seen corresponding path program 1 times [2018-10-04 12:53:14,292 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:14,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:14,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:14,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:14,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:14,344 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-04 12:53:14,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:14,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:14,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:14,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:14,346 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:14,346 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-10-04 12:53:14,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:14,547 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-10-04 12:53:14,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:14,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-04 12:53:14,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:14,550 INFO L225 Difference]: With dead ends: 164 [2018-10-04 12:53:14,550 INFO L226 Difference]: Without dead ends: 85 [2018-10-04 12:53:14,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-04 12:53:14,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-04 12:53:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-04 12:53:14,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-10-04 12:53:14,566 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-10-04 12:53:14,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:14,566 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-10-04 12:53:14,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-10-04 12:53:14,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 12:53:14,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:14,568 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:14,569 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:14,569 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:14,569 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268887, now seen corresponding path program 1 times [2018-10-04 12:53:14,569 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:14,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:14,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:14,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:14,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-04 12:53:14,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:14,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:14,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:14,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:14,632 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:14,633 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-10-04 12:53:15,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:15,019 INFO L93 Difference]: Finished difference Result 181 states and 270 transitions. [2018-10-04 12:53:15,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:15,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-04 12:53:15,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:15,021 INFO L225 Difference]: With dead ends: 181 [2018-10-04 12:53:15,021 INFO L226 Difference]: Without dead ends: 96 [2018-10-04 12:53:15,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:15,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-04 12:53:15,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-10-04 12:53:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-04 12:53:15,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2018-10-04 12:53:15,058 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 44 [2018-10-04 12:53:15,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:15,058 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2018-10-04 12:53:15,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:15,061 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2018-10-04 12:53:15,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-04 12:53:15,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:15,063 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:15,063 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:15,063 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:15,063 INFO L82 PathProgramCache]: Analyzing trace with hash 483195845, now seen corresponding path program 1 times [2018-10-04 12:53:15,067 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:15,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:15,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:15,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:15,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:15,158 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-04 12:53:15,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:15,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:15,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:15,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:15,160 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:15,160 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand 3 states. [2018-10-04 12:53:15,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:15,336 INFO L93 Difference]: Finished difference Result 195 states and 285 transitions. [2018-10-04 12:53:15,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:15,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-04 12:53:15,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:15,337 INFO L225 Difference]: With dead ends: 195 [2018-10-04 12:53:15,338 INFO L226 Difference]: Without dead ends: 100 [2018-10-04 12:53:15,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:15,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-04 12:53:15,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-10-04 12:53:15,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-04 12:53:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2018-10-04 12:53:15,373 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 45 [2018-10-04 12:53:15,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:15,374 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2018-10-04 12:53:15,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2018-10-04 12:53:15,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 12:53:15,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:15,381 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:15,382 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:15,382 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:15,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956691, now seen corresponding path program 1 times [2018-10-04 12:53:15,382 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:15,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:15,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:15,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:15,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-04 12:53:15,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:53:15,572 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:15,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:15,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:53:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-04 12:53:16,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:53:16,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-04 12:53:16,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:53:16,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:53:16,413 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:16,413 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand 5 states. [2018-10-04 12:53:18,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:18,155 INFO L93 Difference]: Finished difference Result 441 states and 602 transitions. [2018-10-04 12:53:18,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:53:18,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-10-04 12:53:18,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:18,158 INFO L225 Difference]: With dead ends: 441 [2018-10-04 12:53:18,159 INFO L226 Difference]: Without dead ends: 328 [2018-10-04 12:53:18,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.3s impTime 6 [2018-10-04 12:53:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-04 12:53:18,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 187. [2018-10-04 12:53:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-04 12:53:18,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 247 transitions. [2018-10-04 12:53:18,197 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 247 transitions. Word has length 48 [2018-10-04 12:53:18,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:18,197 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 247 transitions. [2018-10-04 12:53:18,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:53:18,198 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 247 transitions. [2018-10-04 12:53:18,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-04 12:53:18,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:18,199 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:18,200 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:18,200 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:18,200 INFO L82 PathProgramCache]: Analyzing trace with hash 636359981, now seen corresponding path program 1 times [2018-10-04 12:53:18,200 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:18,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:18,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:18,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:18,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:18,304 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-04 12:53:18,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:18,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:18,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:18,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:18,305 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:18,305 INFO L87 Difference]: Start difference. First operand 187 states and 247 transitions. Second operand 3 states. [2018-10-04 12:53:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:18,830 INFO L93 Difference]: Finished difference Result 374 states and 495 transitions. [2018-10-04 12:53:18,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:18,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-10-04 12:53:18,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:18,833 INFO L225 Difference]: With dead ends: 374 [2018-10-04 12:53:18,833 INFO L226 Difference]: Without dead ends: 182 [2018-10-04 12:53:18,834 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:18,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-04 12:53:18,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-10-04 12:53:18,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-04 12:53:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 227 transitions. [2018-10-04 12:53:18,870 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 227 transitions. Word has length 64 [2018-10-04 12:53:18,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:18,870 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 227 transitions. [2018-10-04 12:53:18,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 227 transitions. [2018-10-04 12:53:18,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-04 12:53:18,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:18,872 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:18,873 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:18,873 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:18,873 INFO L82 PathProgramCache]: Analyzing trace with hash -739459377, now seen corresponding path program 1 times [2018-10-04 12:53:18,873 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:18,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:18,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:18,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:18,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:18,989 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-04 12:53:18,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:18,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:18,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:18,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:18,990 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:18,991 INFO L87 Difference]: Start difference. First operand 182 states and 227 transitions. Second operand 3 states. [2018-10-04 12:53:19,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:19,257 INFO L93 Difference]: Finished difference Result 381 states and 475 transitions. [2018-10-04 12:53:19,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:19,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-10-04 12:53:19,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:19,259 INFO L225 Difference]: With dead ends: 381 [2018-10-04 12:53:19,259 INFO L226 Difference]: Without dead ends: 202 [2018-10-04 12:53:19,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:19,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-04 12:53:19,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-10-04 12:53:19,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-04 12:53:19,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 247 transitions. [2018-10-04 12:53:19,297 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 247 transitions. Word has length 97 [2018-10-04 12:53:19,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:19,298 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 247 transitions. [2018-10-04 12:53:19,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 247 transitions. [2018-10-04 12:53:19,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-04 12:53:19,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:19,300 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:19,300 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:19,300 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:19,300 INFO L82 PathProgramCache]: Analyzing trace with hash -93746177, now seen corresponding path program 1 times [2018-10-04 12:53:19,301 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:19,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:19,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:19,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:19,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-10-04 12:53:19,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:19,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:19,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:19,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:19,453 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:19,453 INFO L87 Difference]: Start difference. First operand 202 states and 247 transitions. Second operand 3 states. [2018-10-04 12:53:19,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:19,709 INFO L93 Difference]: Finished difference Result 298 states and 365 transitions. [2018-10-04 12:53:19,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:19,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-10-04 12:53:19,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:19,712 INFO L225 Difference]: With dead ends: 298 [2018-10-04 12:53:19,712 INFO L226 Difference]: Without dead ends: 296 [2018-10-04 12:53:19,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:19,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-04 12:53:19,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-10-04 12:53:19,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-04 12:53:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 363 transitions. [2018-10-04 12:53:19,765 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 363 transitions. Word has length 107 [2018-10-04 12:53:19,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:19,766 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 363 transitions. [2018-10-04 12:53:19,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:19,766 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 363 transitions. [2018-10-04 12:53:19,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-04 12:53:19,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:19,768 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 12, 11, 10, 9, 8, 7, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:19,769 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:19,769 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:19,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1497686773, now seen corresponding path program 1 times [2018-10-04 12:53:19,769 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:19,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:19,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:19,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:19,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:19,962 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-10-04 12:53:19,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:19,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:19,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:19,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:19,963 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:19,963 INFO L87 Difference]: Start difference. First operand 296 states and 363 transitions. Second operand 3 states. [2018-10-04 12:53:20,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:20,287 INFO L93 Difference]: Finished difference Result 589 states and 723 transitions. [2018-10-04 12:53:20,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:20,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-10-04 12:53:20,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:20,290 INFO L225 Difference]: With dead ends: 589 [2018-10-04 12:53:20,290 INFO L226 Difference]: Without dead ends: 296 [2018-10-04 12:53:20,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:20,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-04 12:53:20,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-10-04 12:53:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-04 12:53:20,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 354 transitions. [2018-10-04 12:53:20,330 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 354 transitions. Word has length 147 [2018-10-04 12:53:20,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:20,330 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 354 transitions. [2018-10-04 12:53:20,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 354 transitions. [2018-10-04 12:53:20,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-04 12:53:20,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:20,333 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 14, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:20,333 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:20,333 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:20,333 INFO L82 PathProgramCache]: Analyzing trace with hash -663980831, now seen corresponding path program 1 times [2018-10-04 12:53:20,334 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:20,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:20,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:20,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:20,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-10-04 12:53:20,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:53:20,509 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:20,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:20,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:53:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-10-04 12:53:21,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:53:21,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:53:21,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:53:21,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:53:21,022 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:21,022 INFO L87 Difference]: Start difference. First operand 296 states and 354 transitions. Second operand 4 states. [2018-10-04 12:53:21,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:21,285 INFO L93 Difference]: Finished difference Result 470 states and 566 transitions. [2018-10-04 12:53:21,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:53:21,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-10-04 12:53:21,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:21,286 INFO L225 Difference]: With dead ends: 470 [2018-10-04 12:53:21,286 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:53:21,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.0s impTime 3 [2018-10-04 12:53:21,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:53:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:53:21,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:53:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:53:21,288 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-10-04 12:53:21,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:21,288 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:53:21,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:53:21,288 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:53:21,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:53:21,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:53:21,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:21,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:22,241 WARN L178 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-04 12:53:24,201 WARN L178 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-10-04 12:53:24,822 WARN L178 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2018-10-04 12:53:25,166 WARN L178 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 23 [2018-10-04 12:53:25,498 WARN L178 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-10-04 12:53:25,851 WARN L178 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2018-10-04 12:53:26,036 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2018-10-04 12:53:26,212 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-04 12:53:26,430 WARN L178 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-10-04 12:53:26,541 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2018-10-04 12:53:26,704 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2018-10-04 12:53:27,158 WARN L178 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-10-04 12:53:27,304 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-10-04 12:53:27,563 WARN L178 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2018-10-04 12:53:27,703 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2018-10-04 12:53:27,706 INFO L421 ceAbstractionStarter]: At program point L477(lines 252 477) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-04 12:53:27,706 INFO L421 ceAbstractionStarter]: At program point L279(lines 279 289) the Hoare annotation is: (let ((.cse2 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse3 .cse1 .cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse3 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)))) [2018-10-04 12:53:27,706 INFO L421 ceAbstractionStarter]: At program point L366(lines 366 378) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4))) [2018-10-04 12:53:27,706 INFO L421 ceAbstractionStarter]: At program point L333(lines 333 344) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3)) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse5 .cse6) (and .cse0 .cse2 .cse7 .cse3 .cse4 .cse8 .cse5 .cse6) (and .cse9 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse2 .cse3 .cse8 .cse5 .cse6))) [2018-10-04 12:53:27,707 INFO L421 ceAbstractionStarter]: At program point L453(lines 450 469) the Hoare annotation is: (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) [2018-10-04 12:53:27,707 INFO L421 ceAbstractionStarter]: At program point L292(lines 292 308) the Hoare annotation is: (let ((.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3)) (.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 .cse4 .cse2 .cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse4 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)))) [2018-10-04 12:53:27,707 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 480) no Hoare annotation was computed. [2018-10-04 12:53:27,707 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 480) no Hoare annotation was computed. [2018-10-04 12:53:27,707 INFO L421 ceAbstractionStarter]: At program point L346(lines 346 363) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4))) [2018-10-04 12:53:27,707 INFO L421 ceAbstractionStarter]: At program point L408(lines 408 431) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0 .cse1) (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-04 12:53:27,707 INFO L421 ceAbstractionStarter]: At program point L404(lines 404 415) the Hoare annotation is: (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) [2018-10-04 12:53:27,707 INFO L421 ceAbstractionStarter]: At program point L396(lines 396 405) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse1 .cse2 .cse3) (and .cse0 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-04 12:53:27,708 INFO L421 ceAbstractionStarter]: At program point L417(lines 414 439) the Hoare annotation is: (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) [2018-10-04 12:53:27,708 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 480) no Hoare annotation was computed. [2018-10-04 12:53:27,708 INFO L421 ceAbstractionStarter]: At program point L438(lines 438 460) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) [2018-10-04 12:53:27,708 INFO L421 ceAbstractionStarter]: At program point L430(lines 430 451) the Hoare annotation is: (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) [2018-10-04 12:53:27,708 INFO L421 ceAbstractionStarter]: At program point L459(lines 459 478) the Hoare annotation is: false [2018-10-04 12:53:27,708 INFO L421 ceAbstractionStarter]: At program point L261(lines 224 261) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-04 12:53:27,708 INFO L421 ceAbstractionStarter]: At program point L257(lines 257 276) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-04 12:53:27,708 INFO L421 ceAbstractionStarter]: At program point L381(lines 381 393) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4))) [2018-10-04 12:53:27,709 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 479) no Hoare annotation was computed. [2018-10-04 12:53:27,709 INFO L421 ceAbstractionStarter]: At program point L311(lines 311 328) the Hoare annotation is: (let ((.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3)) (.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse2 .cse3 .cse8 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse7 .cse2 .cse9 .cse5))) [2018-10-04 12:53:27,709 INFO L421 ceAbstractionStarter]: At program point L237(lines 237 253) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-04 12:53:27,728 INFO L202 PluginConnector]: Adding new model s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:53:27 BoogieIcfgContainer [2018-10-04 12:53:27,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:53:27,729 INFO L168 Benchmark]: Toolchain (without parser) took 16612.26 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 115.3 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -88.7 MB). Peak memory consumption was 591.9 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:27,731 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.30 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:27,731 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.02 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:27,732 INFO L168 Benchmark]: Boogie Preprocessor took 49.77 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:27,732 INFO L168 Benchmark]: RCFGBuilder took 818.28 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:27,733 INFO L168 Benchmark]: TraceAbstraction took 15690.05 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 115.3 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -120.5 MB). Peak memory consumption was 560.2 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:27,738 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.30 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 50.02 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 49.77 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 818.28 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 15690.05 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 115.3 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -120.5 MB). Peak memory consumption was 560.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 479]: 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: 224]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 366]: Loop Invariant Derived loop invariant: ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: (((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8640 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: (((ssl3_accept_~blastFlag~5 <= 2 && !(8448 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (((!(8656 == ssl3_accept_~s__state~5) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 333]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 311]: Loop Invariant Derived loop invariant: ((((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5))) || (((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 396]: Loop Invariant Derived loop invariant: (((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8656 == ssl3_accept_~s__state~5)) && !(8640 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: (((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8656 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5) - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5 - InvariantResult [Line: 459]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: (((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8656 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5) - InvariantResult [Line: 252]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 381]: Loop Invariant Derived loop invariant: ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (((ssl3_accept_~blastFlag~5 <= 2 && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: (((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && !(8640 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 292]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. SAFE Result, 15.6s OverallTime, 14 OverallIterations, 19 TraceHistogramMax, 5.5s AutomataDifference, 0.0s DeadEndRemovalTime, 6.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 278 SDtfs, 197 SDslu, 137 SDs, 0 SdLazy, 547 SolverSat, 194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=296occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 141 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 19 PreInvPairs, 220 NumberOfFragments, 1025 HoareAnnotationTreeSize, 19 FomulaSimplifications, 8878 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 19 FomulaSimplificationsInter, 3305 FormulaSimplificationTreeSizeReductionInter, 5.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1151 NumberOfCodeBlocks, 1151 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1135 ConstructedInterpolants, 0 QuantifiedInterpolants, 162691 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1181 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 4505/4529 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.BV.c.cil.c_21.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-53-27-758.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.BV.c.cil.c_21.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-53-27-758.csv Received shutdown request...