java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 16:17:54,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 16:17:54,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 16:17:54,683 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 16:17:54,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 16:17:54,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 16:17:54,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 16:17:54,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 16:17:54,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 16:17:54,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 16:17:54,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 16:17:54,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 16:17:54,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 16:17:54,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 16:17:54,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 16:17:54,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 16:17:54,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 16:17:54,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 16:17:54,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 16:17:54,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 16:17:54,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 16:17:54,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 16:17:54,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 16:17:54,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 16:17:54,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 16:17:54,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 16:17:54,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 16:17:54,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 16:17:54,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 16:17:54,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 16:17:54,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 16:17:54,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 16:17:54,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 16:17:54,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 16:17:54,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 16:17:54,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 16:17:54,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 16:17:54,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 16:17:54,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 16:17:54,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 16:17:54,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 16:17:54,717 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 16:17:54,731 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 16:17:54,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 16:17:54,733 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 16:17:54,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 16:17:54,733 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 16:17:54,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 16:17:54,734 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 16:17:54,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 16:17:54,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 16:17:54,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 16:17:54,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 16:17:54,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 16:17:54,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 16:17:54,735 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 16:17:54,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 16:17:54,735 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 16:17:54,736 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 16:17:54,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 16:17:54,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 16:17:54,736 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 16:17:54,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 16:17:54,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 16:17:54,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 16:17:54,737 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 16:17:54,737 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 16:17:54,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 16:17:54,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 16:17:54,738 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 16:17:54,738 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 16:17:54,783 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 16:17:54,791 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 16:17:54,794 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 16:17:54,796 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 16:17:54,796 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 16:17:54,797 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c [2019-10-02 16:17:54,856 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88f15d3dc/358c8f887a644afea3c9c041015f3957/FLAG0c9915ae1 [2019-10-02 16:17:55,341 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 16:17:55,341 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c [2019-10-02 16:17:55,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88f15d3dc/358c8f887a644afea3c9c041015f3957/FLAG0c9915ae1 [2019-10-02 16:17:55,628 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88f15d3dc/358c8f887a644afea3c9c041015f3957 [2019-10-02 16:17:55,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 16:17:55,639 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 16:17:55,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 16:17:55,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 16:17:55,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 16:17:55,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:17:55" (1/1) ... [2019-10-02 16:17:55,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@641eaed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:17:55, skipping insertion in model container [2019-10-02 16:17:55,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:17:55" (1/1) ... [2019-10-02 16:17:55,654 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 16:17:55,708 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 16:17:56,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 16:17:56,095 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 16:17:56,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 16:17:56,165 INFO L192 MainTranslator]: Completed translation [2019-10-02 16:17:56,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:17:56 WrapperNode [2019-10-02 16:17:56,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 16:17:56,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 16:17:56,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 16:17:56,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 16:17:56,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:17:56" (1/1) ... [2019-10-02 16:17:56,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:17:56" (1/1) ... [2019-10-02 16:17:56,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:17:56" (1/1) ... [2019-10-02 16:17:56,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:17:56" (1/1) ... [2019-10-02 16:17:56,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:17:56" (1/1) ... [2019-10-02 16:17:56,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:17:56" (1/1) ... [2019-10-02 16:17:56,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:17:56" (1/1) ... [2019-10-02 16:17:56,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 16:17:56,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 16:17:56,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 16:17:56,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 16:17:56,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:17:56" (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 [2019-10-02 16:17:56,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 16:17:56,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 16:17:56,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-02 16:17:56,299 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 16:17:56,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 16:17:56,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 16:17:56,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 16:17:56,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-02 16:17:56,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 16:17:56,300 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-02 16:17:56,301 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 16:17:56,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 16:17:56,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 16:17:56,541 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 16:17:57,036 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-02 16:17:57,036 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-02 16:17:57,041 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 16:17:57,042 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 16:17:57,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:17:57 BoogieIcfgContainer [2019-10-02 16:17:57,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 16:17:57,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 16:17:57,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 16:17:57,049 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 16:17:57,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 04:17:55" (1/3) ... [2019-10-02 16:17:57,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1947e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:17:57, skipping insertion in model container [2019-10-02 16:17:57,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:17:56" (2/3) ... [2019-10-02 16:17:57,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1947e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:17:57, skipping insertion in model container [2019-10-02 16:17:57,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:17:57" (3/3) ... [2019-10-02 16:17:57,053 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.c [2019-10-02 16:17:57,064 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 16:17:57,075 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 16:17:57,092 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 16:17:57,140 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 16:17:57,140 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 16:17:57,141 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 16:17:57,141 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 16:17:57,141 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 16:17:57,141 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 16:17:57,141 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 16:17:57,142 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 16:17:57,142 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 16:17:57,163 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-10-02 16:17:57,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 16:17:57,172 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:57,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:57,176 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:57,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:57,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1198514108, now seen corresponding path program 1 times [2019-10-02 16:17:57,183 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:57,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:57,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:57,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:57,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:57,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:17:57,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:57,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:57,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:57,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:57,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:57,503 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 5 states. [2019-10-02 16:17:57,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:57,885 INFO L93 Difference]: Finished difference Result 338 states and 575 transitions. [2019-10-02 16:17:57,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:57,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-02 16:17:57,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:57,900 INFO L225 Difference]: With dead ends: 338 [2019-10-02 16:17:57,901 INFO L226 Difference]: Without dead ends: 176 [2019-10-02 16:17:57,905 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:17:57,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-02 16:17:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2019-10-02 16:17:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-02 16:17:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 260 transitions. [2019-10-02 16:17:57,963 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 260 transitions. Word has length 38 [2019-10-02 16:17:57,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:57,964 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 260 transitions. [2019-10-02 16:17:57,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:57,964 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 260 transitions. [2019-10-02 16:17:57,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-02 16:17:57,966 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:57,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:57,967 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:57,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:57,967 INFO L82 PathProgramCache]: Analyzing trace with hash -733377836, now seen corresponding path program 1 times [2019-10-02 16:17:57,968 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:57,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:57,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:57,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:57,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:17:58,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:58,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:58,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:58,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:58,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:58,066 INFO L87 Difference]: Start difference. First operand 165 states and 260 transitions. Second operand 5 states. [2019-10-02 16:17:58,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:58,357 INFO L93 Difference]: Finished difference Result 356 states and 571 transitions. [2019-10-02 16:17:58,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:58,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-02 16:17:58,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:58,363 INFO L225 Difference]: With dead ends: 356 [2019-10-02 16:17:58,363 INFO L226 Difference]: Without dead ends: 204 [2019-10-02 16:17:58,367 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:17:58,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-02 16:17:58,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2019-10-02 16:17:58,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-10-02 16:17:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 311 transitions. [2019-10-02 16:17:58,405 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 311 transitions. Word has length 39 [2019-10-02 16:17:58,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:58,405 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 311 transitions. [2019-10-02 16:17:58,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 311 transitions. [2019-10-02 16:17:58,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-02 16:17:58,409 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:58,409 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:58,409 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:58,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:58,410 INFO L82 PathProgramCache]: Analyzing trace with hash 2008699792, now seen corresponding path program 1 times [2019-10-02 16:17:58,410 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:58,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:58,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:58,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:58,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:58,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:17:58,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:58,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:58,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:58,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:58,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:58,501 INFO L87 Difference]: Start difference. First operand 193 states and 311 transitions. Second operand 5 states. [2019-10-02 16:17:58,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:58,786 INFO L93 Difference]: Finished difference Result 417 states and 682 transitions. [2019-10-02 16:17:58,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:58,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-02 16:17:58,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:58,789 INFO L225 Difference]: With dead ends: 417 [2019-10-02 16:17:58,790 INFO L226 Difference]: Without dead ends: 237 [2019-10-02 16:17:58,791 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:17:58,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-10-02 16:17:58,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2019-10-02 16:17:58,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-10-02 16:17:58,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 380 transitions. [2019-10-02 16:17:58,817 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 380 transitions. Word has length 45 [2019-10-02 16:17:58,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:58,818 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 380 transitions. [2019-10-02 16:17:58,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:58,818 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 380 transitions. [2019-10-02 16:17:58,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 16:17:58,822 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:58,822 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:58,822 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:58,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:58,823 INFO L82 PathProgramCache]: Analyzing trace with hash 2133173875, now seen corresponding path program 1 times [2019-10-02 16:17:58,823 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:58,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:58,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:58,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:58,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:17:58,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:58,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:58,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:58,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:58,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:58,938 INFO L87 Difference]: Start difference. First operand 231 states and 380 transitions. Second operand 5 states. [2019-10-02 16:17:59,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:59,204 INFO L93 Difference]: Finished difference Result 466 states and 772 transitions. [2019-10-02 16:17:59,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:59,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-02 16:17:59,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:59,208 INFO L225 Difference]: With dead ends: 466 [2019-10-02 16:17:59,208 INFO L226 Difference]: Without dead ends: 248 [2019-10-02 16:17:59,209 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:17:59,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-02 16:17:59,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2019-10-02 16:17:59,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-10-02 16:17:59,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 401 transitions. [2019-10-02 16:17:59,238 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 401 transitions. Word has length 46 [2019-10-02 16:17:59,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:59,238 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 401 transitions. [2019-10-02 16:17:59,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 401 transitions. [2019-10-02 16:17:59,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-02 16:17:59,245 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:59,245 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:59,245 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:59,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:59,246 INFO L82 PathProgramCache]: Analyzing trace with hash 648824040, now seen corresponding path program 1 times [2019-10-02 16:17:59,246 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:59,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:59,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:59,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:59,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:17:59,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:59,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:59,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:59,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:59,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:59,350 INFO L87 Difference]: Start difference. First operand 242 states and 401 transitions. Second operand 5 states. [2019-10-02 16:17:59,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:59,570 INFO L93 Difference]: Finished difference Result 510 states and 854 transitions. [2019-10-02 16:17:59,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:59,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-10-02 16:17:59,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:59,573 INFO L225 Difference]: With dead ends: 510 [2019-10-02 16:17:59,573 INFO L226 Difference]: Without dead ends: 281 [2019-10-02 16:17:59,574 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:17:59,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-02 16:17:59,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 267. [2019-10-02 16:17:59,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-02 16:17:59,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 444 transitions. [2019-10-02 16:17:59,589 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 444 transitions. Word has length 64 [2019-10-02 16:17:59,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:59,591 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 444 transitions. [2019-10-02 16:17:59,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 444 transitions. [2019-10-02 16:17:59,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-02 16:17:59,594 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:59,594 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:59,595 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:59,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:59,595 INFO L82 PathProgramCache]: Analyzing trace with hash 943009440, now seen corresponding path program 1 times [2019-10-02 16:17:59,595 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:59,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:59,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:59,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:59,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:17:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:17:59,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:17:59,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:17:59,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:17:59,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:17:59,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:17:59,693 INFO L87 Difference]: Start difference. First operand 267 states and 444 transitions. Second operand 5 states. [2019-10-02 16:17:59,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:17:59,945 INFO L93 Difference]: Finished difference Result 535 states and 894 transitions. [2019-10-02 16:17:59,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:17:59,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-02 16:17:59,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:17:59,948 INFO L225 Difference]: With dead ends: 535 [2019-10-02 16:17:59,948 INFO L226 Difference]: Without dead ends: 281 [2019-10-02 16:17:59,950 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:17:59,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-02 16:17:59,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 267. [2019-10-02 16:17:59,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-02 16:17:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 441 transitions. [2019-10-02 16:17:59,964 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 441 transitions. Word has length 65 [2019-10-02 16:17:59,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:17:59,964 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 441 transitions. [2019-10-02 16:17:59,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:17:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 441 transitions. [2019-10-02 16:17:59,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 16:17:59,966 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:17:59,966 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:17:59,967 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:17:59,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:17:59,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1195194559, now seen corresponding path program 1 times [2019-10-02 16:17:59,967 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:17:59,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:17:59,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:59,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:17:59,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:17:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:00,042 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:18:00,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:00,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:00,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:00,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:00,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:00,044 INFO L87 Difference]: Start difference. First operand 267 states and 441 transitions. Second operand 5 states. [2019-10-02 16:18:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:00,276 INFO L93 Difference]: Finished difference Result 552 states and 919 transitions. [2019-10-02 16:18:00,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:00,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-10-02 16:18:00,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:00,279 INFO L225 Difference]: With dead ends: 552 [2019-10-02 16:18:00,279 INFO L226 Difference]: Without dead ends: 298 [2019-10-02 16:18:00,280 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:18:00,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-02 16:18:00,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-10-02 16:18:00,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-02 16:18:00,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 493 transitions. [2019-10-02 16:18:00,292 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 493 transitions. Word has length 66 [2019-10-02 16:18:00,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:00,292 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 493 transitions. [2019-10-02 16:18:00,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:00,293 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 493 transitions. [2019-10-02 16:18:00,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-02 16:18:00,294 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:00,294 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:00,294 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:00,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:00,295 INFO L82 PathProgramCache]: Analyzing trace with hash -379332949, now seen corresponding path program 1 times [2019-10-02 16:18:00,295 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:00,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:00,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:00,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:00,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 16:18:00,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:00,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:00,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:00,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:00,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:00,343 INFO L87 Difference]: Start difference. First operand 298 states and 493 transitions. Second operand 5 states. [2019-10-02 16:18:00,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:00,509 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2019-10-02 16:18:00,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:00,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-02 16:18:00,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:00,512 INFO L225 Difference]: With dead ends: 600 [2019-10-02 16:18:00,512 INFO L226 Difference]: Without dead ends: 315 [2019-10-02 16:18:00,513 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:18:00,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-10-02 16:18:00,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2019-10-02 16:18:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-10-02 16:18:00,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 514 transitions. [2019-10-02 16:18:00,526 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 514 transitions. Word has length 78 [2019-10-02 16:18:00,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:00,526 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 514 transitions. [2019-10-02 16:18:00,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:00,527 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 514 transitions. [2019-10-02 16:18:00,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-02 16:18:00,528 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:00,528 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:00,528 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:00,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:00,529 INFO L82 PathProgramCache]: Analyzing trace with hash 314969472, now seen corresponding path program 1 times [2019-10-02 16:18:00,529 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:00,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:00,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:00,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:00,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:18:00,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:00,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:00,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:00,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:00,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:00,602 INFO L87 Difference]: Start difference. First operand 313 states and 514 transitions. Second operand 5 states. [2019-10-02 16:18:00,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:00,813 INFO L93 Difference]: Finished difference Result 651 states and 1075 transitions. [2019-10-02 16:18:00,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:00,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-02 16:18:00,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:00,817 INFO L225 Difference]: With dead ends: 651 [2019-10-02 16:18:00,817 INFO L226 Difference]: Without dead ends: 351 [2019-10-02 16:18:00,818 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:18:00,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-02 16:18:00,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-10-02 16:18:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-10-02 16:18:00,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 574 transitions. [2019-10-02 16:18:00,842 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 574 transitions. Word has length 78 [2019-10-02 16:18:00,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:00,842 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 574 transitions. [2019-10-02 16:18:00,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:00,843 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 574 transitions. [2019-10-02 16:18:00,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-02 16:18:00,845 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:00,845 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:00,845 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:00,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:00,846 INFO L82 PathProgramCache]: Analyzing trace with hash 496741763, now seen corresponding path program 1 times [2019-10-02 16:18:00,846 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:00,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:00,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:00,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:00,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 16:18:00,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:00,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:00,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:00,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:00,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:00,912 INFO L87 Difference]: Start difference. First operand 349 states and 574 transitions. Second operand 5 states. [2019-10-02 16:18:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:01,143 INFO L93 Difference]: Finished difference Result 687 states and 1133 transitions. [2019-10-02 16:18:01,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:01,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-10-02 16:18:01,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:01,146 INFO L225 Difference]: With dead ends: 687 [2019-10-02 16:18:01,147 INFO L226 Difference]: Without dead ends: 351 [2019-10-02 16:18:01,148 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:18:01,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-02 16:18:01,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-10-02 16:18:01,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-10-02 16:18:01,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 568 transitions. [2019-10-02 16:18:01,165 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 568 transitions. Word has length 79 [2019-10-02 16:18:01,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:01,165 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 568 transitions. [2019-10-02 16:18:01,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:01,165 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 568 transitions. [2019-10-02 16:18:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-02 16:18:01,167 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:01,167 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:01,167 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:01,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:01,168 INFO L82 PathProgramCache]: Analyzing trace with hash -70012323, now seen corresponding path program 1 times [2019-10-02 16:18:01,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:01,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:01,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:01,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:01,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:01,244 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:18:01,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:01,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:01,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:01,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:01,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:01,246 INFO L87 Difference]: Start difference. First operand 349 states and 568 transitions. Second operand 5 states. [2019-10-02 16:18:01,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:01,508 INFO L93 Difference]: Finished difference Result 687 states and 1121 transitions. [2019-10-02 16:18:01,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:01,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-10-02 16:18:01,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:01,511 INFO L225 Difference]: With dead ends: 687 [2019-10-02 16:18:01,511 INFO L226 Difference]: Without dead ends: 351 [2019-10-02 16:18:01,512 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:18:01,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-02 16:18:01,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-10-02 16:18:01,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-10-02 16:18:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 566 transitions. [2019-10-02 16:18:01,531 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 566 transitions. Word has length 79 [2019-10-02 16:18:01,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:01,531 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 566 transitions. [2019-10-02 16:18:01,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:01,532 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 566 transitions. [2019-10-02 16:18:01,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-02 16:18:01,533 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:01,533 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:01,534 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:01,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:01,534 INFO L82 PathProgramCache]: Analyzing trace with hash 2051852968, now seen corresponding path program 1 times [2019-10-02 16:18:01,534 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:01,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:01,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:01,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:01,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 16:18:01,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:01,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:01,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:01,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:01,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:01,604 INFO L87 Difference]: Start difference. First operand 349 states and 566 transitions. Second operand 5 states. [2019-10-02 16:18:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:01,807 INFO L93 Difference]: Finished difference Result 714 states and 1163 transitions. [2019-10-02 16:18:01,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:01,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-10-02 16:18:01,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:01,809 INFO L225 Difference]: With dead ends: 714 [2019-10-02 16:18:01,810 INFO L226 Difference]: Without dead ends: 378 [2019-10-02 16:18:01,811 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:18:01,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-02 16:18:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 373. [2019-10-02 16:18:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-10-02 16:18:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 601 transitions. [2019-10-02 16:18:01,827 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 601 transitions. Word has length 85 [2019-10-02 16:18:01,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:01,828 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 601 transitions. [2019-10-02 16:18:01,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:01,828 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 601 transitions. [2019-10-02 16:18:01,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-02 16:18:01,829 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:01,829 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:01,830 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:01,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:01,830 INFO L82 PathProgramCache]: Analyzing trace with hash 406324048, now seen corresponding path program 1 times [2019-10-02 16:18:01,830 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:01,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:01,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:01,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:01,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:01,882 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 16:18:01,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:01,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:01,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:01,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:01,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:01,883 INFO L87 Difference]: Start difference. First operand 373 states and 601 transitions. Second operand 5 states. [2019-10-02 16:18:02,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:02,111 INFO L93 Difference]: Finished difference Result 738 states and 1192 transitions. [2019-10-02 16:18:02,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:02,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-10-02 16:18:02,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:02,114 INFO L225 Difference]: With dead ends: 738 [2019-10-02 16:18:02,115 INFO L226 Difference]: Without dead ends: 378 [2019-10-02 16:18:02,116 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:18:02,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-02 16:18:02,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 373. [2019-10-02 16:18:02,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-10-02 16:18:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 595 transitions. [2019-10-02 16:18:02,138 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 595 transitions. Word has length 86 [2019-10-02 16:18:02,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:02,138 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 595 transitions. [2019-10-02 16:18:02,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:02,139 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 595 transitions. [2019-10-02 16:18:02,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-02 16:18:02,141 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:02,141 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:02,141 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:02,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:02,142 INFO L82 PathProgramCache]: Analyzing trace with hash 2087471906, now seen corresponding path program 1 times [2019-10-02 16:18:02,142 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:02,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:02,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:02,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:02,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:02,186 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 16:18:02,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:02,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:02,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:02,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:02,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:02,188 INFO L87 Difference]: Start difference. First operand 373 states and 595 transitions. Second operand 5 states. [2019-10-02 16:18:02,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:02,353 INFO L93 Difference]: Finished difference Result 742 states and 1185 transitions. [2019-10-02 16:18:02,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:02,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-02 16:18:02,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:02,356 INFO L225 Difference]: With dead ends: 742 [2019-10-02 16:18:02,357 INFO L226 Difference]: Without dead ends: 382 [2019-10-02 16:18:02,359 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:18:02,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-10-02 16:18:02,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2019-10-02 16:18:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-10-02 16:18:02,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 598 transitions. [2019-10-02 16:18:02,377 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 598 transitions. Word has length 91 [2019-10-02 16:18:02,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:02,377 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 598 transitions. [2019-10-02 16:18:02,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:02,377 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 598 transitions. [2019-10-02 16:18:02,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 16:18:02,379 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:02,379 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:02,379 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:02,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:02,379 INFO L82 PathProgramCache]: Analyzing trace with hash 754738376, now seen corresponding path program 1 times [2019-10-02 16:18:02,380 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:02,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:02,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:02,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:02,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:02,438 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 16:18:02,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:02,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:02,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:02,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:02,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:02,439 INFO L87 Difference]: Start difference. First operand 382 states and 598 transitions. Second operand 5 states. [2019-10-02 16:18:02,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:02,803 INFO L93 Difference]: Finished difference Result 782 states and 1226 transitions. [2019-10-02 16:18:02,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:02,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-02 16:18:02,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:02,806 INFO L225 Difference]: With dead ends: 782 [2019-10-02 16:18:02,806 INFO L226 Difference]: Without dead ends: 413 [2019-10-02 16:18:02,807 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:18:02,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-10-02 16:18:02,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2019-10-02 16:18:02,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-10-02 16:18:02,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 639 transitions. [2019-10-02 16:18:02,824 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 639 transitions. Word has length 92 [2019-10-02 16:18:02,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:02,824 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 639 transitions. [2019-10-02 16:18:02,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:02,824 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 639 transitions. [2019-10-02 16:18:02,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 16:18:02,826 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:02,826 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:02,826 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:02,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:02,826 INFO L82 PathProgramCache]: Analyzing trace with hash -196155072, now seen corresponding path program 1 times [2019-10-02 16:18:02,827 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:02,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:02,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:02,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:02,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:02,872 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 16:18:02,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:02,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:02,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:02,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:02,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:02,873 INFO L87 Difference]: Start difference. First operand 411 states and 639 transitions. Second operand 5 states. [2019-10-02 16:18:03,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:03,088 INFO L93 Difference]: Finished difference Result 811 states and 1263 transitions. [2019-10-02 16:18:03,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:03,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-10-02 16:18:03,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:03,091 INFO L225 Difference]: With dead ends: 811 [2019-10-02 16:18:03,091 INFO L226 Difference]: Without dead ends: 413 [2019-10-02 16:18:03,093 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:18:03,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-10-02 16:18:03,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2019-10-02 16:18:03,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-10-02 16:18:03,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 635 transitions. [2019-10-02 16:18:03,110 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 635 transitions. Word has length 93 [2019-10-02 16:18:03,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:03,111 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 635 transitions. [2019-10-02 16:18:03,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:03,111 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 635 transitions. [2019-10-02 16:18:03,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-02 16:18:03,113 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:03,113 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:03,113 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:03,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:03,113 INFO L82 PathProgramCache]: Analyzing trace with hash 222103604, now seen corresponding path program 1 times [2019-10-02 16:18:03,114 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:03,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:03,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:03,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:03,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:03,164 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 16:18:03,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:03,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:03,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:03,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:03,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:03,165 INFO L87 Difference]: Start difference. First operand 411 states and 635 transitions. Second operand 5 states. [2019-10-02 16:18:03,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:03,350 INFO L93 Difference]: Finished difference Result 834 states and 1294 transitions. [2019-10-02 16:18:03,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:03,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-02 16:18:03,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:03,354 INFO L225 Difference]: With dead ends: 834 [2019-10-02 16:18:03,354 INFO L226 Difference]: Without dead ends: 436 [2019-10-02 16:18:03,355 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:18:03,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-10-02 16:18:03,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2019-10-02 16:18:03,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-10-02 16:18:03,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 662 transitions. [2019-10-02 16:18:03,374 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 662 transitions. Word has length 106 [2019-10-02 16:18:03,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:03,374 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 662 transitions. [2019-10-02 16:18:03,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:03,374 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 662 transitions. [2019-10-02 16:18:03,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-02 16:18:03,376 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:03,376 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:03,376 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:03,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:03,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1331192532, now seen corresponding path program 1 times [2019-10-02 16:18:03,377 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:03,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:03,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:03,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:03,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:03,430 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 16:18:03,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:03,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:03,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:03,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:03,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:03,432 INFO L87 Difference]: Start difference. First operand 432 states and 662 transitions. Second operand 5 states. [2019-10-02 16:18:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:03,635 INFO L93 Difference]: Finished difference Result 855 states and 1313 transitions. [2019-10-02 16:18:03,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:03,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-02 16:18:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:03,639 INFO L225 Difference]: With dead ends: 855 [2019-10-02 16:18:03,639 INFO L226 Difference]: Without dead ends: 436 [2019-10-02 16:18:03,640 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:18:03,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-10-02 16:18:03,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2019-10-02 16:18:03,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-10-02 16:18:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 654 transitions. [2019-10-02 16:18:03,662 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 654 transitions. Word has length 107 [2019-10-02 16:18:03,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:03,662 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 654 transitions. [2019-10-02 16:18:03,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 654 transitions. [2019-10-02 16:18:03,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-02 16:18:03,665 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:03,665 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:03,665 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:03,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:03,666 INFO L82 PathProgramCache]: Analyzing trace with hash -276692460, now seen corresponding path program 1 times [2019-10-02 16:18:03,666 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:03,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:03,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:03,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:03,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:03,742 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 16:18:03,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:03,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:03,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:03,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:03,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:03,744 INFO L87 Difference]: Start difference. First operand 432 states and 654 transitions. Second operand 5 states. [2019-10-02 16:18:03,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:03,958 INFO L93 Difference]: Finished difference Result 896 states and 1357 transitions. [2019-10-02 16:18:03,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:03,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-10-02 16:18:03,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:03,961 INFO L225 Difference]: With dead ends: 896 [2019-10-02 16:18:03,961 INFO L226 Difference]: Without dead ends: 477 [2019-10-02 16:18:03,962 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:18:03,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-10-02 16:18:03,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 474. [2019-10-02 16:18:03,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-10-02 16:18:03,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 715 transitions. [2019-10-02 16:18:03,982 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 715 transitions. Word has length 108 [2019-10-02 16:18:03,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:03,982 INFO L475 AbstractCegarLoop]: Abstraction has 474 states and 715 transitions. [2019-10-02 16:18:03,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 715 transitions. [2019-10-02 16:18:03,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-02 16:18:03,984 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:03,984 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:03,985 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:03,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:03,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1027622475, now seen corresponding path program 1 times [2019-10-02 16:18:03,985 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:03,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:03,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:03,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:03,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 16:18:04,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:04,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:04,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:04,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:04,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:04,033 INFO L87 Difference]: Start difference. First operand 474 states and 715 transitions. Second operand 5 states. [2019-10-02 16:18:04,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:04,235 INFO L93 Difference]: Finished difference Result 971 states and 1465 transitions. [2019-10-02 16:18:04,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:04,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-10-02 16:18:04,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:04,239 INFO L225 Difference]: With dead ends: 971 [2019-10-02 16:18:04,239 INFO L226 Difference]: Without dead ends: 510 [2019-10-02 16:18:04,240 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:18:04,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-10-02 16:18:04,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 508. [2019-10-02 16:18:04,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-10-02 16:18:04,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 761 transitions. [2019-10-02 16:18:04,261 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 761 transitions. Word has length 109 [2019-10-02 16:18:04,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:04,262 INFO L475 AbstractCegarLoop]: Abstraction has 508 states and 761 transitions. [2019-10-02 16:18:04,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:04,262 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 761 transitions. [2019-10-02 16:18:04,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-02 16:18:04,264 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:04,264 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:04,264 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:04,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:04,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1688696815, now seen corresponding path program 1 times [2019-10-02 16:18:04,265 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:04,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:04,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:04,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:04,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 16:18:04,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:04,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:04,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:04,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:04,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:04,317 INFO L87 Difference]: Start difference. First operand 508 states and 761 transitions. Second operand 5 states. [2019-10-02 16:18:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:04,549 INFO L93 Difference]: Finished difference Result 1010 states and 1516 transitions. [2019-10-02 16:18:04,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:04,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-10-02 16:18:04,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:04,552 INFO L225 Difference]: With dead ends: 1010 [2019-10-02 16:18:04,553 INFO L226 Difference]: Without dead ends: 513 [2019-10-02 16:18:04,554 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:18:04,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-10-02 16:18:04,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 510. [2019-10-02 16:18:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-10-02 16:18:04,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 764 transitions. [2019-10-02 16:18:04,575 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 764 transitions. Word has length 109 [2019-10-02 16:18:04,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:04,576 INFO L475 AbstractCegarLoop]: Abstraction has 510 states and 764 transitions. [2019-10-02 16:18:04,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:04,576 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 764 transitions. [2019-10-02 16:18:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-02 16:18:04,577 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:04,578 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:04,578 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:04,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:04,578 INFO L82 PathProgramCache]: Analyzing trace with hash -429369896, now seen corresponding path program 1 times [2019-10-02 16:18:04,578 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:04,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:04,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:04,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:04,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 16:18:04,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:04,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:04,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:04,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:04,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:04,640 INFO L87 Difference]: Start difference. First operand 510 states and 764 transitions. Second operand 5 states. [2019-10-02 16:18:04,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:04,840 INFO L93 Difference]: Finished difference Result 1009 states and 1513 transitions. [2019-10-02 16:18:04,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:04,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-02 16:18:04,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:04,844 INFO L225 Difference]: With dead ends: 1009 [2019-10-02 16:18:04,844 INFO L226 Difference]: Without dead ends: 512 [2019-10-02 16:18:04,845 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:18:04,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-10-02 16:18:04,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 510. [2019-10-02 16:18:04,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-10-02 16:18:04,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 760 transitions. [2019-10-02 16:18:04,867 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 760 transitions. Word has length 110 [2019-10-02 16:18:04,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:04,868 INFO L475 AbstractCegarLoop]: Abstraction has 510 states and 760 transitions. [2019-10-02 16:18:04,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:04,868 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 760 transitions. [2019-10-02 16:18:04,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-02 16:18:04,870 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:04,870 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:04,870 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:04,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:04,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1290144821, now seen corresponding path program 1 times [2019-10-02 16:18:04,871 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:04,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:04,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:04,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:04,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-02 16:18:04,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:04,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:04,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:04,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:04,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:04,907 INFO L87 Difference]: Start difference. First operand 510 states and 760 transitions. Second operand 3 states. [2019-10-02 16:18:04,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:04,951 INFO L93 Difference]: Finished difference Result 1497 states and 2233 transitions. [2019-10-02 16:18:04,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:04,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-02 16:18:04,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:04,956 INFO L225 Difference]: With dead ends: 1497 [2019-10-02 16:18:04,957 INFO L226 Difference]: Without dead ends: 1000 [2019-10-02 16:18:04,958 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:04,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2019-10-02 16:18:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 511. [2019-10-02 16:18:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-10-02 16:18:04,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 761 transitions. [2019-10-02 16:18:04,987 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 761 transitions. Word has length 122 [2019-10-02 16:18:04,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:04,987 INFO L475 AbstractCegarLoop]: Abstraction has 511 states and 761 transitions. [2019-10-02 16:18:04,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:04,988 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 761 transitions. [2019-10-02 16:18:04,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-02 16:18:04,989 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:04,990 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:04,990 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:04,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:04,990 INFO L82 PathProgramCache]: Analyzing trace with hash -953838477, now seen corresponding path program 1 times [2019-10-02 16:18:04,990 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:04,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:04,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:04,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:04,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 16:18:05,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:05,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:05,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:05,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:05,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:05,045 INFO L87 Difference]: Start difference. First operand 511 states and 761 transitions. Second operand 3 states. [2019-10-02 16:18:05,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:05,134 INFO L93 Difference]: Finished difference Result 1505 states and 2248 transitions. [2019-10-02 16:18:05,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:05,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-02 16:18:05,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:05,142 INFO L225 Difference]: With dead ends: 1505 [2019-10-02 16:18:05,142 INFO L226 Difference]: Without dead ends: 1007 [2019-10-02 16:18:05,153 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:05,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-10-02 16:18:05,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1007. [2019-10-02 16:18:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2019-10-02 16:18:05,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1498 transitions. [2019-10-02 16:18:05,241 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1498 transitions. Word has length 122 [2019-10-02 16:18:05,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:05,241 INFO L475 AbstractCegarLoop]: Abstraction has 1007 states and 1498 transitions. [2019-10-02 16:18:05,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:05,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1498 transitions. [2019-10-02 16:18:05,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 16:18:05,245 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:05,245 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:05,245 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:05,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:05,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1636886403, now seen corresponding path program 1 times [2019-10-02 16:18:05,246 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:05,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:05,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:05,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:05,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-02 16:18:05,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:05,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:05,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:05,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:05,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:05,334 INFO L87 Difference]: Start difference. First operand 1007 states and 1498 transitions. Second operand 3 states. [2019-10-02 16:18:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:05,498 INFO L93 Difference]: Finished difference Result 2499 states and 3723 transitions. [2019-10-02 16:18:05,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:05,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-10-02 16:18:05,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:05,510 INFO L225 Difference]: With dead ends: 2499 [2019-10-02 16:18:05,510 INFO L226 Difference]: Without dead ends: 1505 [2019-10-02 16:18:05,514 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:05,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2019-10-02 16:18:05,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1503. [2019-10-02 16:18:05,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-10-02 16:18:05,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 2239 transitions. [2019-10-02 16:18:05,682 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 2239 transitions. Word has length 124 [2019-10-02 16:18:05,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:05,683 INFO L475 AbstractCegarLoop]: Abstraction has 1503 states and 2239 transitions. [2019-10-02 16:18:05,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:05,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2239 transitions. [2019-10-02 16:18:05,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 16:18:05,688 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:05,689 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:05,689 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:05,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:05,693 INFO L82 PathProgramCache]: Analyzing trace with hash -89246318, now seen corresponding path program 1 times [2019-10-02 16:18:05,693 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:05,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:05,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:05,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:05,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:05,801 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-02 16:18:05,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:05,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:05,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:05,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:05,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:05,803 INFO L87 Difference]: Start difference. First operand 1503 states and 2239 transitions. Second operand 3 states. [2019-10-02 16:18:05,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:05,949 INFO L93 Difference]: Finished difference Result 2003 states and 2984 transitions. [2019-10-02 16:18:05,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:05,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-10-02 16:18:05,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:05,961 INFO L225 Difference]: With dead ends: 2003 [2019-10-02 16:18:05,962 INFO L226 Difference]: Without dead ends: 2001 [2019-10-02 16:18:05,963 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:05,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2019-10-02 16:18:06,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1999. [2019-10-02 16:18:06,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1999 states. [2019-10-02 16:18:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2981 transitions. [2019-10-02 16:18:06,063 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2981 transitions. Word has length 125 [2019-10-02 16:18:06,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:06,063 INFO L475 AbstractCegarLoop]: Abstraction has 1999 states and 2981 transitions. [2019-10-02 16:18:06,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:06,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2981 transitions. [2019-10-02 16:18:06,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 16:18:06,068 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:06,068 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:06,068 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:06,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:06,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1672983707, now seen corresponding path program 1 times [2019-10-02 16:18:06,069 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:06,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:06,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:06,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:06,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-02 16:18:06,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:06,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:06,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:06,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:06,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:06,135 INFO L87 Difference]: Start difference. First operand 1999 states and 2981 transitions. Second operand 5 states. [2019-10-02 16:18:06,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:06,415 INFO L93 Difference]: Finished difference Result 4173 states and 6206 transitions. [2019-10-02 16:18:06,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:06,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-10-02 16:18:06,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:06,426 INFO L225 Difference]: With dead ends: 4173 [2019-10-02 16:18:06,426 INFO L226 Difference]: Without dead ends: 2187 [2019-10-02 16:18:06,430 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:18:06,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2019-10-02 16:18:06,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2163. [2019-10-02 16:18:06,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2163 states. [2019-10-02 16:18:06,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 3201 transitions. [2019-10-02 16:18:06,555 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 3201 transitions. Word has length 155 [2019-10-02 16:18:06,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:06,555 INFO L475 AbstractCegarLoop]: Abstraction has 2163 states and 3201 transitions. [2019-10-02 16:18:06,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:06,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 3201 transitions. [2019-10-02 16:18:06,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 16:18:06,560 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:06,561 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:06,561 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:06,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:06,562 INFO L82 PathProgramCache]: Analyzing trace with hash -132146072, now seen corresponding path program 1 times [2019-10-02 16:18:06,562 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:06,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:06,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:06,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:06,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:06,633 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-02 16:18:06,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:06,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:18:06,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:06,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:06,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:06,635 INFO L87 Difference]: Start difference. First operand 2163 states and 3201 transitions. Second operand 5 states. [2019-10-02 16:18:06,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:06,921 INFO L93 Difference]: Finished difference Result 4337 states and 6418 transitions. [2019-10-02 16:18:06,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:06,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-10-02 16:18:06,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:06,931 INFO L225 Difference]: With dead ends: 4337 [2019-10-02 16:18:06,932 INFO L226 Difference]: Without dead ends: 2155 [2019-10-02 16:18:06,936 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:18:06,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2019-10-02 16:18:07,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 2131. [2019-10-02 16:18:07,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-10-02 16:18:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 3145 transitions. [2019-10-02 16:18:07,035 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 3145 transitions. Word has length 156 [2019-10-02 16:18:07,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:07,035 INFO L475 AbstractCegarLoop]: Abstraction has 2131 states and 3145 transitions. [2019-10-02 16:18:07,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:07,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 3145 transitions. [2019-10-02 16:18:07,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-02 16:18:07,040 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:07,040 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:07,040 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:07,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:07,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1669045776, now seen corresponding path program 1 times [2019-10-02 16:18:07,041 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:07,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:07,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:07,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:07,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:07,134 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-02 16:18:07,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:18:07,135 INFO L224 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 [2019-10-02 16:18:07,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:07,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 16:18:07,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:18:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-02 16:18:07,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:18:07,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 16:18:07,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:07,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:07,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:07,470 INFO L87 Difference]: Start difference. First operand 2131 states and 3145 transitions. Second operand 5 states. [2019-10-02 16:18:08,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:08,664 INFO L93 Difference]: Finished difference Result 7470 states and 10982 transitions. [2019-10-02 16:18:08,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 16:18:08,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 188 [2019-10-02 16:18:08,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:08,697 INFO L225 Difference]: With dead ends: 7470 [2019-10-02 16:18:08,698 INFO L226 Difference]: Without dead ends: 5287 [2019-10-02 16:18:08,709 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 16:18:08,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5287 states. [2019-10-02 16:18:08,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5287 to 3006. [2019-10-02 16:18:08,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3006 states. [2019-10-02 16:18:08,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3006 states to 3006 states and 4356 transitions. [2019-10-02 16:18:08,968 INFO L78 Accepts]: Start accepts. Automaton has 3006 states and 4356 transitions. Word has length 188 [2019-10-02 16:18:08,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:08,969 INFO L475 AbstractCegarLoop]: Abstraction has 3006 states and 4356 transitions. [2019-10-02 16:18:08,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:08,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3006 states and 4356 transitions. [2019-10-02 16:18:08,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 16:18:08,978 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:08,978 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:08,979 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:08,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:08,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1467791988, now seen corresponding path program 1 times [2019-10-02 16:18:08,979 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:08,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:08,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:08,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:08,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:09,090 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-02 16:18:09,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:09,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:09,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:09,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:09,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:09,092 INFO L87 Difference]: Start difference. First operand 3006 states and 4356 transitions. Second operand 3 states. [2019-10-02 16:18:09,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:09,277 INFO L93 Difference]: Finished difference Result 4787 states and 6941 transitions. [2019-10-02 16:18:09,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:09,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-02 16:18:09,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:09,303 INFO L225 Difference]: With dead ends: 4787 [2019-10-02 16:18:09,304 INFO L226 Difference]: Without dead ends: 3599 [2019-10-02 16:18:09,313 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:09,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3599 states. [2019-10-02 16:18:09,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3599 to 3599. [2019-10-02 16:18:09,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3599 states. [2019-10-02 16:18:09,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 3599 states and 5219 transitions. [2019-10-02 16:18:09,503 INFO L78 Accepts]: Start accepts. Automaton has 3599 states and 5219 transitions. Word has length 192 [2019-10-02 16:18:09,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:09,504 INFO L475 AbstractCegarLoop]: Abstraction has 3599 states and 5219 transitions. [2019-10-02 16:18:09,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 5219 transitions. [2019-10-02 16:18:09,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-02 16:18:09,518 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:09,518 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:09,519 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:09,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:09,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1040739973, now seen corresponding path program 1 times [2019-10-02 16:18:09,520 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:09,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:09,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:09,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:09,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-10-02 16:18:09,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:09,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:09,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:09,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:09,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:09,613 INFO L87 Difference]: Start difference. First operand 3599 states and 5219 transitions. Second operand 3 states. [2019-10-02 16:18:09,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:09,923 INFO L93 Difference]: Finished difference Result 7219 states and 10458 transitions. [2019-10-02 16:18:09,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:09,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-10-02 16:18:09,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:09,934 INFO L225 Difference]: With dead ends: 7219 [2019-10-02 16:18:09,934 INFO L226 Difference]: Without dead ends: 3659 [2019-10-02 16:18:09,944 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:09,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3659 states. [2019-10-02 16:18:10,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3659 to 3599. [2019-10-02 16:18:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3599 states. [2019-10-02 16:18:10,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 3599 states and 5171 transitions. [2019-10-02 16:18:10,175 INFO L78 Accepts]: Start accepts. Automaton has 3599 states and 5171 transitions. Word has length 270 [2019-10-02 16:18:10,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:10,175 INFO L475 AbstractCegarLoop]: Abstraction has 3599 states and 5171 transitions. [2019-10-02 16:18:10,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 5171 transitions. [2019-10-02 16:18:10,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-02 16:18:10,185 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:10,185 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:10,186 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:10,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:10,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1618154303, now seen corresponding path program 1 times [2019-10-02 16:18:10,186 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:10,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:10,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:10,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:10,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-02 16:18:10,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:10,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:10,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:10,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:10,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:10,267 INFO L87 Difference]: Start difference. First operand 3599 states and 5171 transitions. Second operand 3 states. [2019-10-02 16:18:10,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:10,610 INFO L93 Difference]: Finished difference Result 7249 states and 10392 transitions. [2019-10-02 16:18:10,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:10,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-10-02 16:18:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:10,622 INFO L225 Difference]: With dead ends: 7249 [2019-10-02 16:18:10,623 INFO L226 Difference]: Without dead ends: 3689 [2019-10-02 16:18:10,634 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:10,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2019-10-02 16:18:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3599. [2019-10-02 16:18:10,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3599 states. [2019-10-02 16:18:10,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 3599 states and 4955 transitions. [2019-10-02 16:18:10,870 INFO L78 Accepts]: Start accepts. Automaton has 3599 states and 4955 transitions. Word has length 274 [2019-10-02 16:18:10,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:10,870 INFO L475 AbstractCegarLoop]: Abstraction has 3599 states and 4955 transitions. [2019-10-02 16:18:10,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:10,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 4955 transitions. [2019-10-02 16:18:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-02 16:18:10,887 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:10,888 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:10,888 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:10,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:10,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1393049634, now seen corresponding path program 1 times [2019-10-02 16:18:10,889 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:10,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:10,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:10,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:10,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-10-02 16:18:11,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:11,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:11,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:11,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:11,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:11,058 INFO L87 Difference]: Start difference. First operand 3599 states and 4955 transitions. Second operand 3 states. [2019-10-02 16:18:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:11,407 INFO L93 Difference]: Finished difference Result 7249 states and 9968 transitions. [2019-10-02 16:18:11,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:11,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2019-10-02 16:18:11,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:11,416 INFO L225 Difference]: With dead ends: 7249 [2019-10-02 16:18:11,416 INFO L226 Difference]: Without dead ends: 3689 [2019-10-02 16:18:11,424 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:11,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2019-10-02 16:18:11,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3599. [2019-10-02 16:18:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3599 states. [2019-10-02 16:18:11,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 3599 states and 4895 transitions. [2019-10-02 16:18:11,588 INFO L78 Accepts]: Start accepts. Automaton has 3599 states and 4895 transitions. Word has length 284 [2019-10-02 16:18:11,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:11,589 INFO L475 AbstractCegarLoop]: Abstraction has 3599 states and 4895 transitions. [2019-10-02 16:18:11,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:11,589 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 4895 transitions. [2019-10-02 16:18:11,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-02 16:18:11,599 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:11,599 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:11,599 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:11,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:11,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1875632044, now seen corresponding path program 1 times [2019-10-02 16:18:11,600 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:11,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:11,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:11,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:11,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:11,701 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-10-02 16:18:11,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:18:11,701 INFO L224 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 [2019-10-02 16:18:11,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:11,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:18:11,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:18:11,944 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-10-02 16:18:11,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 16:18:11,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-02 16:18:11,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 16:18:11,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 16:18:11,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:18:11,959 INFO L87 Difference]: Start difference. First operand 3599 states and 4895 transitions. Second operand 4 states. [2019-10-02 16:18:12,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:12,444 INFO L93 Difference]: Finished difference Result 8384 states and 11255 transitions. [2019-10-02 16:18:12,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:18:12,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 303 [2019-10-02 16:18:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:12,456 INFO L225 Difference]: With dead ends: 8384 [2019-10-02 16:18:12,457 INFO L226 Difference]: Without dead ends: 4794 [2019-10-02 16:18:12,466 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:12,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4794 states. [2019-10-02 16:18:12,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4794 to 3413. [2019-10-02 16:18:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3413 states. [2019-10-02 16:18:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3413 states to 3413 states and 4595 transitions. [2019-10-02 16:18:12,630 INFO L78 Accepts]: Start accepts. Automaton has 3413 states and 4595 transitions. Word has length 303 [2019-10-02 16:18:12,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:12,630 INFO L475 AbstractCegarLoop]: Abstraction has 3413 states and 4595 transitions. [2019-10-02 16:18:12,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 16:18:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 3413 states and 4595 transitions. [2019-10-02 16:18:12,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-02 16:18:12,641 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:12,642 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:12,642 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:12,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:12,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1215949711, now seen corresponding path program 1 times [2019-10-02 16:18:12,642 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:12,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:12,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:12,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:12,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-10-02 16:18:12,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:12,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:12,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:12,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:12,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:12,726 INFO L87 Difference]: Start difference. First operand 3413 states and 4595 transitions. Second operand 3 states. [2019-10-02 16:18:12,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:12,974 INFO L93 Difference]: Finished difference Result 6995 states and 9420 transitions. [2019-10-02 16:18:12,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:12,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-10-02 16:18:12,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:12,982 INFO L225 Difference]: With dead ends: 6995 [2019-10-02 16:18:12,982 INFO L226 Difference]: Without dead ends: 3513 [2019-10-02 16:18:12,990 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2019-10-02 16:18:13,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3503. [2019-10-02 16:18:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3503 states. [2019-10-02 16:18:13,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 4667 transitions. [2019-10-02 16:18:13,191 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 4667 transitions. Word has length 303 [2019-10-02 16:18:13,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:13,191 INFO L475 AbstractCegarLoop]: Abstraction has 3503 states and 4667 transitions. [2019-10-02 16:18:13,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:13,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 4667 transitions. [2019-10-02 16:18:13,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-10-02 16:18:13,201 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:13,202 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:13,202 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:13,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:13,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1498035288, now seen corresponding path program 1 times [2019-10-02 16:18:13,202 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:13,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:13,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:13,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:13,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-10-02 16:18:13,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:13,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:13,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:13,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:13,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:13,299 INFO L87 Difference]: Start difference. First operand 3503 states and 4667 transitions. Second operand 3 states. [2019-10-02 16:18:13,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:13,544 INFO L93 Difference]: Finished difference Result 7023 states and 9368 transitions. [2019-10-02 16:18:13,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:13,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-10-02 16:18:13,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:13,551 INFO L225 Difference]: With dead ends: 7023 [2019-10-02 16:18:13,552 INFO L226 Difference]: Without dead ends: 3559 [2019-10-02 16:18:13,559 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:13,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3559 states. [2019-10-02 16:18:13,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3559 to 3503. [2019-10-02 16:18:13,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3503 states. [2019-10-02 16:18:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 4661 transitions. [2019-10-02 16:18:13,707 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 4661 transitions. Word has length 304 [2019-10-02 16:18:13,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:13,708 INFO L475 AbstractCegarLoop]: Abstraction has 3503 states and 4661 transitions. [2019-10-02 16:18:13,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:13,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 4661 transitions. [2019-10-02 16:18:13,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-10-02 16:18:13,715 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:13,716 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:13,716 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:13,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:13,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1685249203, now seen corresponding path program 1 times [2019-10-02 16:18:13,717 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:13,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:13,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:13,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:13,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:13,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 687 proven. 16 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-10-02 16:18:13,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:18:13,815 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:18:13,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:13,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:18:13,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:18:14,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-10-02 16:18:14,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:18:14,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 16:18:14,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:14,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:14,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:14,162 INFO L87 Difference]: Start difference. First operand 3503 states and 4661 transitions. Second operand 5 states. [2019-10-02 16:18:14,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:14,943 INFO L93 Difference]: Finished difference Result 11011 states and 14412 transitions. [2019-10-02 16:18:14,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 16:18:14,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 315 [2019-10-02 16:18:14,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:14,963 INFO L225 Difference]: With dead ends: 11011 [2019-10-02 16:18:14,963 INFO L226 Difference]: Without dead ends: 7547 [2019-10-02 16:18:14,971 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 16:18:14,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7547 states. [2019-10-02 16:18:15,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7547 to 4499. [2019-10-02 16:18:15,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4499 states. [2019-10-02 16:18:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4499 states to 4499 states and 5764 transitions. [2019-10-02 16:18:15,198 INFO L78 Accepts]: Start accepts. Automaton has 4499 states and 5764 transitions. Word has length 315 [2019-10-02 16:18:15,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:15,200 INFO L475 AbstractCegarLoop]: Abstraction has 4499 states and 5764 transitions. [2019-10-02 16:18:15,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:15,200 INFO L276 IsEmpty]: Start isEmpty. Operand 4499 states and 5764 transitions. [2019-10-02 16:18:15,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-10-02 16:18:15,209 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:15,209 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:15,209 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:15,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:15,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1793866143, now seen corresponding path program 1 times [2019-10-02 16:18:15,210 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:15,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:15,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:15,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:15,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-02 16:18:15,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:15,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:15,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:15,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:15,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:15,304 INFO L87 Difference]: Start difference. First operand 4499 states and 5764 transitions. Second operand 3 states. [2019-10-02 16:18:15,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:15,602 INFO L93 Difference]: Finished difference Result 9044 states and 11563 transitions. [2019-10-02 16:18:15,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:15,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-10-02 16:18:15,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:15,613 INFO L225 Difference]: With dead ends: 9044 [2019-10-02 16:18:15,613 INFO L226 Difference]: Without dead ends: 4584 [2019-10-02 16:18:15,622 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:15,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4584 states. [2019-10-02 16:18:15,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4584 to 4499. [2019-10-02 16:18:15,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4499 states. [2019-10-02 16:18:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4499 states to 4499 states and 5674 transitions. [2019-10-02 16:18:15,820 INFO L78 Accepts]: Start accepts. Automaton has 4499 states and 5674 transitions. Word has length 327 [2019-10-02 16:18:15,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:15,820 INFO L475 AbstractCegarLoop]: Abstraction has 4499 states and 5674 transitions. [2019-10-02 16:18:15,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:15,821 INFO L276 IsEmpty]: Start isEmpty. Operand 4499 states and 5674 transitions. [2019-10-02 16:18:15,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-10-02 16:18:15,830 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:15,831 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:15,831 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:15,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:15,831 INFO L82 PathProgramCache]: Analyzing trace with hash -30585770, now seen corresponding path program 1 times [2019-10-02 16:18:15,831 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:15,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:15,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:15,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:15,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 926 proven. 26 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-02 16:18:15,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:18:15,963 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:18:15,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:16,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 16:18:16,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:18:16,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 831 proven. 0 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-10-02 16:18:16,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:18:16,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 16:18:16,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:18:16,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:18:16,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:16,151 INFO L87 Difference]: Start difference. First operand 4499 states and 5674 transitions. Second operand 5 states. [2019-10-02 16:18:16,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:16,996 INFO L93 Difference]: Finished difference Result 12069 states and 15181 transitions. [2019-10-02 16:18:16,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 16:18:16,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 370 [2019-10-02 16:18:16,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:17,011 INFO L225 Difference]: With dead ends: 12069 [2019-10-02 16:18:17,011 INFO L226 Difference]: Without dead ends: 7609 [2019-10-02 16:18:17,020 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:18:17,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7609 states. [2019-10-02 16:18:17,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7609 to 4559. [2019-10-02 16:18:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4559 states. [2019-10-02 16:18:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4559 states to 4559 states and 5677 transitions. [2019-10-02 16:18:17,248 INFO L78 Accepts]: Start accepts. Automaton has 4559 states and 5677 transitions. Word has length 370 [2019-10-02 16:18:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:17,248 INFO L475 AbstractCegarLoop]: Abstraction has 4559 states and 5677 transitions. [2019-10-02 16:18:17,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:18:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 4559 states and 5677 transitions. [2019-10-02 16:18:17,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-10-02 16:18:17,262 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:17,262 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:17,263 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:17,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:17,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1004200358, now seen corresponding path program 1 times [2019-10-02 16:18:17,264 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:17,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:17,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:17,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:17,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:17,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 868 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-02 16:18:17,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:17,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:17,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:17,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:17,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:17,382 INFO L87 Difference]: Start difference. First operand 4559 states and 5677 transitions. Second operand 3 states. [2019-10-02 16:18:17,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:17,599 INFO L93 Difference]: Finished difference Result 8511 states and 10608 transitions. [2019-10-02 16:18:17,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:17,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2019-10-02 16:18:17,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:17,608 INFO L225 Difference]: With dead ends: 8511 [2019-10-02 16:18:17,608 INFO L226 Difference]: Without dead ends: 3870 [2019-10-02 16:18:17,615 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:17,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3870 states. [2019-10-02 16:18:17,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3870 to 3781. [2019-10-02 16:18:17,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3781 states. [2019-10-02 16:18:17,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 4673 transitions. [2019-10-02 16:18:17,839 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 4673 transitions. Word has length 393 [2019-10-02 16:18:17,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:17,840 INFO L475 AbstractCegarLoop]: Abstraction has 3781 states and 4673 transitions. [2019-10-02 16:18:17,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:17,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 4673 transitions. [2019-10-02 16:18:17,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-10-02 16:18:17,851 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:17,852 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:17,852 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:17,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:17,852 INFO L82 PathProgramCache]: Analyzing trace with hash 404718799, now seen corresponding path program 1 times [2019-10-02 16:18:17,853 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:17,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:17,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:17,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:17,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 863 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-10-02 16:18:17,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:17,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:17,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:17,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:17,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:17,986 INFO L87 Difference]: Start difference. First operand 3781 states and 4673 transitions. Second operand 3 states. [2019-10-02 16:18:18,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:18,180 INFO L93 Difference]: Finished difference Result 7161 states and 8862 transitions. [2019-10-02 16:18:18,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:18,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2019-10-02 16:18:18,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:18,190 INFO L225 Difference]: With dead ends: 7161 [2019-10-02 16:18:18,190 INFO L226 Difference]: Without dead ends: 3793 [2019-10-02 16:18:18,195 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:18,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3793 states. [2019-10-02 16:18:18,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3793 to 3781. [2019-10-02 16:18:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3781 states. [2019-10-02 16:18:18,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 4667 transitions. [2019-10-02 16:18:18,356 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 4667 transitions. Word has length 393 [2019-10-02 16:18:18,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:18,357 INFO L475 AbstractCegarLoop]: Abstraction has 3781 states and 4667 transitions. [2019-10-02 16:18:18,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:18,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 4667 transitions. [2019-10-02 16:18:18,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-10-02 16:18:18,365 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:18,365 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:18:18,365 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:18,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:18,366 INFO L82 PathProgramCache]: Analyzing trace with hash -676110835, now seen corresponding path program 1 times [2019-10-02 16:18:18,366 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:18,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:18,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:18,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:18,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-10-02 16:18:18,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:18:18,538 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:18:18,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:18,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:18:18,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:18:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 16:18:18,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 16:18:18,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-02 16:18:18,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 16:18:18,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 16:18:18,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:18:18,825 INFO L87 Difference]: Start difference. First operand 3781 states and 4667 transitions. Second operand 4 states. [2019-10-02 16:18:19,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:19,027 INFO L93 Difference]: Finished difference Result 5807 states and 7179 transitions. [2019-10-02 16:18:19,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 16:18:19,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 427 [2019-10-02 16:18:19,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:19,029 INFO L225 Difference]: With dead ends: 5807 [2019-10-02 16:18:19,029 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 16:18:19,041 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:18:19,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 16:18:19,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 16:18:19,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 16:18:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 16:18:19,042 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 427 [2019-10-02 16:18:19,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:19,042 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 16:18:19,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 16:18:19,042 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 16:18:19,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 16:18:19,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 16:18:19,230 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 166 [2019-10-02 16:18:19,350 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 166 [2019-10-02 16:18:19,494 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 165 [2019-10-02 16:18:21,717 WARN L191 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 717 DAG size of output: 455 [2019-10-02 16:18:22,184 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 194 [2019-10-02 16:18:24,121 WARN L191 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 718 DAG size of output: 456 [2019-10-02 16:18:24,752 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 235 [2019-10-02 16:18:26,058 WARN L191 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 153 DAG size of output: 88 [2019-10-02 16:18:27,321 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 153 DAG size of output: 88 [2019-10-02 16:18:28,223 WARN L191 SmtUtils]: Spent 900.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 72 [2019-10-02 16:18:39,985 WARN L191 SmtUtils]: Spent 11.75 s on a formula simplification. DAG size of input: 343 DAG size of output: 157 [2019-10-02 16:18:41,643 WARN L191 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 177 DAG size of output: 94 [2019-10-02 16:18:42,727 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 152 DAG size of output: 77 [2019-10-02 16:18:44,519 WARN L191 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 171 DAG size of output: 96 [2019-10-02 16:18:46,024 WARN L191 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 173 DAG size of output: 72 [2019-10-02 16:18:47,498 WARN L191 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 173 DAG size of output: 72 [2019-10-02 16:18:49,154 WARN L191 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 191 DAG size of output: 77 [2019-10-02 16:18:50,688 WARN L191 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 192 DAG size of output: 114 [2019-10-02 16:19:01,635 WARN L191 SmtUtils]: Spent 10.94 s on a formula simplification. DAG size of input: 344 DAG size of output: 136 [2019-10-02 16:19:03,192 WARN L191 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 187 DAG size of output: 80 [2019-10-02 16:19:03,326 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-10-02 16:19:04,785 WARN L191 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 196 DAG size of output: 121 [2019-10-02 16:19:06,538 WARN L191 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 209 DAG size of output: 84 [2019-10-02 16:19:06,671 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-10-02 16:19:07,827 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 154 DAG size of output: 88 [2019-10-02 16:19:09,180 WARN L191 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 193 DAG size of output: 93 [2019-10-02 16:19:10,666 WARN L191 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 173 DAG size of output: 72 [2019-10-02 16:19:12,065 WARN L191 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 168 DAG size of output: 103 [2019-10-02 16:19:13,809 WARN L191 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 233 DAG size of output: 139 [2019-10-02 16:19:13,812 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-02 16:19:13,813 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 16:19:13,813 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 16:19:13,813 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 16:19:13,813 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 16:19:13,813 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 16:19:13,813 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 628 639) the Hoare annotation is: true [2019-10-02 16:19:13,813 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 628 639) no Hoare annotation was computed. [2019-10-02 16:19:13,814 INFO L439 ceAbstractionStarter]: At program point L635(line 635) the Hoare annotation is: (and (<= 8464 main_~s~0) (<= main_~s~0 8464)) [2019-10-02 16:19:13,814 INFO L443 ceAbstractionStarter]: For program point L635-1(line 635) no Hoare annotation was computed. [2019-10-02 16:19:13,814 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 628 639) no Hoare annotation was computed. [2019-10-02 16:19:13,814 INFO L443 ceAbstractionStarter]: For program point L597(lines 597 611) no Hoare annotation was computed. [2019-10-02 16:19:13,814 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 374) no Hoare annotation was computed. [2019-10-02 16:19:13,814 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 562) no Hoare annotation was computed. [2019-10-02 16:19:13,814 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 573) no Hoare annotation was computed. [2019-10-02 16:19:13,815 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 584) no Hoare annotation was computed. [2019-10-02 16:19:13,815 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 595) no Hoare annotation was computed. [2019-10-02 16:19:13,815 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 603) no Hoare annotation was computed. [2019-10-02 16:19:13,815 INFO L443 ceAbstractionStarter]: For program point L598-2(lines 597 611) no Hoare annotation was computed. [2019-10-02 16:19:13,815 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-10-02 16:19:13,815 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 563) the Hoare annotation is: (let ((.cse3 (= |ssl3_accept_#in~initial_state| 8641)) (.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse17 (= 8560 |ssl3_accept_#in~initial_state|)) (.cse20 (= 8608 |ssl3_accept_#in~initial_state|)) (.cse4 (= 8497 |ssl3_accept_#in~initial_state|)) (.cse12 (= |ssl3_accept_#in~initial_state| 8512)) (.cse8 (= |ssl3_accept_#in~initial_state| 8544)) (.cse5 (= 8513 |ssl3_accept_#in~initial_state|)) (.cse2 (= |ssl3_accept_#in~initial_state| 8529)) (.cse25 (= |ssl3_accept_#in~initial_state| 8481)) (.cse10 (= 8640 |ssl3_accept_#in~initial_state|)) (.cse18 (= 12292 |ssl3_accept_#in~initial_state|)) (.cse16 (= |ssl3_accept_#in~initial_state| 8592)) (.cse7 (= 8673 |ssl3_accept_#in~initial_state|)) (.cse1 (= |ssl3_accept_#in~initial_state| 8593)) (.cse11 (= |ssl3_accept_#in~initial_state| 8561)) (.cse21 (= 8448 |ssl3_accept_#in~initial_state|)) (.cse22 (= 8609 |ssl3_accept_#in~initial_state|)) (.cse27 (= |ssl3_accept_#in~initial_state| 8496)) (.cse6 (= |ssl3_accept_#in~initial_state| 8528)) (.cse9 (= |ssl3_accept_#in~initial_state| 8672)) (.cse24 (= 8545 |ssl3_accept_#in~initial_state|))) (let ((.cse13 (and (not .cse3) (not .cse0) (not (= ssl3_accept_~s__state~0 8593)) (not (= ssl3_accept_~s__state~0 8481)) (not .cse17) (not (= ssl3_accept_~s__state~0 8528)) (not (= ssl3_accept_~s__state~0 8496)) (not .cse20) (not .cse4) (not (= ssl3_accept_~s__state~0 8545)) (not .cse12) (not (= ssl3_accept_~s__state~0 8480)) (not .cse8) (not .cse5) (not .cse2) (not (= ssl3_accept_~s__state~0 12292)) (not .cse25) (not (= ssl3_accept_~s__state~0 8529)) (not .cse10) (not .cse18) (not (= ssl3_accept_~s__state~0 8640)) (not .cse16) (not (= ssl3_accept_~s__state~0 8561)) (not .cse7) (not .cse1) (not (= ssl3_accept_~s__state~0 8448)) (not .cse11) (not (= ssl3_accept_~s__state~0 8641)) (not (= ssl3_accept_~s__state~0 8512)) (not .cse21) (not (= ssl3_accept_~s__state~0 8609)) (not (= ssl3_accept_~s__state~0 8544)) (not (= ssl3_accept_~s__state~0 8608)) (not (= ssl3_accept_~s__state~0 8560)) (not (= ssl3_accept_~s__state~0 8513)) (not (= ssl3_accept_~s__state~0 8497)) (not .cse22) (not .cse27) (not .cse6) (not .cse9) (not .cse24) (not (= ssl3_accept_~s__state~0 8592)))) (.cse23 (= |ssl3_accept_#in~initial_state| 8656)) (.cse26 (= 8657 |ssl3_accept_#in~initial_state|))) (let ((.cse15 (= ssl3_accept_~s__hit~0 0)) (.cse14 (<= 8672 ssl3_accept_~s__state~0)) (.cse19 (and .cse13 (not .cse23) (<= ssl3_accept_~blastFlag~0 6) (not (= ssl3_accept_~s__state~0 8656)) (not .cse26) (not (= ssl3_accept_~s__state~0 8657))))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and (and (and .cse13 (<= 6 ssl3_accept_~blastFlag~0)) .cse14) .cse15) .cse16 .cse17 .cse18 (and .cse14 .cse19 (<= ssl3_accept_~blastFlag~0 4)) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (and .cse15 (and .cse14 .cse19) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)))))) [2019-10-02 16:19:13,816 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 595) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561)) [2019-10-02 16:19:13,816 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 503) no Hoare annotation was computed. [2019-10-02 16:19:13,816 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 602) no Hoare annotation was computed. [2019-10-02 16:19:13,816 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 435 443) no Hoare annotation was computed. [2019-10-02 16:19:13,816 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 373) no Hoare annotation was computed. [2019-10-02 16:19:13,816 INFO L443 ceAbstractionStarter]: For program point L336-1(lines 336 373) no Hoare annotation was computed. [2019-10-02 16:19:13,816 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 561) no Hoare annotation was computed. [2019-10-02 16:19:13,816 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 572) no Hoare annotation was computed. [2019-10-02 16:19:13,816 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 583) no Hoare annotation was computed. [2019-10-02 16:19:13,816 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 594) no Hoare annotation was computed. [2019-10-02 16:19:13,816 INFO L439 ceAbstractionStarter]: At program point L403(lines 394 415) the Hoare annotation is: (let ((.cse1 (<= 8544 ssl3_accept_~s__state~0)) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8560))) (.cse4 (<= ssl3_accept_~s__state~0 8576)) (.cse0 (= ssl3_accept_~s__hit~0 0))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 (and (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4)) (and (and (<= ssl3_accept_~blastFlag~0 7) .cse1 (<= 6 ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4) .cse0) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496))) [2019-10-02 16:19:13,817 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 370) no Hoare annotation was computed. [2019-10-02 16:19:13,817 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 314) no Hoare annotation was computed. [2019-10-02 16:19:13,817 INFO L443 ceAbstractionStarter]: For program point L304-2(lines 304 314) no Hoare annotation was computed. [2019-10-02 16:19:13,817 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 561) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (not (= ssl3_accept_~s__state~0 8544)) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496)) [2019-10-02 16:19:13,817 INFO L439 ceAbstractionStarter]: At program point L172(lines 168 573) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8640)) (.cse1 (not (= ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ssl3_accept_~s__state~0 8593))) (.cse3 (not (= ssl3_accept_~s__state~0 8640))) (.cse4 (not (= ssl3_accept_~s__state~0 8609))) (.cse5 (not (= ssl3_accept_~s__state~0 8592))) (.cse6 (<= 8576 ssl3_accept_~s__state~0))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (and (and .cse0 (and (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5)) .cse6) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (and (and .cse0 (and (<= ssl3_accept_~blastFlag~0 7) (<= 6 ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5)) (= ssl3_accept_~s__hit~0 0) .cse6) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496))) [2019-10-02 16:19:13,818 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 584) the Hoare annotation is: (let ((.cse13 (= |ssl3_accept_#in~initial_state| 8592)) (.cse7 (= 8673 |ssl3_accept_#in~initial_state|)) (.cse1 (= |ssl3_accept_#in~initial_state| 8593)) (.cse9 (= |ssl3_accept_#in~initial_state| 8672)) (.cse3 (= |ssl3_accept_#in~initial_state| 8641)) (.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse14 (= 8560 |ssl3_accept_#in~initial_state|)) (.cse4 (= 8497 |ssl3_accept_#in~initial_state|)) (.cse16 (= 8608 |ssl3_accept_#in~initial_state|)) (.cse12 (= |ssl3_accept_#in~initial_state| 8512)) (.cse8 (= |ssl3_accept_#in~initial_state| 8544)) (.cse5 (= 8513 |ssl3_accept_#in~initial_state|)) (.cse2 (= |ssl3_accept_#in~initial_state| 8529)) (.cse23 (= |ssl3_accept_#in~initial_state| 8481)) (.cse10 (= 8640 |ssl3_accept_#in~initial_state|)) (.cse15 (= 12292 |ssl3_accept_#in~initial_state|)) (.cse11 (= |ssl3_accept_#in~initial_state| 8561)) (.cse17 (= 8448 |ssl3_accept_#in~initial_state|)) (.cse18 (= 8609 |ssl3_accept_#in~initial_state|)) (.cse24 (= |ssl3_accept_#in~initial_state| 8496)) (.cse6 (= |ssl3_accept_#in~initial_state| 8528)) (.cse19 (= 8545 |ssl3_accept_#in~initial_state|))) (let ((.cse20 (and (not .cse13) (not .cse7) (not .cse1) (not .cse9) (and (not .cse3) (not .cse0) (not (= ssl3_accept_~s__state~0 8481)) (not .cse14) (not (= ssl3_accept_~s__state~0 8528)) (not .cse4) (not .cse16) (not (= ssl3_accept_~s__state~0 8545)) (not .cse12) (not (= ssl3_accept_~s__state~0 8480)) (not .cse8) (not .cse5) (not .cse2) (not .cse23) (not (= ssl3_accept_~s__state~0 8529)) (not .cse10) (not .cse15) (not (= ssl3_accept_~s__state~0 8561)) (not .cse11) (not (= ssl3_accept_~s__state~0 8512)) (not .cse17) (not (= ssl3_accept_~s__state~0 8544)) (not (= ssl3_accept_~s__state~0 8560)) (not (= ssl3_accept_~s__state~0 8513)) (not .cse18) (not .cse24) (not .cse6) (not .cse19)))) (.cse21 (<= ssl3_accept_~s__state~0 8576)) (.cse22 (<= 8466 ssl3_accept_~s__state~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= |ssl3_accept_#in~initial_state| 8656) .cse19 (and (and (= ssl3_accept_~s__hit~0 0) (and .cse20 .cse21 (<= 6 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~blastFlag~0 7))) .cse22) .cse23 (= 8657 |ssl3_accept_#in~initial_state|) .cse24 (and (and .cse20 .cse21 (<= ssl3_accept_~blastFlag~0 2)) .cse22)))) [2019-10-02 16:19:13,818 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 540) no Hoare annotation was computed. [2019-10-02 16:19:13,818 INFO L443 ceAbstractionStarter]: For program point L536-2(lines 536 540) no Hoare annotation was computed. [2019-10-02 16:19:13,818 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 441) no Hoare annotation was computed. [2019-10-02 16:19:13,818 INFO L439 ceAbstractionStarter]: At program point L207(lines 206 561) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (not (= ssl3_accept_~s__state~0 8544)) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496)) [2019-10-02 16:19:13,818 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 571) no Hoare annotation was computed. [2019-10-02 16:19:13,818 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 582) no Hoare annotation was computed. [2019-10-02 16:19:13,818 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 593) no Hoare annotation was computed. [2019-10-02 16:19:13,818 INFO L443 ceAbstractionStarter]: For program point L505(lines 505 515) no Hoare annotation was computed. [2019-10-02 16:19:13,818 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 408) no Hoare annotation was computed. [2019-10-02 16:19:13,818 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 276) no Hoare annotation was computed. [2019-10-02 16:19:13,818 INFO L443 ceAbstractionStarter]: For program point L274-2(lines 208 558) no Hoare annotation was computed. [2019-10-02 16:19:13,819 INFO L446 ceAbstractionStarter]: At program point ssl3_acceptENTRY(lines 11 627) the Hoare annotation is: true [2019-10-02 16:19:13,819 INFO L443 ceAbstractionStarter]: For program point L605(lines 605 609) no Hoare annotation was computed. [2019-10-02 16:19:13,819 INFO L443 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2019-10-02 16:19:13,819 INFO L443 ceAbstractionStarter]: For program point L308-2(lines 306 314) no Hoare annotation was computed. [2019-10-02 16:19:13,819 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 368) no Hoare annotation was computed. [2019-10-02 16:19:13,819 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 253) no Hoare annotation was computed. [2019-10-02 16:19:13,819 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 570) no Hoare annotation was computed. [2019-10-02 16:19:13,819 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 581) no Hoare annotation was computed. [2019-10-02 16:19:13,819 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 592) no Hoare annotation was computed. [2019-10-02 16:19:13,819 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 514) no Hoare annotation was computed. [2019-10-02 16:19:13,819 INFO L443 ceAbstractionStarter]: For program point L475(lines 475 477) no Hoare annotation was computed. [2019-10-02 16:19:13,820 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 411) no Hoare annotation was computed. [2019-10-02 16:19:13,820 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 247) no Hoare annotation was computed. [2019-10-02 16:19:13,820 INFO L439 ceAbstractionStarter]: At program point L211(lines 105 594) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (and (not (= ssl3_accept_~s__state~0 8481)) (<= ssl3_accept_~blastFlag~0 2) (not (= ssl3_accept_~s__state~0 8529)) (not (= ssl3_accept_~s__state~0 8672)) (not (= ssl3_accept_~s__state~0 8561)) (not (= ssl3_accept_~s__state~0 8448)) (not (= ssl3_accept_~s__state~0 8641)) (not (= ssl3_accept_~s__state~0 8544)) (not (= ssl3_accept_~s__state~0 8608)) (not (= ssl3_accept_~s__state~0 8656)) (not (= ssl3_accept_~s__state~0 8593)) (not (= ssl3_accept_~s__state~0 8528)) (not (= ssl3_accept_~s__state~0 8496)) (not (= ssl3_accept_~s__state~0 8545)) (not (= ssl3_accept_~s__state~0 8480)) (not (= ssl3_accept_~s__state~0 8657)) (not (= ssl3_accept_~s__state~0 12292)) (not (= ssl3_accept_~s__state~0 8640)) (not (= ssl3_accept_~s__state~0 8512)) (not (= ssl3_accept_~s__state~0 8609)) (not (= ssl3_accept_~s__state~0 8673)) (not (= ssl3_accept_~s__state~0 8560)) (not (= ssl3_accept_~s__state~0 8513)) (not (= ssl3_accept_~s__state~0 8497)) (not (= ssl3_accept_~s__state~0 8592))) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496)) [2019-10-02 16:19:13,820 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 571) the Hoare annotation is: (let ((.cse6 (= |ssl3_accept_#in~initial_state| 8641)) (.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse7 (= 8497 |ssl3_accept_#in~initial_state|)) (.cse11 (= |ssl3_accept_#in~initial_state| 8544)) (.cse8 (= 8513 |ssl3_accept_#in~initial_state|)) (.cse2 (= |ssl3_accept_#in~initial_state| 8529)) (.cse13 (= 8640 |ssl3_accept_#in~initial_state|)) (.cse10 (= 8673 |ssl3_accept_#in~initial_state|)) (.cse1 (= |ssl3_accept_#in~initial_state| 8593)) (.cse14 (= |ssl3_accept_#in~initial_state| 8561)) (.cse9 (= |ssl3_accept_#in~initial_state| 8528)) (.cse12 (= |ssl3_accept_#in~initial_state| 8672))) (let ((.cse4 (<= ssl3_accept_~s__state~0 8640)) (.cse3 (and (not .cse6) (not .cse0) (not .cse7) (not .cse11) (not .cse8) (not .cse2) (not .cse13) (not (= ssl3_accept_~s__state~0 8640)) (not (= ssl3_accept_~s__state~0 8672)) (not .cse10) (not .cse1) (not .cse14) (not (= ssl3_accept_~s__state~0 8641)) (not (= ssl3_accept_~s__state~0 8609)) (not (= ssl3_accept_~s__state~0 8608)) (not .cse9) (not .cse12))) (.cse5 (<= 8576 ssl3_accept_~s__state~0))) (or .cse0 .cse1 .cse2 (and (and (and (<= ssl3_accept_~blastFlag~0 2) .cse3) .cse4) .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and (= ssl3_accept_~s__hit~0 0) (and .cse4 (and .cse3 (<= 6 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~blastFlag~0 7))) .cse5) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496)))) [2019-10-02 16:19:13,821 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 582) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8529))) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ssl3_accept_~s__state~0 8528))) (.cse5 (not (= ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ssl3_accept_~s__state~0 8480))) (.cse8 (= ssl3_accept_~s__hit~0 0)) (.cse9 (not (= ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ssl3_accept_~s__state~0 8497))) (.cse11 (<= ssl3_accept_~s__state~0 8576)) (.cse12 (<= 8466 ssl3_accept_~s__state~0))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (= |ssl3_accept_#in~initial_state| 8656) (and (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (<= 6 ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496))) [2019-10-02 16:19:13,821 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2019-10-02 16:19:13,821 INFO L443 ceAbstractionStarter]: For program point L345-2(lines 345 349) no Hoare annotation was computed. [2019-10-02 16:19:13,821 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 569) no Hoare annotation was computed. [2019-10-02 16:19:13,821 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 580) no Hoare annotation was computed. [2019-10-02 16:19:13,821 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 591) no Hoare annotation was computed. [2019-10-02 16:19:13,821 INFO L443 ceAbstractionStarter]: For program point L511(lines 511 513) no Hoare annotation was computed. [2019-10-02 16:19:13,822 INFO L443 ceAbstractionStarter]: For program point L511-2(lines 208 558) no Hoare annotation was computed. [2019-10-02 16:19:13,822 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-10-02 16:19:13,822 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 552) no Hoare annotation was computed. [2019-10-02 16:19:13,822 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 546 552) no Hoare annotation was computed. [2019-10-02 16:19:13,822 INFO L443 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2019-10-02 16:19:13,822 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 568) no Hoare annotation was computed. [2019-10-02 16:19:13,822 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 579) no Hoare annotation was computed. [2019-10-02 16:19:13,822 INFO L443 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2019-10-02 16:19:13,822 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 590) no Hoare annotation was computed. [2019-10-02 16:19:13,823 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 417) no Hoare annotation was computed. [2019-10-02 16:19:13,823 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 569) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8593))) (.cse1 (<= ssl3_accept_~s__state~0 8640)) (.cse2 (not (= ssl3_accept_~s__state~0 8640))) (.cse3 (<= 8576 ssl3_accept_~s__state~0)) (.cse4 (not (= ssl3_accept_~s__state~0 8592)))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (and (<= ssl3_accept_~blastFlag~0 7) (<= 6 ssl3_accept_~blastFlag~0) .cse0 (= ssl3_accept_~s__hit~0 0) .cse1 .cse2 .cse3 .cse4) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496))) [2019-10-02 16:19:13,823 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 580) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ssl3_accept_~s__state~0 8496))) (.cse4 (not (= ssl3_accept_~s__state~0 8480))) (.cse5 (not (= ssl3_accept_~s__state~0 8545))) (.cse6 (= ssl3_accept_~s__hit~0 0)) (.cse7 (not (= ssl3_accept_~s__state~0 8512))) (.cse8 (not (= ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ssl3_accept_~s__state~0 8513))) (.cse10 (not (= ssl3_accept_~s__state~0 8497))) (.cse11 (<= ssl3_accept_~s__state~0 8576)) (.cse12 (<= 8466 ssl3_accept_~s__state~0))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (<= 6 ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (and (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496))) [2019-10-02 16:19:13,823 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-10-02 16:19:13,823 INFO L443 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-10-02 16:19:13,823 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 451) no Hoare annotation was computed. [2019-10-02 16:19:13,824 INFO L443 ceAbstractionStarter]: For program point L383(lines 383 389) no Hoare annotation was computed. [2019-10-02 16:19:13,824 INFO L446 ceAbstractionStarter]: At program point L615(lines 98 616) the Hoare annotation is: true [2019-10-02 16:19:13,824 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2019-10-02 16:19:13,824 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 567) no Hoare annotation was computed. [2019-10-02 16:19:13,824 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 578) no Hoare annotation was computed. [2019-10-02 16:19:13,824 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 589) no Hoare annotation was computed. [2019-10-02 16:19:13,824 INFO L443 ceAbstractionStarter]: For program point L484(lines 484 486) no Hoare annotation was computed. [2019-10-02 16:19:13,824 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 590) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561)) [2019-10-02 16:19:13,825 INFO L439 ceAbstractionStarter]: At program point L485(lines 72 626) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561)) [2019-10-02 16:19:13,825 INFO L443 ceAbstractionStarter]: For program point L452(lines 452 461) no Hoare annotation was computed. [2019-10-02 16:19:13,825 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 364) no Hoare annotation was computed. [2019-10-02 16:19:13,825 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 289) no Hoare annotation was computed. [2019-10-02 16:19:13,825 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-10-02 16:19:13,825 INFO L443 ceAbstractionStarter]: For program point L287-2(lines 208 558) no Hoare annotation was computed. [2019-10-02 16:19:13,825 INFO L443 ceAbstractionStarter]: For program point ssl3_acceptEXIT(lines 11 627) no Hoare annotation was computed. [2019-10-02 16:19:13,826 INFO L439 ceAbstractionStarter]: At program point L354(lines 330 375) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ssl3_accept_~s__state~0 8496))) (.cse4 (not (= ssl3_accept_~s__state~0 8480))) (.cse5 (not (= ssl3_accept_~s__state~0 8545))) (.cse6 (= ssl3_accept_~s__hit~0 0)) (.cse7 (not (= ssl3_accept_~s__state~0 8512))) (.cse8 (not (= ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ssl3_accept_~s__state~0 8513))) (.cse10 (not (= ssl3_accept_~s__state~0 8497))) (.cse11 (<= ssl3_accept_~s__state~0 8576)) (.cse12 (<= 8466 ssl3_accept_~s__state~0))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (<= 6 ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (and (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496))) [2019-10-02 16:19:13,826 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 566) no Hoare annotation was computed. [2019-10-02 16:19:13,826 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 577) no Hoare annotation was computed. [2019-10-02 16:19:13,826 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 588) no Hoare annotation was computed. [2019-10-02 16:19:13,826 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-10-02 16:19:13,826 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 72 626) no Hoare annotation was computed. [2019-10-02 16:19:13,826 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 489) no Hoare annotation was computed. [2019-10-02 16:19:13,827 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 567) the Hoare annotation is: (let ((.cse2 (= ssl3_accept_~s__hit~0 0)) (.cse0 (<= ssl3_accept_~s__state~0 8640)) (.cse1 (<= 8640 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~blastFlag~0 4)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (and (and (<= ssl3_accept_~blastFlag~0 2) .cse0) .cse1) (and (and .cse2 (and (and (<= ssl3_accept_~blastFlag~0 7) (<= 6 ssl3_accept_~blastFlag~0)) .cse0)) .cse1) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (and .cse1 (and .cse2 .cse0 .cse3 .cse4)) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (and .cse0 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse1 .cse3 .cse4) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496))) [2019-10-02 16:19:13,827 INFO L439 ceAbstractionStarter]: At program point L157(lines 153 578) the Hoare annotation is: (let ((.cse1 (<= 8544 ssl3_accept_~s__state~0)) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8560))) (.cse4 (<= ssl3_accept_~s__state~0 8576)) (.cse0 (= ssl3_accept_~s__hit~0 0))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 (and (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4)) (and (and (<= ssl3_accept_~blastFlag~0 7) .cse1 (<= 6 ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4) .cse0) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496))) [2019-10-02 16:19:13,827 INFO L439 ceAbstractionStarter]: At program point L124(lines 123 588) the Hoare annotation is: (let ((.cse8 (= ssl3_accept_~s__hit~0 0)) (.cse0 (not (= ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ssl3_accept_~s__state~0 8529))) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ssl3_accept_~s__state~0 8528))) (.cse5 (not (= ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ssl3_accept_~s__state~0 8480))) (.cse9 (not (= ssl3_accept_~s__state~0 8512))) (.cse10 (not (= ssl3_accept_~s__state~0 8560))) (.cse11 (not (= ssl3_accept_~s__state~0 8513))) (.cse12 (not (= ssl3_accept_~s__state~0 8497))) (.cse13 (<= ssl3_accept_~s__state~0 8576)) (.cse14 (<= 8466 ssl3_accept_~s__state~0))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse12 .cse13 .cse14) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (and .cse14 (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (<= 6 ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496) (and (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14))) [2019-10-02 16:19:13,828 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-10-02 16:19:13,828 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 622) no Hoare annotation was computed. [2019-10-02 16:19:13,828 INFO L443 ceAbstractionStarter]: For program point L620-2(lines 620 622) no Hoare annotation was computed. [2019-10-02 16:19:13,828 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 524) no Hoare annotation was computed. [2019-10-02 16:19:13,828 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-10-02 16:19:13,828 INFO L443 ceAbstractionStarter]: For program point L356-2(lines 353 362) no Hoare annotation was computed. [2019-10-02 16:19:13,828 INFO L443 ceAbstractionStarter]: For program point ssl3_acceptFINAL(lines 11 627) no Hoare annotation was computed. [2019-10-02 16:19:13,828 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 458) no Hoare annotation was computed. [2019-10-02 16:19:13,828 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 328) no Hoare annotation was computed. [2019-10-02 16:19:13,829 INFO L443 ceAbstractionStarter]: For program point L324-2(lines 208 558) no Hoare annotation was computed. [2019-10-02 16:19:13,829 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 565) no Hoare annotation was computed. [2019-10-02 16:19:13,829 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 576) no Hoare annotation was computed. [2019-10-02 16:19:13,829 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 587) no Hoare annotation was computed. [2019-10-02 16:19:13,829 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 494) no Hoare annotation was computed. [2019-10-02 16:19:13,829 INFO L443 ceAbstractionStarter]: For program point L490-2(lines 490 494) no Hoare annotation was computed. [2019-10-02 16:19:13,829 INFO L439 ceAbstractionStarter]: At program point L391(lines 382 417) the Hoare annotation is: (let ((.cse1 (<= 8544 ssl3_accept_~s__state~0)) (.cse2 (not (= ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ssl3_accept_~s__state~0 8560))) (.cse4 (<= ssl3_accept_~s__state~0 8576)) (.cse0 (= ssl3_accept_~s__hit~0 0))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 (and (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4)) (and (and (<= ssl3_accept_~blastFlag~0 7) .cse1 (<= 6 ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4) .cse0) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496))) [2019-10-02 16:19:13,830 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2019-10-02 16:19:13,830 INFO L443 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-10-02 16:19:13,830 INFO L443 ceAbstractionStarter]: For program point L226-2(lines 208 558) no Hoare annotation was computed. [2019-10-02 16:19:13,830 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-10-02 16:19:13,830 INFO L443 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-10-02 16:19:13,830 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-10-02 16:19:13,830 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 564) no Hoare annotation was computed. [2019-10-02 16:19:13,830 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 575) no Hoare annotation was computed. [2019-10-02 16:19:13,830 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 586) no Hoare annotation was computed. [2019-10-02 16:19:13,831 INFO L439 ceAbstractionStarter]: At program point L559(lines 99 614) the Hoare annotation is: (let ((.cse5 (not (= ssl3_accept_~s__state~0 8481))) (.cse6 (<= ssl3_accept_~blastFlag~0 2)) (.cse30 (= 8560 |ssl3_accept_#in~initial_state|)) (.cse23 (= 8513 |ssl3_accept_#in~initial_state|)) (.cse7 (not (= ssl3_accept_~s__state~0 8529))) (.cse51 (= |ssl3_accept_#in~initial_state| 8592)) (.cse48 (= |ssl3_accept_#in~initial_state| 8656)) (.cse8 (not (= ssl3_accept_~s__state~0 8561))) (.cse28 (= |ssl3_accept_#in~initial_state| 8561)) (.cse9 (not (= ssl3_accept_~s__state~0 8544))) (.cse34 (= 8609 |ssl3_accept_#in~initial_state|)) (.cse50 (= 8657 |ssl3_accept_#in~initial_state|)) (.cse39 (= |ssl3_accept_#in~initial_state| 8641)) (.cse10 (not (= ssl3_accept_~s__state~0 8528))) (.cse47 (= 8608 |ssl3_accept_#in~initial_state|)) (.cse40 (= 8497 |ssl3_accept_#in~initial_state|)) (.cse11 (not (= ssl3_accept_~s__state~0 8545))) (.cse12 (not (= ssl3_accept_~s__state~0 8480))) (.cse24 (= |ssl3_accept_#in~initial_state| 8544)) (.cse38 (= |ssl3_accept_#in~initial_state| 8529)) (.cse49 (= |ssl3_accept_#in~initial_state| 8481)) (.cse46 (= 8640 |ssl3_accept_#in~initial_state|)) (.cse42 (= 8673 |ssl3_accept_#in~initial_state|)) (.cse13 (not (= ssl3_accept_~s__state~0 8512))) (.cse14 (not (= ssl3_accept_~s__state~0 8560))) (.cse15 (not (= ssl3_accept_~s__state~0 8513))) (.cse16 (not (= ssl3_accept_~s__state~0 8497))) (.cse17 (<= ssl3_accept_~s__state~0 8576)) (.cse41 (= |ssl3_accept_#in~initial_state| 8528)) (.cse43 (= |ssl3_accept_#in~initial_state| 8672))) (let ((.cse22 (<= ssl3_accept_~s__state~0 3)) (.cse31 (<= 8672 ssl3_accept_~s__state~0)) (.cse18 (<= 8466 ssl3_accept_~s__state~0)) (.cse35 (not (= ssl3_accept_~s__state~0 8641))) (.cse36 (not (= ssl3_accept_~s__state~0 8657))) (.cse2 (<= 8640 ssl3_accept_~s__state~0)) (.cse33 (<= ssl3_accept_~s__state~0 8672)) (.cse29 (and .cse5 .cse6 (not .cse30) (not .cse23) .cse7 (not .cse51) (not .cse48) .cse8 (not (= ssl3_accept_~s__state~0 8448)) (not .cse28) .cse9 (not .cse34) (not .cse50) (not .cse39) .cse10 (not (= ssl3_accept_~s__state~0 8496)) (not .cse47) (not .cse40) .cse11 .cse12 (not .cse24) (not .cse38) (not .cse49) (not .cse46) (not .cse42) .cse13 .cse14 .cse15 .cse16 .cse17 (not .cse41) (not .cse43))) (.cse37 (<= ssl3_accept_~blastFlag~0 7)) (.cse32 (<= 6 ssl3_accept_~blastFlag~0)) (.cse25 (not (= ssl3_accept_~s__state~0 8593))) (.cse0 (<= ssl3_accept_~s__state~0 8640)) (.cse26 (not (= ssl3_accept_~s__state~0 8609))) (.cse27 (<= 8576 ssl3_accept_~s__state~0)) (.cse1 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse3 (<= ssl3_accept_~blastFlag~0 4)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse19 (<= 8448 ssl3_accept_~s__state~0)) (.cse44 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse45 (<= 8576 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse20 (<= ssl3_accept_~s__state~0 8448)) (.cse21 (= ssl3_accept_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse19 .cse20 .cse21) (and .cse22 .cse21 .cse4) .cse23 .cse24 (and .cse6 .cse25 .cse0 .cse26 .cse27) .cse28 (and .cse29 .cse22) .cse30 (and .cse31 .cse32 .cse21 .cse33) .cse34 (and .cse35 .cse21 .cse36 .cse2 .cse3 .cse4 .cse33) (and .cse31 .cse21 .cse4 .cse33) (and .cse1 .cse22 .cse3 .cse4) (and .cse37 .cse32 .cse22 .cse21) (and .cse31 .cse3 .cse33) .cse38 .cse39 .cse40 .cse41 .cse42 (and (and .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse21 .cse15 .cse16 .cse17) .cse18) .cse43 (and .cse37 .cse32 .cse19 .cse44 .cse45 .cse20 .cse21) .cse46 (and .cse5 .cse37 .cse32 .cse7 .cse8 .cse11 .cse12 .cse21 .cse15 .cse16 .cse17 .cse18) .cse47 .cse48 .cse49 .cse50 (and .cse6 .cse35 .cse36 .cse2 .cse33) .cse51 (and .cse37 .cse32 .cse35 .cse21 .cse36 .cse2 .cse33) (and .cse29 .cse19) (and .cse37 .cse32 .cse25 .cse21 .cse0 .cse26 .cse27) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (and .cse1 .cse19 .cse20 .cse3 .cse4) (= |ssl3_accept_#in~initial_state| 8512) (and .cse6 .cse19 .cse44 .cse45 .cse20 .cse21) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8545 |ssl3_accept_#in~initial_state|)))) [2019-10-02 16:19:13,831 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 429) no Hoare annotation was computed. [2019-10-02 16:19:13,831 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 415) no Hoare annotation was computed. [2019-10-02 16:19:13,832 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 565) the Hoare annotation is: (let ((.cse0 (= ssl3_accept_~s__hit~0 0)) (.cse1 (not (= ssl3_accept_~s__state~0 8640))) (.cse2 (not (= ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ssl3_accept_~s__state~0 8641))) (.cse4 (<= ssl3_accept_~s__state~0 8672)) (.cse5 (<= 8640 ssl3_accept_~s__state~0))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (and (and .cse0 (and (and (and (<= ssl3_accept_~blastFlag~0 7) .cse1 .cse2 .cse3) (<= 6 ssl3_accept_~blastFlag~0)) .cse4)) .cse5) (= |ssl3_accept_#in~initial_state| 8528) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (and (and (and .cse1 .cse2 .cse3) .cse0 .cse4 (<= ssl3_accept_~blastFlag~0 4) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) .cse5) (= |ssl3_accept_#in~initial_state| 8481) (and (and (and (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3) .cse4) .cse5) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496))) [2019-10-02 16:19:13,832 INFO L439 ceAbstractionStarter]: At program point L163(lines 159 576) the Hoare annotation is: (let ((.cse11 (= 8673 |ssl3_accept_#in~initial_state|)) (.cse1 (= |ssl3_accept_#in~initial_state| 8593)) (.cse8 (= 8497 |ssl3_accept_#in~initial_state|)) (.cse13 (= |ssl3_accept_#in~initial_state| 8672)) (.cse7 (= |ssl3_accept_#in~initial_state| 8641)) (.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse12 (= |ssl3_accept_#in~initial_state| 8544)) (.cse9 (= 8513 |ssl3_accept_#in~initial_state|)) (.cse6 (= |ssl3_accept_#in~initial_state| 8529)) (.cse14 (= 8640 |ssl3_accept_#in~initial_state|)) (.cse10 (= |ssl3_accept_#in~initial_state| 8528))) (let ((.cse2 (= ssl3_accept_~s__hit~0 0)) (.cse3 (<= 8544 ssl3_accept_~s__state~0)) (.cse4 (<= ssl3_accept_~s__state~0 8576)) (.cse5 (and (not (= ssl3_accept_~s__state~0 8672)) (not .cse11) (not (= ssl3_accept_~s__state~0 8593)) (not .cse1) (not (= ssl3_accept_~s__state~0 8673)) (not (= ssl3_accept_~s__state~0 8496)) (not (= ssl3_accept_~s__state~0 8497)) (not .cse8) (not .cse13) (and (not .cse7) (not .cse0) (not (= ssl3_accept_~s__state~0 8481)) (not (= ssl3_accept_~s__state~0 8528)) (not (= ssl3_accept_~s__state~0 8545)) (not (= ssl3_accept_~s__state~0 8480)) (not .cse12) (not .cse9) (not .cse6) (not (= ssl3_accept_~s__state~0 12292)) (not (= ssl3_accept_~s__state~0 8529)) (not .cse14) (not (= ssl3_accept_~s__state~0 8640)) (not (= ssl3_accept_~s__state~0 8641)) (not (= ssl3_accept_~s__state~0 8512)) (not (= ssl3_accept_~s__state~0 8609)) (not (= ssl3_accept_~s__state~0 8544)) (not (= ssl3_accept_~s__state~0 8608)) (not (= ssl3_accept_~s__state~0 8513)) (not .cse10)) (not (= ssl3_accept_~s__state~0 8592))))) (or .cse0 .cse1 (and .cse2 (and .cse3 (and .cse4 .cse5 (<= 6 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~blastFlag~0 7)))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse2 (and .cse3 (and .cse4 .cse5 (<= ssl3_accept_~blastFlag~0 2)))) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496)))) [2019-10-02 16:19:13,832 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 401) no Hoare annotation was computed. [2019-10-02 16:19:13,832 INFO L443 ceAbstractionStarter]: For program point ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION(line 624) no Hoare annotation was computed. [2019-10-02 16:19:13,832 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 563) no Hoare annotation was computed. [2019-10-02 16:19:13,833 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 574) no Hoare annotation was computed. [2019-10-02 16:19:13,833 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 585) no Hoare annotation was computed. [2019-10-02 16:19:13,833 INFO L439 ceAbstractionStarter]: At program point L99-2(lines 99 614) the Hoare annotation is: (let ((.cse8 (<= ssl3_accept_~s__state~0 3)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse23 (<= ssl3_accept_~s__state~0 8576)) (.cse24 (<= 8466 ssl3_accept_~s__state~0)) (.cse2 (<= 8640 ssl3_accept_~s__state~0)) (.cse11 (<= ssl3_accept_~s__state~0 8672)) (.cse14 (<= ssl3_accept_~blastFlag~0 7)) (.cse10 (<= 6 ssl3_accept_~blastFlag~0)) (.cse0 (<= ssl3_accept_~s__state~0 8640)) (.cse15 (not (= ssl3_accept_~s__state~0 8481))) (.cse17 (not (= ssl3_accept_~s__state~0 8529))) (.cse18 (not (= ssl3_accept_~s__state~0 8561))) (.cse12 (not (= ssl3_accept_~s__state~0 8641))) (.cse27 (not (= ssl3_accept_~s__state~0 8593))) (.cse19 (not (= ssl3_accept_~s__state~0 8545))) (.cse20 (not (= ssl3_accept_~s__state~0 8480))) (.cse13 (not (= ssl3_accept_~s__state~0 8657))) (.cse28 (not (= ssl3_accept_~s__state~0 8609))) (.cse21 (not (= ssl3_accept_~s__state~0 8513))) (.cse22 (not (= ssl3_accept_~s__state~0 8497))) (.cse1 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse5 (<= 8448 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~blastFlag~0 4)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse16 (<= ssl3_accept_~blastFlag~0 2)) (.cse25 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse26 (<= 8576 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse6 (<= ssl3_accept_~s__state~0 8448)) (.cse7 (= ssl3_accept_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse5 .cse6 .cse7) (and .cse8 .cse7 .cse4) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8561) (= 8560 |ssl3_accept_#in~initial_state|) (and .cse9 .cse10 .cse7 .cse11) (= 8609 |ssl3_accept_#in~initial_state|) (and .cse12 .cse7 .cse13 .cse2 .cse3 .cse4 .cse11) (and .cse9 .cse7 .cse4 .cse11) (and .cse1 .cse8 .cse3 .cse4) (and .cse14 .cse10 .cse8 .cse7) (and .cse9 .cse3 .cse11) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8673 |ssl3_accept_#in~initial_state|) (and (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse7 .cse21 .cse22 .cse23) .cse24) (= |ssl3_accept_#in~initial_state| 8672) (and .cse14 .cse10 .cse5 .cse25 .cse26 .cse6 .cse7) (= 8640 |ssl3_accept_#in~initial_state|) (and .cse15 .cse14 .cse10 .cse17 .cse18 .cse19 .cse20 .cse7 .cse21 .cse22 .cse23 .cse24) (= 8608 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8592) (and .cse14 .cse10 .cse12 .cse7 .cse13 .cse2 .cse11) (and .cse14 .cse10 .cse27 .cse7 .cse0 .cse28 (<= 8576 ssl3_accept_~s__state~0)) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (and .cse15 .cse16 .cse17 .cse18 (not (= ssl3_accept_~s__state~0 8448)) .cse12 (not (= ssl3_accept_~s__state~0 8544)) .cse27 (not (= ssl3_accept_~s__state~0 8528)) .cse19 .cse20 .cse13 (not (= ssl3_accept_~s__state~0 12292)) (not (= ssl3_accept_~s__state~0 8512)) .cse28 (not (= ssl3_accept_~s__state~0 8673)) (not (= ssl3_accept_~s__state~0 8560)) .cse21 .cse22) (and .cse1 .cse5 .cse6 .cse3 .cse4) (= |ssl3_accept_#in~initial_state| 8512) (and .cse16 .cse25 .cse26 .cse6 .cse7) (= 12292 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8545 |ssl3_accept_#in~initial_state|))) [2019-10-02 16:19:13,833 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 531) no Hoare annotation was computed. [2019-10-02 16:19:13,833 INFO L443 ceAbstractionStarter]: For program point L529-2(lines 208 558) no Hoare annotation was computed. [2019-10-02 16:19:13,834 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 235) no Hoare annotation was computed. [2019-10-02 16:19:13,834 INFO L439 ceAbstractionStarter]: At program point L166(lines 165 574) the Hoare annotation is: (let ((.cse0 (<= 8448 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse4 (<= 8576 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse1 (<= ssl3_accept_~s__state~0 8448)) (.cse2 (= ssl3_accept_~s__hit~0 0))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 .cse2) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (and (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 .cse1 (<= ssl3_accept_~blastFlag~0 4) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (and (<= ssl3_accept_~blastFlag~0 7) (<= 6 ssl3_accept_~blastFlag~0) .cse0 .cse3 .cse4 .cse1 .cse2) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse3 .cse4 .cse1 .cse2) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496))) [2019-10-02 16:19:13,834 INFO L439 ceAbstractionStarter]: At program point L133(lines 126 587) the Hoare annotation is: (let ((.cse1 (not (= ssl3_accept_~s__state~0 8481))) (.cse2 (not (= ssl3_accept_~s__state~0 8529))) (.cse3 (not (= ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ssl3_accept_~s__state~0 8480))) (.cse10 (not (= ssl3_accept_~s__state~0 8512))) (.cse11 (not (= ssl3_accept_~s__state~0 8560))) (.cse12 (not (= ssl3_accept_~s__state~0 8513))) (.cse13 (not (= ssl3_accept_~s__state~0 8497))) (.cse14 (<= ssl3_accept_~s__state~0 8576)) (.cse0 (<= 8448 ssl3_accept_~s__state~0))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8593) (= |ssl3_accept_#in~initial_state| 8529) (= |ssl3_accept_#in~initial_state| 8641) (= 8497 |ssl3_accept_#in~initial_state|) (= 8513 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8528) (= 8673 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= 8640 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8512) (= |ssl3_accept_#in~initial_state| 8592) (= 8560 |ssl3_accept_#in~initial_state|) (= 12292 |ssl3_accept_#in~initial_state|) (and .cse0 (and .cse1 (<= ssl3_accept_~blastFlag~0 7) (<= 6 ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ssl3_accept_~s__hit~0 0) .cse10 .cse11 .cse12 .cse13 .cse14)) (= 8608 |ssl3_accept_#in~initial_state|) (= 8448 |ssl3_accept_#in~initial_state|) (= 8609 |ssl3_accept_#in~initial_state|) (and (and .cse1 (<= ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse0) (= |ssl3_accept_#in~initial_state| 8656) (= 8545 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8481) (= 8657 |ssl3_accept_#in~initial_state|) (= |ssl3_accept_#in~initial_state| 8496))) [2019-10-02 16:19:13,834 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-02 16:19:13,834 INFO L443 ceAbstractionStarter]: For program point L596(lines 596 612) no Hoare annotation was computed. [2019-10-02 16:19:13,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 04:19:13 BoogieIcfgContainer [2019-10-02 16:19:13,894 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 16:19:13,896 INFO L168 Benchmark]: Toolchain (without parser) took 78257.02 ms. Allocated memory was 133.7 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 89.5 MB in the beginning and 125.0 MB in the end (delta: -35.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-10-02 16:19:13,897 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 16:19:13,897 INFO L168 Benchmark]: CACSL2BoogieTranslator took 526.52 ms. Allocated memory was 133.7 MB in the beginning and 201.3 MB in the end (delta: 67.6 MB). Free memory was 89.3 MB in the beginning and 174.4 MB in the end (delta: -85.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2019-10-02 16:19:13,898 INFO L168 Benchmark]: Boogie Preprocessor took 54.02 ms. Allocated memory is still 201.3 MB. Free memory was 174.4 MB in the beginning and 171.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-10-02 16:19:13,898 INFO L168 Benchmark]: RCFGBuilder took 822.52 ms. Allocated memory is still 201.3 MB. Free memory was 171.2 MB in the beginning and 119.9 MB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB. [2019-10-02 16:19:13,899 INFO L168 Benchmark]: TraceAbstraction took 76849.53 ms. Allocated memory was 201.3 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 119.3 MB in the beginning and 125.0 MB in the end (delta: -5.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-10-02 16:19:13,902 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 526.52 ms. Allocated memory was 133.7 MB in the beginning and 201.3 MB in the end (delta: 67.6 MB). Free memory was 89.3 MB in the beginning and 174.4 MB in the end (delta: -85.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.02 ms. Allocated memory is still 201.3 MB. Free memory was 174.4 MB in the beginning and 171.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 822.52 ms. Allocated memory is still 201.3 MB. Free memory was 171.2 MB in the beginning and 119.9 MB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 76849.53 ms. Allocated memory was 201.3 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 119.3 MB in the beginning and 125.0 MB in the end (delta: -5.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 624]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || ((((((((((((((!(s__state == 8481) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) && s__hit == 0) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || (((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) && s__hit == 0) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496 - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || ((((((((((((((!(s__state == 8481) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) && s__hit == 0) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || (((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) && s__hit == 0) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || (((((blastFlag <= 2 && !(s__state == 8593)) && s__state <= 8640) && !(s__state == 8640)) && 8576 <= s__state) && !(s__state == 8592))) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || (((((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8593)) && s__hit == 0) && s__state <= 8640) && !(s__state == 8640)) && 8576 <= s__state) && !(s__state == 8592))) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((s__state <= 8640 && 8640 <= s__s3__tmp__next_state___0) && 8640 <= s__state) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) || (((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || (((s__s3__tmp__next_state___0 <= 3 && 8448 <= s__state) && s__state <= 8448) && s__hit == 0)) || ((s__state <= 3 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8640)) || 8513 == \old(initial_state)) || \old(initial_state) == 8544) || ((((blastFlag <= 2 && !(s__state == 8593)) && s__state <= 8640) && !(s__state == 8609)) && 8576 <= s__state)) || \old(initial_state) == 8561) || ((((((((((((((((((((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(8560 == \old(initial_state))) && !(8513 == \old(initial_state))) && !(s__state == 8529)) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8656)) && !(s__state == 8561)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8544)) && !(8609 == \old(initial_state))) && !(8657 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(s__state == 8528)) && !(s__state == 8496)) && !(8608 == \old(initial_state))) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8529)) && !(\old(initial_state) == 8481)) && !(8640 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && s__state <= 3)) || 8560 == \old(initial_state)) || (((8672 <= s__state && 6 <= blastFlag) && s__hit == 0) && s__state <= 8672)) || 8609 == \old(initial_state)) || ((((((!(s__state == 8641) && s__hit == 0) && !(s__state == 8657)) && 8640 <= s__state) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8672)) || (((8672 <= s__state && s__hit == 0) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8672)) || (((8640 <= s__s3__tmp__next_state___0 && s__state <= 3) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || (((blastFlag <= 7 && 6 <= blastFlag) && s__state <= 3) && s__hit == 0)) || ((8672 <= s__state && blastFlag <= 4) && s__state <= 8672)) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || ((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8480)) && s__hit == 0) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || \old(initial_state) == 8672) || ((((((blastFlag <= 7 && 6 <= blastFlag) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && s__state <= 8448) && s__hit == 0)) || 8640 == \old(initial_state)) || (((((((((((!(s__state == 8481) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8480)) && s__hit == 0) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || 8608 == \old(initial_state)) || \old(initial_state) == 8656) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || ((((blastFlag <= 2 && !(s__state == 8641)) && !(s__state == 8657)) && 8640 <= s__state) && s__state <= 8672)) || \old(initial_state) == 8592) || ((((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8641)) && s__hit == 0) && !(s__state == 8657)) && 8640 <= s__state) && s__state <= 8672)) || ((((((((((((((((((((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(8560 == \old(initial_state))) && !(8513 == \old(initial_state))) && !(s__state == 8529)) && !(\old(initial_state) == 8592)) && !(\old(initial_state) == 8656)) && !(s__state == 8561)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8544)) && !(8609 == \old(initial_state))) && !(8657 == \old(initial_state))) && !(\old(initial_state) == 8641)) && !(s__state == 8528)) && !(s__state == 8496)) && !(8608 == \old(initial_state))) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8529)) && !(\old(initial_state) == 8481)) && !(8640 == \old(initial_state))) && !(8673 == \old(initial_state))) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && 8448 <= s__state)) || ((((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8593)) && s__hit == 0) && s__state <= 8640) && !(s__state == 8609)) && 8576 <= s__state)) || \old(initial_state) == 8496) || \old(initial_state) == 8480) || \old(initial_state) == 8593) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__state <= 8448) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || \old(initial_state) == 8512) || (((((blastFlag <= 2 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && s__state <= 8448) && s__hit == 0)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8545 == \old(initial_state) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || (8448 <= s__state && (((((((((((((((!(s__state == 8481) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && s__hit == 0) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || (((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8448 <= s__state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || (((s__s3__tmp__next_state___0 <= 3 && 8448 <= s__state) && s__state <= 8448) && s__hit == 0)) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__state <= 8448) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || ((((((blastFlag <= 7 && 6 <= blastFlag) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && s__state <= 8448) && s__hit == 0)) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || (((((blastFlag <= 2 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && s__state <= 8448) && s__hit == 0)) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || (((((((((((((((!(s__state == 8481) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && s__hit == 0) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8513)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || (8466 <= s__state && ((((((((((((((!(s__state == 8481) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && s__hit == 0) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576)) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || ((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state) - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(initial_state) == 8480 || (s__hit == 0 && (((blastFlag <= 2 && 8544 <= s__state) && !(s__state == 8561)) && !(s__state == 8560)) && s__state <= 8576)) || ((((((blastFlag <= 7 && 8544 <= s__state) && 6 <= blastFlag) && !(s__state == 8561)) && !(s__state == 8560)) && s__state <= 8576) && s__hit == 0)) || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(initial_state) == 8480 || (s__hit == 0 && (((blastFlag <= 2 && 8544 <= s__state) && !(s__state == 8561)) && !(s__state == 8560)) && s__state <= 8576)) || ((((((blastFlag <= 7 && 8544 <= s__state) && 6 <= blastFlag) && !(s__state == 8561)) && !(s__state == 8560)) && s__state <= 8576) && s__hit == 0)) || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || ((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state)) || ((s__hit == 0 && (blastFlag <= 7 && 6 <= blastFlag) && s__state <= 8640) && 8640 <= s__state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || (8640 <= s__state && ((s__hit == 0 && s__state <= 8640) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || ((((s__state <= 8640 && 8640 <= s__s3__tmp__next_state___0) && 8640 <= s__state) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || ((s__hit == 0 && ((((((!(\old(initial_state) == 8592) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(\old(initial_state) == 8672)) && ((((((((((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(s__state == 8528)) && !(8497 == \old(initial_state))) && !(8608 == \old(initial_state))) && !(s__state == 8545)) && !(\old(initial_state) == 8512)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(\old(initial_state) == 8481)) && !(s__state == 8529)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8561)) && !(\old(initial_state) == 8561)) && !(s__state == 8512)) && !(8448 == \old(initial_state))) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8513)) && !(8609 == \old(initial_state))) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8528)) && !(8545 == \old(initial_state))) && s__state <= 8576) && 6 <= blastFlag) && blastFlag <= 7) && 8466 <= s__state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || (((((((!(\old(initial_state) == 8592) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(\old(initial_state) == 8672)) && ((((((((((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(s__state == 8528)) && !(8497 == \old(initial_state))) && !(8608 == \old(initial_state))) && !(s__state == 8545)) && !(\old(initial_state) == 8512)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(\old(initial_state) == 8481)) && !(s__state == 8529)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8561)) && !(\old(initial_state) == 8561)) && !(s__state == 8512)) && !(8448 == \old(initial_state))) && !(s__state == 8544)) && !(s__state == 8560)) && !(s__state == 8513)) && !(8609 == \old(initial_state))) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8528)) && !(8545 == \old(initial_state))) && s__state <= 8576) && blastFlag <= 2) && 8466 <= s__state) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((s__state <= 8640 && 8640 <= s__s3__tmp__next_state___0) && 8640 <= s__state) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) || (((s__s3__tmp__next_state___0 <= 3 && 8448 <= s__state) && s__state <= 8448) && s__hit == 0)) || ((s__state <= 3 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8640)) || 8513 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8561) || 8560 == \old(initial_state)) || (((8672 <= s__state && 6 <= blastFlag) && s__hit == 0) && s__state <= 8672)) || 8609 == \old(initial_state)) || ((((((!(s__state == 8641) && s__hit == 0) && !(s__state == 8657)) && 8640 <= s__state) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8672)) || (((8672 <= s__state && s__hit == 0) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8672)) || (((8640 <= s__s3__tmp__next_state___0 && s__state <= 3) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || (((blastFlag <= 7 && 6 <= blastFlag) && s__state <= 3) && s__hit == 0)) || ((8672 <= s__state && blastFlag <= 4) && s__state <= 8672)) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || ((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8480)) && s__hit == 0) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || \old(initial_state) == 8672) || ((((((blastFlag <= 7 && 6 <= blastFlag) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && s__state <= 8448) && s__hit == 0)) || 8640 == \old(initial_state)) || (((((((((((!(s__state == 8481) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8480)) && s__hit == 0) && !(s__state == 8513)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || 8608 == \old(initial_state)) || \old(initial_state) == 8656) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8592) || ((((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8641)) && s__hit == 0) && !(s__state == 8657)) && 8640 <= s__state) && s__state <= 8672)) || ((((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8593)) && s__hit == 0) && s__state <= 8640) && !(s__state == 8609)) && 8576 <= s__state)) || \old(initial_state) == 8496) || \old(initial_state) == 8480) || \old(initial_state) == 8593) || ((((((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8641)) && !(s__state == 8544)) && !(s__state == 8593)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 12292)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8673)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497))) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__state <= 8448) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || \old(initial_state) == 8512) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && s__state <= 8448) && s__hit == 0)) || 12292 == \old(initial_state)) || 8448 == \old(initial_state)) || 8545 == \old(initial_state) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || ((s__state <= 8640 && ((((blastFlag <= 2 && !(s__state == 8608)) && !(s__state == 8593)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8592)) && 8576 <= s__state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || (((s__state <= 8640 && (((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8608)) && !(s__state == 8593)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8592)) && s__hit == 0) && 8576 <= s__state)) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || !(s__state == 8544)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496 - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || (s__hit == 0 && 8544 <= s__state && ((s__state <= 8576 && (((((((((!(s__state == 8672) && !(8673 == \old(initial_state))) && !(s__state == 8593)) && !(\old(initial_state) == 8593)) && !(s__state == 8673)) && !(s__state == 8496)) && !(s__state == 8497)) && !(8497 == \old(initial_state))) && !(\old(initial_state) == 8672)) && ((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8481)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(s__state == 8529)) && !(8640 == \old(initial_state))) && !(s__state == 8640)) && !(s__state == 8641)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8513)) && !(\old(initial_state) == 8528)) && !(s__state == 8592)) && 6 <= blastFlag) && blastFlag <= 7)) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || (s__hit == 0 && 8544 <= s__state && (s__state <= 8576 && (((((((((!(s__state == 8672) && !(8673 == \old(initial_state))) && !(s__state == 8593)) && !(\old(initial_state) == 8593)) && !(s__state == 8673)) && !(s__state == 8496)) && !(s__state == 8497)) && !(8497 == \old(initial_state))) && !(\old(initial_state) == 8672)) && ((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8481)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(s__state == 8529)) && !(8640 == \old(initial_state))) && !(s__state == 8640)) && !(s__state == 8641)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8513)) && !(\old(initial_state) == 8528)) && !(s__state == 8592)) && blastFlag <= 2)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8512) || \old(initial_state) == 8593) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || 8640 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || ((s__hit == 0 && ((((blastFlag <= 7 && !(s__state == 8640)) && !(s__state == 8672)) && !(s__state == 8641)) && 6 <= blastFlag) && s__state <= 8672) && 8640 <= s__state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || (((((((!(s__state == 8640) && !(s__state == 8672)) && !(s__state == 8641)) && s__hit == 0) && s__state <= 8672) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state)) || \old(initial_state) == 8481) || (((((blastFlag <= 2 && !(s__state == 8640)) && !(s__state == 8672)) && !(s__state == 8641)) && s__state <= 8672) && 8640 <= s__state)) || 8657 == \old(initial_state)) || \old(initial_state) == 8496 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || !(s__state == 8544)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8512) || \old(initial_state) == 8593) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || 8640 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || (((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && s__hit == 0) && !(s__state == 8560)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || \old(initial_state) == 8656) || ((((((((((((((!(s__state == 8481) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8529)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && s__hit == 0) && !(s__state == 8560)) && !(s__state == 8497)) && s__state <= 8576) && 8466 <= s__state)) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8512) || \old(initial_state) == 8593) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || 8640 == \old(initial_state)) || \old(initial_state) == 8496) || \old(initial_state) == 8561 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || (((blastFlag <= 2 && (((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(8497 == \old(initial_state))) && !(\old(initial_state) == 8544)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(8640 == \old(initial_state))) && !(s__state == 8640)) && !(s__state == 8672)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__state == 8608)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && s__state <= 8640) && 8576 <= s__state)) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || ((s__hit == 0 && s__state <= 8640 && (((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(8497 == \old(initial_state))) && !(\old(initial_state) == 8544)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(8640 == \old(initial_state))) && !(s__state == 8640)) && !(s__state == 8672)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__state == 8608)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && 6 <= blastFlag) && blastFlag <= 7) && 8576 <= s__state)) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || ((((((((((((((((((((((((!(s__state == 8481) && blastFlag <= 2) && !(s__state == 8529)) && !(s__state == 8672)) && !(s__state == 8561)) && !(s__state == 8448)) && !(s__state == 8641)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8656)) && !(s__state == 8593)) && !(s__state == 8528)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8480)) && !(s__state == 8657)) && !(s__state == 12292)) && !(s__state == 8640)) && !(s__state == 8512)) && !(s__state == 8609)) && !(s__state == 8673)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(s__state == 8592))) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496 - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(initial_state) == 8480 || (s__hit == 0 && (((blastFlag <= 2 && 8544 <= s__state) && !(s__state == 8561)) && !(s__state == 8560)) && s__state <= 8576)) || ((((((blastFlag <= 7 && 8544 <= s__state) && 6 <= blastFlag) && !(s__state == 8561)) && !(s__state == 8560)) && s__state <= 8576) && s__hit == 0)) || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8593) || \old(initial_state) == 8529) || \old(initial_state) == 8641) || 8497 == \old(initial_state)) || 8513 == \old(initial_state)) || \old(initial_state) == 8528) || 8673 == \old(initial_state)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || 8640 == \old(initial_state)) || \old(initial_state) == 8561) || \old(initial_state) == 8512) || ((((((((((((((((((((((((((((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8593)) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(s__state == 8528)) && !(s__state == 8496)) && !(8608 == \old(initial_state))) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(\old(initial_state) == 8512)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(\old(initial_state) == 8481)) && !(s__state == 8529)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8640)) && !(\old(initial_state) == 8592)) && !(s__state == 8561)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(s__state == 8512)) && !(8448 == \old(initial_state))) && !(s__state == 8609)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(8609 == \old(initial_state))) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(8545 == \old(initial_state))) && !(s__state == 8592)) && 6 <= blastFlag) && 8672 <= s__state) && s__hit == 0)) || \old(initial_state) == 8592) || 8560 == \old(initial_state)) || 12292 == \old(initial_state)) || ((8672 <= s__state && (((((((((((((((((((((((((((((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8593)) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(s__state == 8528)) && !(s__state == 8496)) && !(8608 == \old(initial_state))) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(\old(initial_state) == 8512)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(\old(initial_state) == 8481)) && !(s__state == 8529)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8640)) && !(\old(initial_state) == 8592)) && !(s__state == 8561)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(s__state == 8512)) && !(8448 == \old(initial_state))) && !(s__state == 8609)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(8609 == \old(initial_state))) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(8545 == \old(initial_state))) && !(s__state == 8592)) && !(\old(initial_state) == 8656)) && blastFlag <= 6) && !(s__state == 8656)) && !(8657 == \old(initial_state))) && !(s__state == 8657)) && blastFlag <= 4)) || 8608 == \old(initial_state)) || 8448 == \old(initial_state)) || 8609 == \old(initial_state)) || \old(initial_state) == 8656) || 8545 == \old(initial_state)) || \old(initial_state) == 8481) || 8657 == \old(initial_state)) || \old(initial_state) == 8496) || ((s__hit == 0 && 8672 <= s__state && (((((((((((((((((((((((((((((((((((((((((((((!(\old(initial_state) == 8641) && !(\old(initial_state) == 8480)) && !(s__state == 8593)) && !(s__state == 8481)) && !(8560 == \old(initial_state))) && !(s__state == 8528)) && !(s__state == 8496)) && !(8608 == \old(initial_state))) && !(8497 == \old(initial_state))) && !(s__state == 8545)) && !(\old(initial_state) == 8512)) && !(s__state == 8480)) && !(\old(initial_state) == 8544)) && !(8513 == \old(initial_state))) && !(\old(initial_state) == 8529)) && !(s__state == 12292)) && !(\old(initial_state) == 8481)) && !(s__state == 8529)) && !(8640 == \old(initial_state))) && !(12292 == \old(initial_state))) && !(s__state == 8640)) && !(\old(initial_state) == 8592)) && !(s__state == 8561)) && !(8673 == \old(initial_state))) && !(\old(initial_state) == 8593)) && !(s__state == 8448)) && !(\old(initial_state) == 8561)) && !(s__state == 8641)) && !(s__state == 8512)) && !(8448 == \old(initial_state))) && !(s__state == 8609)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8560)) && !(s__state == 8513)) && !(s__state == 8497)) && !(8609 == \old(initial_state))) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8528)) && !(\old(initial_state) == 8672)) && !(8545 == \old(initial_state))) && !(s__state == 8592)) && !(\old(initial_state) == 8656)) && blastFlag <= 6) && !(s__state == 8656)) && !(8657 == \old(initial_state))) && !(s__state == 8657)) && s__s3__tmp__next_state___0 <= 8640) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 1 error locations. SAFE Result, 76.7s OverallTime, 42 OverallIterations, 14 TraceHistogramMax, 12.6s AutomataDifference, 0.0s DeadEndRemovalTime, 54.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 8305 SDtfs, 12723 SDslu, 8304 SDs, 0 SdLazy, 6859 SolverSat, 1550 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1825 GetRequests, 1691 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4559occurred in iteration=39, 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: 3.6s AutomataMinimizationTime, 42 MinimizatonAttempts, 10895 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 32 PreInvPairs, 261 NumberOfFragments, 5442 HoareAnnotationTreeSize, 32 FomulaSimplifications, 1925681 FormulaSimplificationTreeSizeReduction, 5.6s HoareSimplificationTime, 32 FomulaSimplificationsInter, 806728 FormulaSimplificationTreeSizeReductionInter, 49.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 8523 NumberOfCodeBlocks, 8523 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 8476 ConstructedInterpolants, 0 QuantifiedInterpolants, 2910697 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2937 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 47 InterpolantComputations, 40 PerfectInterpolantSequences, 21019/21183 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...