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_3.cil.c_20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:47:39,876 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:47:39,878 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:47:39,894 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:47:39,894 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:47:39,895 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:47:39,897 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:47:39,898 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:47:39,900 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:47:39,901 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:47:39,902 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:47:39,902 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:47:39,903 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:47:39,904 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:47:39,905 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:47:39,906 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:47:39,907 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:47:39,908 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:47:39,910 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:47:39,911 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:47:39,913 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:47:39,914 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:47:39,918 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:47:39,919 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:47:39,919 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:47:39,920 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:47:39,921 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:47:39,922 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:47:39,925 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:47:39,926 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:47:39,926 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:47:39,927 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:47:39,927 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:47:39,927 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:47:39,929 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:47:39,930 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:47:39,930 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 09:47:39,957 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:47:39,957 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:47:39,958 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:47:39,958 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:47:39,959 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:47:39,959 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:47:39,959 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:47:39,959 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:47:39,960 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:47:39,960 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:47:39,960 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:47:39,960 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:47:39,960 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:47:39,960 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:47:39,961 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:47:39,961 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:47:39,961 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:47:39,961 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:47:39,961 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:47:39,962 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:47:39,962 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:47:39,962 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:47:39,962 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:47:39,962 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:47:39,962 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:47:39,963 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:47:39,963 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:47:39,963 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:47:39,963 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:47:39,963 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:47:39,964 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:47:40,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:47:40,048 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:47:40,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:47:40,057 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:47:40,058 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:47:40,059 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.cil.c_20.bpl [2018-10-04 09:47:40,059 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.cil.c_20.bpl' [2018-10-04 09:47:40,141 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:47:40,143 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:47:40,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:47:40,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:47:40,144 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:47:40,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:47:40,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:47:40,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:47:40,189 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:47:40,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:47:40,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:47:40,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:47:40,230 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:47:40,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:47:40,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:47:40,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:47:41,016 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:47:41,017 INFO L202 PluginConnector]: Adding new model s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:47:41 BoogieIcfgContainer [2018-10-04 09:47:41,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:47:41,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:47:41,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:47:41,021 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:47:41,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/2) ... [2018-10-04 09:47:41,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33808746 and model type s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:47:41, skipping insertion in model container [2018-10-04 09:47:41,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:47:41" (2/2) ... [2018-10-04 09:47:41,024 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c_20.bpl [2018-10-04 09:47:41,034 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:47:41,047 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:47:41,089 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:47:41,090 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:47:41,090 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:47:41,090 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:47:41,091 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:47:41,091 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:47:41,091 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:47:41,091 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:47:41,091 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:47:41,107 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-10-04 09:47:41,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:47:41,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:41,115 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:41,116 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:41,123 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:41,123 INFO L82 PathProgramCache]: Analyzing trace with hash -505433777, now seen corresponding path program 1 times [2018-10-04 09:47:41,126 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:41,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:41,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:41,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:41,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:41,370 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 09:47:41,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:41,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:41,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:41,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:41,391 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:41,392 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-10-04 09:47:41,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:41,822 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-10-04 09:47:41,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:41,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 09:47:41,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:41,856 INFO L225 Difference]: With dead ends: 56 [2018-10-04 09:47:41,857 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 09:47:41,860 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 09:47:41,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 09:47:41,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-04 09:47:41,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:47:41,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-10-04 09:47:41,899 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-10-04 09:47:41,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:41,900 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-10-04 09:47:41,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:41,900 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-10-04 09:47:41,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 09:47:41,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:41,901 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 09:47:41,902 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:41,902 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:41,902 INFO L82 PathProgramCache]: Analyzing trace with hash -912155323, now seen corresponding path program 1 times [2018-10-04 09:47:41,903 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:41,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:41,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:41,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:41,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:41,996 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 09:47:41,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:41,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:41,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:41,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:41,999 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:41,999 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-10-04 09:47:42,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:42,141 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-10-04 09:47:42,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:42,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-04 09:47:42,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:42,144 INFO L225 Difference]: With dead ends: 83 [2018-10-04 09:47:42,144 INFO L226 Difference]: Without dead ends: 50 [2018-10-04 09:47:42,145 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 09:47:42,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-04 09:47:42,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-04 09:47:42,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-04 09:47:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-10-04 09:47:42,166 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-10-04 09:47:42,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:42,166 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-10-04 09:47:42,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:42,167 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-10-04 09:47:42,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:47:42,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:42,168 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 09:47:42,169 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:42,169 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:42,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527905, now seen corresponding path program 1 times [2018-10-04 09:47:42,169 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:42,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:42,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:42,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:42,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:42,251 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 09:47:42,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:42,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:42,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:42,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:42,253 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:42,253 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-10-04 09:47:42,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:42,544 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-10-04 09:47:42,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:42,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 09:47:42,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:42,546 INFO L225 Difference]: With dead ends: 106 [2018-10-04 09:47:42,546 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:47:42,547 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 09:47:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:47:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-04 09:47:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 09:47:42,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-10-04 09:47:42,562 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-10-04 09:47:42,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:42,562 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-10-04 09:47:42,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:42,562 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-10-04 09:47:42,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:47:42,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:42,564 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 09:47:42,564 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:42,564 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:42,565 INFO L82 PathProgramCache]: Analyzing trace with hash 222883017, now seen corresponding path program 1 times [2018-10-04 09:47:42,565 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:42,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:42,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:42,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:42,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:42,632 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 09:47:42,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:42,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:42,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:42,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:42,636 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:42,636 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-10-04 09:47:42,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:42,852 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-10-04 09:47:42,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:42,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 09:47:42,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:42,854 INFO L225 Difference]: With dead ends: 131 [2018-10-04 09:47:42,854 INFO L226 Difference]: Without dead ends: 74 [2018-10-04 09:47:42,855 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 09:47:42,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-04 09:47:42,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-04 09:47:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-04 09:47:42,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-10-04 09:47:42,869 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-10-04 09:47:42,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:42,870 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-10-04 09:47:42,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:42,870 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-10-04 09:47:42,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 09:47:42,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:42,872 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 09:47:42,872 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:42,872 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:42,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189339, now seen corresponding path program 1 times [2018-10-04 09:47:42,872 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:42,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:42,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:42,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:42,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:42,948 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 09:47:42,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:42,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:42,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:42,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:42,949 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:42,949 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-10-04 09:47:43,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:43,316 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-10-04 09:47:43,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:43,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-04 09:47:43,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:43,319 INFO L225 Difference]: With dead ends: 153 [2018-10-04 09:47:43,320 INFO L226 Difference]: Without dead ends: 80 [2018-10-04 09:47:43,321 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 09:47:43,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-04 09:47:43,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-04 09:47:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-04 09:47:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-10-04 09:47:43,345 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-10-04 09:47:43,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:43,346 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-10-04 09:47:43,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:43,346 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-10-04 09:47:43,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 09:47:43,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:43,349 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 09:47:43,349 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:43,349 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:43,349 INFO L82 PathProgramCache]: Analyzing trace with hash -720649021, now seen corresponding path program 1 times [2018-10-04 09:47:43,349 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:43,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:43,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:43,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:43,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:43,464 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 09:47:43,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:43,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:43,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:43,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:43,466 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:43,466 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-10-04 09:47:43,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:43,657 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-10-04 09:47:43,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:43,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-04 09:47:43,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:43,659 INFO L225 Difference]: With dead ends: 164 [2018-10-04 09:47:43,659 INFO L226 Difference]: Without dead ends: 85 [2018-10-04 09:47:43,660 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 09:47:43,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-04 09:47:43,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-04 09:47:43,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-04 09:47:43,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-10-04 09:47:43,675 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-10-04 09:47:43,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:43,676 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-10-04 09:47:43,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:43,676 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-10-04 09:47:43,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 09:47:43,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:43,678 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 09:47:43,678 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:43,679 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:43,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268887, now seen corresponding path program 1 times [2018-10-04 09:47:43,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:43,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:43,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:43,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:43,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:43,726 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 09:47:43,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:43,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:43,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:43,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:43,728 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:43,728 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-10-04 09:47:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:43,979 INFO L93 Difference]: Finished difference Result 181 states and 270 transitions. [2018-10-04 09:47:43,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:43,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-04 09:47:43,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:43,981 INFO L225 Difference]: With dead ends: 181 [2018-10-04 09:47:43,981 INFO L226 Difference]: Without dead ends: 96 [2018-10-04 09:47:43,982 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 09:47:43,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-04 09:47:43,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-10-04 09:47:43,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-04 09:47:43,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2018-10-04 09:47:43,999 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 44 [2018-10-04 09:47:43,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:44,000 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2018-10-04 09:47:44,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:44,000 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2018-10-04 09:47:44,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-04 09:47:44,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:44,002 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 09:47:44,002 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:44,002 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:44,002 INFO L82 PathProgramCache]: Analyzing trace with hash 483195845, now seen corresponding path program 1 times [2018-10-04 09:47:44,003 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:44,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:44,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:44,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:44,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:44,094 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 09:47:44,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:44,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:44,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:44,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:44,096 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:44,096 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand 3 states. [2018-10-04 09:47:44,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:44,295 INFO L93 Difference]: Finished difference Result 195 states and 285 transitions. [2018-10-04 09:47:44,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:44,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-04 09:47:44,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:44,297 INFO L225 Difference]: With dead ends: 195 [2018-10-04 09:47:44,297 INFO L226 Difference]: Without dead ends: 100 [2018-10-04 09:47:44,298 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 09:47:44,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-04 09:47:44,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-10-04 09:47:44,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-04 09:47:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2018-10-04 09:47:44,327 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 45 [2018-10-04 09:47:44,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:44,327 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2018-10-04 09:47:44,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:44,328 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2018-10-04 09:47:44,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 09:47:44,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:44,334 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 09:47:44,334 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:44,335 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:44,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956691, now seen corresponding path program 1 times [2018-10-04 09:47:44,335 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:44,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:44,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:44,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:44,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:44,588 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 09:47:44,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:47:44,589 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 09:47:44,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:44,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:47:45,357 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 09:47:45,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 09:47:45,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-04 09:47:45,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:47:45,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:47:45,380 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:45,381 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand 5 states. [2018-10-04 09:47:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:47,260 INFO L93 Difference]: Finished difference Result 441 states and 602 transitions. [2018-10-04 09:47:47,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:47:47,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-10-04 09:47:47,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:47,263 INFO L225 Difference]: With dead ends: 441 [2018-10-04 09:47:47,263 INFO L226 Difference]: Without dead ends: 328 [2018-10-04 09:47:47,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.5s impTime 6 [2018-10-04 09:47:47,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-04 09:47:47,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 187. [2018-10-04 09:47:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-04 09:47:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 247 transitions. [2018-10-04 09:47:47,305 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 247 transitions. Word has length 48 [2018-10-04 09:47:47,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:47,305 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 247 transitions. [2018-10-04 09:47:47,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:47:47,305 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 247 transitions. [2018-10-04 09:47:47,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-04 09:47:47,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:47,307 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 09:47:47,308 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:47,308 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:47,308 INFO L82 PathProgramCache]: Analyzing trace with hash 636359981, now seen corresponding path program 1 times [2018-10-04 09:47:47,308 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:47,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:47,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:47,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:47,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:47,399 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 09:47:47,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:47,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:47,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:47,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:47,400 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:47,401 INFO L87 Difference]: Start difference. First operand 187 states and 247 transitions. Second operand 3 states. [2018-10-04 09:47:47,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:47,762 INFO L93 Difference]: Finished difference Result 374 states and 495 transitions. [2018-10-04 09:47:47,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:47,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-10-04 09:47:47,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:47,765 INFO L225 Difference]: With dead ends: 374 [2018-10-04 09:47:47,765 INFO L226 Difference]: Without dead ends: 182 [2018-10-04 09:47:47,765 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 09:47:47,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-04 09:47:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-10-04 09:47:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-04 09:47:47,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 227 transitions. [2018-10-04 09:47:47,803 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 227 transitions. Word has length 64 [2018-10-04 09:47:47,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:47,804 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 227 transitions. [2018-10-04 09:47:47,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:47,804 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 227 transitions. [2018-10-04 09:47:47,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-04 09:47:47,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:47,806 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 09:47:47,806 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:47,806 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:47,806 INFO L82 PathProgramCache]: Analyzing trace with hash -739459377, now seen corresponding path program 1 times [2018-10-04 09:47:47,807 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:47,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:47,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:47,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:47,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:47,944 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 09:47:47,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:47,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:47,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:47,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:47,945 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:47,945 INFO L87 Difference]: Start difference. First operand 182 states and 227 transitions. Second operand 3 states. [2018-10-04 09:47:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:48,359 INFO L93 Difference]: Finished difference Result 381 states and 475 transitions. [2018-10-04 09:47:48,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:48,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-10-04 09:47:48,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:48,362 INFO L225 Difference]: With dead ends: 381 [2018-10-04 09:47:48,362 INFO L226 Difference]: Without dead ends: 202 [2018-10-04 09:47:48,363 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 09:47:48,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-04 09:47:48,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-10-04 09:47:48,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-04 09:47:48,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 247 transitions. [2018-10-04 09:47:48,399 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 247 transitions. Word has length 97 [2018-10-04 09:47:48,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:48,400 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 247 transitions. [2018-10-04 09:47:48,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:48,400 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 247 transitions. [2018-10-04 09:47:48,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-04 09:47:48,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:48,401 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 09:47:48,402 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:48,402 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:48,402 INFO L82 PathProgramCache]: Analyzing trace with hash -93746177, now seen corresponding path program 1 times [2018-10-04 09:47:48,402 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:48,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:48,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:48,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:48,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:48,544 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 09:47:48,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:48,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:48,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:48,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:48,546 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:48,546 INFO L87 Difference]: Start difference. First operand 202 states and 247 transitions. Second operand 3 states. [2018-10-04 09:47:48,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:48,786 INFO L93 Difference]: Finished difference Result 298 states and 365 transitions. [2018-10-04 09:47:48,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:48,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-10-04 09:47:48,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:48,789 INFO L225 Difference]: With dead ends: 298 [2018-10-04 09:47:48,789 INFO L226 Difference]: Without dead ends: 296 [2018-10-04 09:47:48,790 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 09:47:48,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-04 09:47:48,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-10-04 09:47:48,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-04 09:47:48,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 363 transitions. [2018-10-04 09:47:48,860 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 363 transitions. Word has length 107 [2018-10-04 09:47:48,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:48,860 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 363 transitions. [2018-10-04 09:47:48,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:48,860 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 363 transitions. [2018-10-04 09:47:48,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-04 09:47:48,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:48,862 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 09:47:48,863 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:48,863 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:48,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1497686773, now seen corresponding path program 1 times [2018-10-04 09:47:48,863 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:48,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:48,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:48,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:48,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:49,014 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 09:47:49,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:49,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:49,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:49,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:49,016 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:49,016 INFO L87 Difference]: Start difference. First operand 296 states and 363 transitions. Second operand 3 states. [2018-10-04 09:47:49,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:49,562 INFO L93 Difference]: Finished difference Result 589 states and 723 transitions. [2018-10-04 09:47:49,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:49,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-10-04 09:47:49,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:49,565 INFO L225 Difference]: With dead ends: 589 [2018-10-04 09:47:49,565 INFO L226 Difference]: Without dead ends: 296 [2018-10-04 09:47:49,566 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 09:47:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-04 09:47:49,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-10-04 09:47:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-04 09:47:49,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 354 transitions. [2018-10-04 09:47:49,605 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 354 transitions. Word has length 147 [2018-10-04 09:47:49,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:49,605 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 354 transitions. [2018-10-04 09:47:49,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:49,605 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 354 transitions. [2018-10-04 09:47:49,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-04 09:47:49,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:49,607 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 09:47:49,608 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:49,608 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:49,608 INFO L82 PathProgramCache]: Analyzing trace with hash -663980831, now seen corresponding path program 1 times [2018-10-04 09:47:49,608 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:49,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:49,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:49,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:49,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:49,831 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 09:47:49,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:47:49,831 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 09:47:49,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:49,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:47:50,439 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 09:47:50,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:47:50,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 09:47:50,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:47:50,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:47:50,473 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:50,473 INFO L87 Difference]: Start difference. First operand 296 states and 354 transitions. Second operand 4 states. [2018-10-04 09:47:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:50,922 INFO L93 Difference]: Finished difference Result 470 states and 566 transitions. [2018-10-04 09:47:50,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:47:50,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-10-04 09:47:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:50,923 INFO L225 Difference]: With dead ends: 470 [2018-10-04 09:47:50,923 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:47:50,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.0s impTime 3 [2018-10-04 09:47:50,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:47:50,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:47:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:47:50,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:47:50,925 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-10-04 09:47:50,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:50,925 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:47:50,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:47:50,926 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:47:50,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:47:50,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:47:50,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:50,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:50,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:50,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:51,578 WARN L178 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-04 09:47:52,608 WARN L178 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-10-04 09:47:53,044 WARN L178 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-10-04 09:47:53,169 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2018-10-04 09:47:53,403 WARN L178 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-10-04 09:47:53,587 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-10-04 09:47:53,912 WARN L178 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-04 09:47:54,107 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2018-10-04 09:47:54,307 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-10-04 09:47:54,475 WARN L178 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2018-10-04 09:47:54,788 WARN L178 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2018-10-04 09:47:55,029 WARN L178 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2018-10-04 09:47:55,508 WARN L178 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2018-10-04 09:47:55,620 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2018-10-04 09:47:55,705 INFO L421 ceAbstractionStarter]: At program point L415(lines 415 427) 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 09:47:55,706 INFO L421 ceAbstractionStarter]: At program point L469(lines 469 491) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) [2018-10-04 09:47:55,706 INFO L421 ceAbstractionStarter]: At program point L370(lines 370 378) 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 09:47:55,706 INFO L421 ceAbstractionStarter]: At program point L271(lines 271 287) 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 09:47:55,706 INFO L421 ceAbstractionStarter]: At program point L461(lines 461 482) 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 09:47:55,706 INFO L421 ceAbstractionStarter]: At program point L490(lines 490 505) the Hoare annotation is: false [2018-10-04 09:47:55,707 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 507) no Hoare annotation was computed. [2018-10-04 09:47:55,707 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 507) no Hoare annotation was computed. [2018-10-04 09:47:55,707 INFO L421 ceAbstractionStarter]: At program point L313(lines 313 324) 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 09:47:55,707 INFO L421 ceAbstractionStarter]: At program point L400(lines 400 412) 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 09:47:55,707 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 506) no Hoare annotation was computed. [2018-10-04 09:47:55,707 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 507) no Hoare annotation was computed. [2018-10-04 09:47:55,707 INFO L421 ceAbstractionStarter]: At program point L380(lines 380 397) 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 09:47:55,708 INFO L421 ceAbstractionStarter]: At program point L347(lines 347 365) 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 09:47:55,708 INFO L421 ceAbstractionStarter]: At program point L442(lines 442 462) 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 09:47:55,708 INFO L421 ceAbstractionStarter]: At program point L504(lines 286 504) 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 09:47:55,708 INFO L421 ceAbstractionStarter]: At program point L438(lines 438 449) 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 09:47:55,708 INFO L421 ceAbstractionStarter]: At program point L430(lines 430 439) 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 09:47:55,708 INFO L421 ceAbstractionStarter]: At program point L327(lines 327 344) 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 09:47:55,709 INFO L421 ceAbstractionStarter]: At program point L484(lines 481 499) 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 09:47:55,709 INFO L421 ceAbstractionStarter]: At program point L451(lines 448 470) 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 09:47:55,709 INFO L421 ceAbstractionStarter]: At program point L295(lines 258 295) 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 09:47:55,709 INFO L421 ceAbstractionStarter]: At program point L291(lines 291 310) 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 09:47:55,728 INFO L202 PluginConnector]: Adding new model s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:47:55 BoogieIcfgContainer [2018-10-04 09:47:55,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:47:55,729 INFO L168 Benchmark]: Toolchain (without parser) took 15587.44 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 108.5 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -68.9 MB). Peak memory consumption was 586.7 MB. Max. memory is 7.1 GB. [2018-10-04 09:47:55,730 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:47:55,731 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.96 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 09:47:55,732 INFO L168 Benchmark]: Boogie Preprocessor took 40.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:47:55,732 INFO L168 Benchmark]: RCFGBuilder took 786.77 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 09:47:55,733 INFO L168 Benchmark]: TraceAbstraction took 14710.65 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 108.5 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -100.6 MB). Peak memory consumption was 555.0 MB. Max. memory is 7.1 GB. [2018-10-04 09:47:55,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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.96 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 40.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 786.77 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 14710.65 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 108.5 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -100.6 MB). Peak memory consumption was 555.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 506]: 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: 271]: 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: 481]: 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: 313]: 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: 430]: 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: 448]: 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: 286]: 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: 461]: 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: 258]: 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: 438]: 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: 469]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5 - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 415]: 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: 370]: 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: 327]: 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) - InvariantResult [Line: 380]: 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: 347]: 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: 291]: 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: 400]: 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: 442]: 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) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. SAFE Result, 14.6s OverallTime, 14 OverallIterations, 19 TraceHistogramMax, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 4.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 278 SDtfs, 197 SDslu, 137 SDs, 0 SdLazy, 547 SolverSat, 194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s 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.3s HoareSimplificationTime, 19 FomulaSimplificationsInter, 3305 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1151 NumberOfCodeBlocks, 1151 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1135 ConstructedInterpolants, 0 QuantifiedInterpolants, 162691 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1200 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_3.cil.c_20.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-47-55-756.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3.cil.c_20.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-47-55-756.csv Received shutdown request...