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_clnt_2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 16:15:33,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 16:15:33,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 16:15:33,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 16:15:33,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 16:15:33,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 16:15:33,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 16:15:33,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 16:15:33,624 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 16:15:33,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 16:15:33,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 16:15:33,627 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 16:15:33,627 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 16:15:33,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 16:15:33,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 16:15:33,630 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 16:15:33,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 16:15:33,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 16:15:33,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 16:15:33,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 16:15:33,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 16:15:33,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 16:15:33,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 16:15:33,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 16:15:33,641 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 16:15:33,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 16:15:33,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 16:15:33,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 16:15:33,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 16:15:33,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 16:15:33,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 16:15:33,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 16:15:33,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 16:15:33,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 16:15:33,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 16:15:33,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 16:15:33,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 16:15:33,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 16:15:33,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 16:15:33,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 16:15:33,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 16:15:33,650 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:15:33,664 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 16:15:33,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 16:15:33,665 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 16:15:33,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 16:15:33,666 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 16:15:33,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 16:15:33,666 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 16:15:33,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 16:15:33,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 16:15:33,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 16:15:33,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 16:15:33,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 16:15:33,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 16:15:33,667 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 16:15:33,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 16:15:33,668 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 16:15:33,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 16:15:33,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 16:15:33,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 16:15:33,669 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 16:15:33,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 16:15:33,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 16:15:33,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 16:15:33,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 16:15:33,670 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 16:15:33,670 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 16:15:33,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 16:15:33,670 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 16:15:33,670 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 16:15:33,702 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 16:15:33,713 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 16:15:33,717 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 16:15:33,718 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 16:15:33,718 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 16:15:33,719 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_2.cil-2.c [2019-10-02 16:15:33,777 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfd59af39/7f6563cb625b4659ad12d7c939a9b5ff/FLAGd4ef2c928 [2019-10-02 16:15:34,248 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 16:15:34,249 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_2.cil-2.c [2019-10-02 16:15:34,263 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfd59af39/7f6563cb625b4659ad12d7c939a9b5ff/FLAGd4ef2c928 [2019-10-02 16:15:34,617 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfd59af39/7f6563cb625b4659ad12d7c939a9b5ff [2019-10-02 16:15:34,629 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 16:15:34,631 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 16:15:34,632 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 16:15:34,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 16:15:34,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 16:15:34,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:15:34" (1/1) ... [2019-10-02 16:15:34,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ea86b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:34, skipping insertion in model container [2019-10-02 16:15:34,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:15:34" (1/1) ... [2019-10-02 16:15:34,647 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 16:15:34,702 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 16:15:35,102 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 16:15:35,109 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 16:15:35,170 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 16:15:35,184 INFO L192 MainTranslator]: Completed translation [2019-10-02 16:15:35,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:35 WrapperNode [2019-10-02 16:15:35,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 16:15:35,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 16:15:35,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 16:15:35,186 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 16:15:35,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:35" (1/1) ... [2019-10-02 16:15:35,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:35" (1/1) ... [2019-10-02 16:15:35,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:35" (1/1) ... [2019-10-02 16:15:35,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:35" (1/1) ... [2019-10-02 16:15:35,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:35" (1/1) ... [2019-10-02 16:15:35,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:35" (1/1) ... [2019-10-02 16:15:35,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:35" (1/1) ... [2019-10-02 16:15:35,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 16:15:35,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 16:15:35,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 16:15:35,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 16:15:35,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:35" (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:15:35,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 16:15:35,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 16:15:35,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-02 16:15:35,301 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 16:15:35,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 16:15:35,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 16:15:35,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 16:15:35,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-02 16:15:35,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 16:15:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-02 16:15:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 16:15:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 16:15:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 16:15:35,518 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 16:15:35,951 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-02 16:15:35,951 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-02 16:15:35,970 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 16:15:35,970 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 16:15:35,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:15:35 BoogieIcfgContainer [2019-10-02 16:15:35,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 16:15:35,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 16:15:35,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 16:15:35,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 16:15:35,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 04:15:34" (1/3) ... [2019-10-02 16:15:35,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331534aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:15:35, skipping insertion in model container [2019-10-02 16:15:35,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:35" (2/3) ... [2019-10-02 16:15:35,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331534aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:15:35, skipping insertion in model container [2019-10-02 16:15:35,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:15:35" (3/3) ... [2019-10-02 16:15:35,983 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil-2.c [2019-10-02 16:15:35,993 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 16:15:36,001 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 16:15:36,019 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 16:15:36,060 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 16:15:36,061 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 16:15:36,061 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 16:15:36,061 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 16:15:36,062 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 16:15:36,062 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 16:15:36,062 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 16:15:36,063 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 16:15:36,063 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 16:15:36,090 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2019-10-02 16:15:36,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 16:15:36,101 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:36,102 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] [2019-10-02 16:15:36,105 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:36,111 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2019-10-02 16:15:36,113 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:36,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:36,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:36,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:36,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:36,369 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:15:36,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:36,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:36,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:36,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:36,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:36,390 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2019-10-02 16:15:36,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:36,510 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2019-10-02 16:15:36,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:36,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-02 16:15:36,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:36,527 INFO L225 Difference]: With dead ends: 377 [2019-10-02 16:15:36,527 INFO L226 Difference]: Without dead ends: 220 [2019-10-02 16:15:36,532 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:15:36,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-02 16:15:36,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-10-02 16:15:36,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-02 16:15:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2019-10-02 16:15:36,594 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2019-10-02 16:15:36,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:36,595 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2019-10-02 16:15:36,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2019-10-02 16:15:36,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-02 16:15:36,598 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:36,599 INFO L411 BasicCegarLoop]: trace histogram [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:15:36,599 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:36,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:36,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1426924635, now seen corresponding path program 1 times [2019-10-02 16:15:36,600 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:36,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:36,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:36,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:36,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:36,679 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:15:36,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:36,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:36,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:36,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:36,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:36,682 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2019-10-02 16:15:36,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:36,894 INFO L93 Difference]: Finished difference Result 470 states and 707 transitions. [2019-10-02 16:15:36,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:36,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-02 16:15:36,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:36,898 INFO L225 Difference]: With dead ends: 470 [2019-10-02 16:15:36,898 INFO L226 Difference]: Without dead ends: 262 [2019-10-02 16:15:36,900 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:15:36,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-02 16:15:36,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2019-10-02 16:15:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-10-02 16:15:36,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2019-10-02 16:15:36,919 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2019-10-02 16:15:36,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:36,920 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2019-10-02 16:15:36,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:36,920 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2019-10-02 16:15:36,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 16:15:36,923 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:36,924 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 16:15:36,924 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:36,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:36,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1669760968, now seen corresponding path program 1 times [2019-10-02 16:15:36,924 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:36,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:36,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:36,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:36,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:37,038 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 16:15:37,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:37,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:37,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:37,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:37,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:37,041 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2019-10-02 16:15:37,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:37,257 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2019-10-02 16:15:37,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:37,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-02 16:15:37,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:37,260 INFO L225 Difference]: With dead ends: 598 [2019-10-02 16:15:37,260 INFO L226 Difference]: Without dead ends: 354 [2019-10-02 16:15:37,262 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:15:37,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-02 16:15:37,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2019-10-02 16:15:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-02 16:15:37,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2019-10-02 16:15:37,281 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2019-10-02 16:15:37,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:37,282 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2019-10-02 16:15:37,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2019-10-02 16:15:37,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 16:15:37,286 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:37,286 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 16:15:37,286 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:37,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:37,287 INFO L82 PathProgramCache]: Analyzing trace with hash 819767994, now seen corresponding path program 1 times [2019-10-02 16:15:37,287 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:37,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:37,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:37,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:37,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:37,370 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 16:15:37,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:37,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:37,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:37,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:37,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:37,371 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2019-10-02 16:15:37,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:37,507 INFO L93 Difference]: Finished difference Result 708 states and 1005 transitions. [2019-10-02 16:15:37,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:37,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-02 16:15:37,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:37,510 INFO L225 Difference]: With dead ends: 708 [2019-10-02 16:15:37,510 INFO L226 Difference]: Without dead ends: 384 [2019-10-02 16:15:37,512 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:15:37,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-10-02 16:15:37,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2019-10-02 16:15:37,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-10-02 16:15:37,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2019-10-02 16:15:37,528 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2019-10-02 16:15:37,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:37,528 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2019-10-02 16:15:37,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:37,528 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2019-10-02 16:15:37,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-02 16:15:37,532 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:37,533 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 16:15:37,533 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:37,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:37,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1719879938, now seen corresponding path program 1 times [2019-10-02 16:15:37,534 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:37,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:37,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:37,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:37,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:37,598 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 16:15:37,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:37,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:37,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:37,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:37,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:37,600 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2019-10-02 16:15:37,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:37,803 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2019-10-02 16:15:37,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:37,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-02 16:15:37,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:37,807 INFO L225 Difference]: With dead ends: 842 [2019-10-02 16:15:37,807 INFO L226 Difference]: Without dead ends: 478 [2019-10-02 16:15:37,808 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:15:37,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-10-02 16:15:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2019-10-02 16:15:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-02 16:15:37,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2019-10-02 16:15:37,825 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2019-10-02 16:15:37,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:37,826 INFO L475 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2019-10-02 16:15:37,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:37,826 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2019-10-02 16:15:37,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 16:15:37,829 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:37,829 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 16:15:37,829 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:37,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:37,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1093696729, now seen corresponding path program 1 times [2019-10-02 16:15:37,830 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:37,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:37,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:37,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:37,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:37,907 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 16:15:37,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:37,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:37,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:37,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:37,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:37,910 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2019-10-02 16:15:38,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:38,043 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2019-10-02 16:15:38,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:38,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-02 16:15:38,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:38,047 INFO L225 Difference]: With dead ends: 940 [2019-10-02 16:15:38,047 INFO L226 Difference]: Without dead ends: 500 [2019-10-02 16:15:38,049 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:15:38,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-10-02 16:15:38,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2019-10-02 16:15:38,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-10-02 16:15:38,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2019-10-02 16:15:38,065 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2019-10-02 16:15:38,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:38,065 INFO L475 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2019-10-02 16:15:38,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:38,066 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2019-10-02 16:15:38,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 16:15:38,067 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:38,068 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2019-10-02 16:15:38,068 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:38,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:38,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1180839903, now seen corresponding path program 1 times [2019-10-02 16:15:38,069 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:38,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:38,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:38,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:38,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 16:15:38,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:38,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:38,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:38,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:38,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:38,150 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2019-10-02 16:15:38,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:38,190 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2019-10-02 16:15:38,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:38,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-02 16:15:38,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:38,195 INFO L225 Difference]: With dead ends: 976 [2019-10-02 16:15:38,195 INFO L226 Difference]: Without dead ends: 734 [2019-10-02 16:15:38,196 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:15:38,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-10-02 16:15:38,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2019-10-02 16:15:38,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2019-10-02 16:15:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2019-10-02 16:15:38,220 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2019-10-02 16:15:38,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:38,220 INFO L475 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2019-10-02 16:15:38,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:38,221 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2019-10-02 16:15:38,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 16:15:38,223 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:38,223 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2019-10-02 16:15:38,224 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:38,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:38,224 INFO L82 PathProgramCache]: Analyzing trace with hash 866854985, now seen corresponding path program 1 times [2019-10-02 16:15:38,224 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:38,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:38,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:38,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:38,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-02 16:15:38,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:38,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:38,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:38,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:38,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:38,302 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2019-10-02 16:15:38,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:38,343 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2019-10-02 16:15:38,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:38,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-02 16:15:38,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:38,350 INFO L225 Difference]: With dead ends: 976 [2019-10-02 16:15:38,350 INFO L226 Difference]: Without dead ends: 974 [2019-10-02 16:15:38,351 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:15:38,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-10-02 16:15:38,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2019-10-02 16:15:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-10-02 16:15:38,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2019-10-02 16:15:38,381 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2019-10-02 16:15:38,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:38,381 INFO L475 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2019-10-02 16:15:38,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:38,382 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2019-10-02 16:15:38,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 16:15:38,387 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:38,387 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 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] [2019-10-02 16:15:38,388 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:38,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:38,388 INFO L82 PathProgramCache]: Analyzing trace with hash -394036509, now seen corresponding path program 1 times [2019-10-02 16:15:38,388 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:38,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:38,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:38,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:38,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:38,473 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-10-02 16:15:38,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:38,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:38,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:38,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:38,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:38,475 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2019-10-02 16:15:38,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:38,642 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2019-10-02 16:15:38,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:38,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-02 16:15:38,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:38,650 INFO L225 Difference]: With dead ends: 2140 [2019-10-02 16:15:38,650 INFO L226 Difference]: Without dead ends: 1170 [2019-10-02 16:15:38,653 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:15:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-10-02 16:15:38,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2019-10-02 16:15:38,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-10-02 16:15:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2019-10-02 16:15:38,690 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 168 [2019-10-02 16:15:38,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:38,690 INFO L475 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2019-10-02 16:15:38,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:38,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2019-10-02 16:15:38,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-02 16:15:38,696 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:38,697 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2019-10-02 16:15:38,697 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:38,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:38,697 INFO L82 PathProgramCache]: Analyzing trace with hash 531653490, now seen corresponding path program 1 times [2019-10-02 16:15:38,698 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:38,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:38,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:38,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:38,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-10-02 16:15:38,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:38,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:38,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:38,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:38,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:38,771 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2019-10-02 16:15:38,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:38,912 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2019-10-02 16:15:38,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:38,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-10-02 16:15:38,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:38,922 INFO L225 Difference]: With dead ends: 2354 [2019-10-02 16:15:38,922 INFO L226 Difference]: Without dead ends: 1236 [2019-10-02 16:15:38,925 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:15:38,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2019-10-02 16:15:38,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2019-10-02 16:15:38,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-10-02 16:15:38,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2019-10-02 16:15:38,975 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 204 [2019-10-02 16:15:38,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:38,976 INFO L475 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2019-10-02 16:15:38,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:38,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2019-10-02 16:15:38,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-02 16:15:38,987 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:38,988 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 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] [2019-10-02 16:15:38,988 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:38,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:38,988 INFO L82 PathProgramCache]: Analyzing trace with hash -354539531, now seen corresponding path program 1 times [2019-10-02 16:15:38,988 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:38,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:38,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:38,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:38,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-10-02 16:15:39,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:39,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:39,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:39,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:39,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:39,116 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2019-10-02 16:15:39,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:39,296 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2019-10-02 16:15:39,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:39,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-10-02 16:15:39,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:39,304 INFO L225 Difference]: With dead ends: 2544 [2019-10-02 16:15:39,304 INFO L226 Difference]: Without dead ends: 1334 [2019-10-02 16:15:39,307 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:15:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-10-02 16:15:39,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2019-10-02 16:15:39,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-10-02 16:15:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2019-10-02 16:15:39,346 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 225 [2019-10-02 16:15:39,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:39,347 INFO L475 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2019-10-02 16:15:39,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:39,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2019-10-02 16:15:39,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-02 16:15:39,352 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:39,352 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:39,353 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:39,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:39,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1874601560, now seen corresponding path program 1 times [2019-10-02 16:15:39,353 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:39,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:39,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:39,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:39,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:39,512 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-02 16:15:39,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:39,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:39,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:39,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:39,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:39,513 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2019-10-02 16:15:39,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:39,651 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2019-10-02 16:15:39,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:39,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-10-02 16:15:39,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:39,660 INFO L225 Difference]: With dead ends: 2752 [2019-10-02 16:15:39,660 INFO L226 Difference]: Without dead ends: 1442 [2019-10-02 16:15:39,663 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:15:39,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-10-02 16:15:39,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2019-10-02 16:15:39,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-10-02 16:15:39,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2019-10-02 16:15:39,709 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 249 [2019-10-02 16:15:39,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:39,710 INFO L475 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2019-10-02 16:15:39,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:39,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2019-10-02 16:15:39,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-02 16:15:39,719 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:39,720 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:39,720 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:39,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:39,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1835594086, now seen corresponding path program 1 times [2019-10-02 16:15:39,721 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:39,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:39,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:39,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:39,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:39,855 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-02 16:15:39,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:39,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:39,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:39,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:39,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:39,857 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2019-10-02 16:15:40,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:40,052 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2019-10-02 16:15:40,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:40,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-10-02 16:15:40,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:40,063 INFO L225 Difference]: With dead ends: 2992 [2019-10-02 16:15:40,063 INFO L226 Difference]: Without dead ends: 1570 [2019-10-02 16:15:40,067 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:15:40,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-10-02 16:15:40,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2019-10-02 16:15:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-10-02 16:15:40,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2019-10-02 16:15:40,125 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 249 [2019-10-02 16:15:40,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:40,126 INFO L475 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2019-10-02 16:15:40,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:40,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2019-10-02 16:15:40,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-10-02 16:15:40,134 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:40,134 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:40,134 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:40,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:40,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1915187928, now seen corresponding path program 1 times [2019-10-02 16:15:40,135 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:40,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:40,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:40,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:40,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2019-10-02 16:15:40,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:40,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:40,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:40,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:40,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:40,261 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2019-10-02 16:15:40,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:40,310 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2019-10-02 16:15:40,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:40,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2019-10-02 16:15:40,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:40,325 INFO L225 Difference]: With dead ends: 4646 [2019-10-02 16:15:40,325 INFO L226 Difference]: Without dead ends: 3100 [2019-10-02 16:15:40,329 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:15:40,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2019-10-02 16:15:40,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2019-10-02 16:15:40,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2019-10-02 16:15:40,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2019-10-02 16:15:40,412 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 279 [2019-10-02 16:15:40,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:40,413 INFO L475 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2019-10-02 16:15:40,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:40,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2019-10-02 16:15:40,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-10-02 16:15:40,422 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:40,422 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:40,422 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:40,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:40,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1795007718, now seen corresponding path program 1 times [2019-10-02 16:15:40,423 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:40,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:40,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:40,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:40,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:40,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2019-10-02 16:15:40,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:40,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:40,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:40,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:40,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:40,533 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2019-10-02 16:15:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:40,742 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2019-10-02 16:15:40,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:40,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2019-10-02 16:15:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:40,762 INFO L225 Difference]: With dead ends: 6484 [2019-10-02 16:15:40,763 INFO L226 Difference]: Without dead ends: 3398 [2019-10-02 16:15:40,772 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:15:40,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-10-02 16:15:40,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2019-10-02 16:15:40,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2019-10-02 16:15:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2019-10-02 16:15:40,945 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 279 [2019-10-02 16:15:40,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:40,946 INFO L475 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2019-10-02 16:15:40,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:40,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2019-10-02 16:15:40,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-02 16:15:40,963 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:40,964 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2019-10-02 16:15:40,964 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:40,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:40,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1052232894, now seen corresponding path program 1 times [2019-10-02 16:15:40,965 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:40,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:40,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:40,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:40,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2019-10-02 16:15:41,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:41,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:41,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:41,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:41,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:41,143 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2019-10-02 16:15:41,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:41,348 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2019-10-02 16:15:41,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:41,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-10-02 16:15:41,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:41,366 INFO L225 Difference]: With dead ends: 6900 [2019-10-02 16:15:41,366 INFO L226 Difference]: Without dead ends: 3530 [2019-10-02 16:15:41,374 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:15:41,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2019-10-02 16:15:41,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2019-10-02 16:15:41,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2019-10-02 16:15:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2019-10-02 16:15:41,465 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 303 [2019-10-02 16:15:41,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:41,466 INFO L475 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2019-10-02 16:15:41,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:41,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2019-10-02 16:15:41,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-02 16:15:41,476 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:41,476 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 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] [2019-10-02 16:15:41,477 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:41,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:41,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1022376132, now seen corresponding path program 1 times [2019-10-02 16:15:41,477 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:41,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:41,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:41,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:41,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-02 16:15:41,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:41,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:41,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:41,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:41,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:41,650 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2019-10-02 16:15:41,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:41,855 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2019-10-02 16:15:41,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:41,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-10-02 16:15:41,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:41,875 INFO L225 Difference]: With dead ends: 7416 [2019-10-02 16:15:41,876 INFO L226 Difference]: Without dead ends: 3914 [2019-10-02 16:15:41,883 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:15:41,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2019-10-02 16:15:41,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2019-10-02 16:15:41,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2019-10-02 16:15:41,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2019-10-02 16:15:41,994 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 314 [2019-10-02 16:15:41,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:41,995 INFO L475 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2019-10-02 16:15:41,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:41,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2019-10-02 16:15:42,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-10-02 16:15:42,008 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:42,008 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 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, 1, 1] [2019-10-02 16:15:42,008 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:42,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:42,009 INFO L82 PathProgramCache]: Analyzing trace with hash -773017638, now seen corresponding path program 1 times [2019-10-02 16:15:42,009 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:42,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:42,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:42,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:42,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2019-10-02 16:15:42,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:42,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:42,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:42,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:42,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:42,165 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2019-10-02 16:15:42,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:42,401 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2019-10-02 16:15:42,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:42,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-10-02 16:15:42,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:42,437 INFO L225 Difference]: With dead ends: 8048 [2019-10-02 16:15:42,437 INFO L226 Difference]: Without dead ends: 4234 [2019-10-02 16:15:42,446 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:15:42,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2019-10-02 16:15:42,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2019-10-02 16:15:42,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2019-10-02 16:15:42,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2019-10-02 16:15:42,604 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 328 [2019-10-02 16:15:42,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:42,604 INFO L475 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2019-10-02 16:15:42,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:42,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2019-10-02 16:15:42,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-10-02 16:15:42,615 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:42,616 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 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, 1, 1, 1] [2019-10-02 16:15:42,616 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:42,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:42,616 INFO L82 PathProgramCache]: Analyzing trace with hash -815480887, now seen corresponding path program 1 times [2019-10-02 16:15:42,617 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:42,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:42,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:42,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:42,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:42,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 799 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-10-02 16:15:42,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:42,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:42,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:42,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:42,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:42,784 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2019-10-02 16:15:42,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:42,877 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2019-10-02 16:15:42,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:42,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-10-02 16:15:42,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:42,901 INFO L225 Difference]: With dead ends: 11310 [2019-10-02 16:15:42,901 INFO L226 Difference]: Without dead ends: 7376 [2019-10-02 16:15:42,912 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:15:42,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2019-10-02 16:15:43,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2019-10-02 16:15:43,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2019-10-02 16:15:43,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2019-10-02 16:15:43,127 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 329 [2019-10-02 16:15:43,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:43,128 INFO L475 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2019-10-02 16:15:43,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:43,128 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2019-10-02 16:15:43,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-10-02 16:15:43,143 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:43,144 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 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, 1, 1, 1, 1] [2019-10-02 16:15:43,144 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:43,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:43,145 INFO L82 PathProgramCache]: Analyzing trace with hash 415461791, now seen corresponding path program 1 times [2019-10-02 16:15:43,145 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:43,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:43,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:43,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:43,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:43,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 803 proven. 0 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2019-10-02 16:15:43,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:43,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:43,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:43,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:43,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:43,341 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2019-10-02 16:15:43,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:43,551 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2019-10-02 16:15:43,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:43,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-10-02 16:15:43,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:43,567 INFO L225 Difference]: With dead ends: 14744 [2019-10-02 16:15:43,568 INFO L226 Difference]: Without dead ends: 7382 [2019-10-02 16:15:43,581 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:15:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-10-02 16:15:43,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2019-10-02 16:15:43,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2019-10-02 16:15:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2019-10-02 16:15:43,745 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 330 [2019-10-02 16:15:43,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:43,746 INFO L475 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2019-10-02 16:15:43,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2019-10-02 16:15:43,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-10-02 16:15:43,761 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:43,762 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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:15:43,762 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:43,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:43,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1238161908, now seen corresponding path program 1 times [2019-10-02 16:15:43,763 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:43,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:43,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:43,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:43,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:43,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 874 proven. 10 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-02 16:15:43,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:15:43,941 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) [2019-10-02 16:15:43,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:15:44,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:44,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 16:15:44,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:15:44,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-10-02 16:15:44,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:15:44,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2019-10-02 16:15:44,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 16:15:44,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 16:15:44,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:15:44,354 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 7 states. [2019-10-02 16:15:45,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:45,058 INFO L93 Difference]: Finished difference Result 18408 states and 23982 transitions. [2019-10-02 16:15:45,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 16:15:45,059 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 353 [2019-10-02 16:15:45,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:45,090 INFO L225 Difference]: With dead ends: 18408 [2019-10-02 16:15:45,090 INFO L226 Difference]: Without dead ends: 11034 [2019-10-02 16:15:45,106 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-10-02 16:15:45,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2019-10-02 16:15:45,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 8460. [2019-10-02 16:15:45,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2019-10-02 16:15:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2019-10-02 16:15:45,473 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 353 [2019-10-02 16:15:45,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:45,473 INFO L475 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2019-10-02 16:15:45,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 16:15:45,474 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2019-10-02 16:15:45,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-10-02 16:15:45,494 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:45,494 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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:15:45,495 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:45,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:45,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1345653892, now seen corresponding path program 1 times [2019-10-02 16:15:45,496 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:45,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:45,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:45,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:45,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:45,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-02 16:15:45,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:15:45,757 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) [2019-10-02 16:15:45,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:15:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:45,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:15:45,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:15:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-02 16:15:46,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 16:15:46,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-02 16:15:46,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 16:15:46,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 16:15:46,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:15:46,003 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 4 states. [2019-10-02 16:15:46,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:46,443 INFO L93 Difference]: Finished difference Result 19118 states and 24882 transitions. [2019-10-02 16:15:46,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 16:15:46,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2019-10-02 16:15:46,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:46,466 INFO L225 Difference]: With dead ends: 19118 [2019-10-02 16:15:46,466 INFO L226 Difference]: Without dead ends: 10668 [2019-10-02 16:15:46,485 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 381 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:15:46,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10668 states. [2019-10-02 16:15:46,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10668 to 8518. [2019-10-02 16:15:46,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8518 states. [2019-10-02 16:15:46,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8518 states to 8518 states and 10888 transitions. [2019-10-02 16:15:46,714 INFO L78 Accepts]: Start accepts. Automaton has 8518 states and 10888 transitions. Word has length 379 [2019-10-02 16:15:46,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:46,715 INFO L475 AbstractCegarLoop]: Abstraction has 8518 states and 10888 transitions. [2019-10-02 16:15:46,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 16:15:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand 8518 states and 10888 transitions. [2019-10-02 16:15:46,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-10-02 16:15:46,738 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:46,738 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:46,739 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:46,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:46,739 INFO L82 PathProgramCache]: Analyzing trace with hash -391768364, now seen corresponding path program 1 times [2019-10-02 16:15:46,739 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:46,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:46,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:46,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:46,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:47,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-10-02 16:15:47,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:47,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:47,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:47,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:47,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:47,053 INFO L87 Difference]: Start difference. First operand 8518 states and 10888 transitions. Second operand 3 states. [2019-10-02 16:15:47,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:47,272 INFO L93 Difference]: Finished difference Result 15876 states and 19733 transitions. [2019-10-02 16:15:47,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:47,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-10-02 16:15:47,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:47,280 INFO L225 Difference]: With dead ends: 15876 [2019-10-02 16:15:47,280 INFO L226 Difference]: Without dead ends: 3820 [2019-10-02 16:15:47,300 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:15:47,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2019-10-02 16:15:47,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3610. [2019-10-02 16:15:47,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3610 states. [2019-10-02 16:15:47,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3610 states and 4508 transitions. [2019-10-02 16:15:47,371 INFO L78 Accepts]: Start accepts. Automaton has 3610 states and 4508 transitions. Word has length 418 [2019-10-02 16:15:47,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:47,371 INFO L475 AbstractCegarLoop]: Abstraction has 3610 states and 4508 transitions. [2019-10-02 16:15:47,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3610 states and 4508 transitions. [2019-10-02 16:15:47,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2019-10-02 16:15:47,386 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:47,387 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 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, 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] [2019-10-02 16:15:47,387 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:47,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:47,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1077932443, now seen corresponding path program 1 times [2019-10-02 16:15:47,388 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:47,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:47,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:47,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:47,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2019-10-02 16:15:47,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:15:47,585 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:15:47,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:47,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:15:47,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:15:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2019-10-02 16:15:48,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:15:48,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 16:15:48,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:15:48,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:15:48,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:15:48,188 INFO L87 Difference]: Start difference. First operand 3610 states and 4508 transitions. Second operand 5 states. [2019-10-02 16:15:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:48,579 INFO L93 Difference]: Finished difference Result 4555 states and 5673 transitions. [2019-10-02 16:15:48,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:15:48,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 516 [2019-10-02 16:15:48,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:48,581 INFO L225 Difference]: With dead ends: 4555 [2019-10-02 16:15:48,581 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 16:15:48,589 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:15:48,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 16:15:48,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 16:15:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 16:15:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 16:15:48,590 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 516 [2019-10-02 16:15:48,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:48,591 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 16:15:48,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:15:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 16:15:48,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 16:15:48,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 16:15:49,881 WARN L191 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 429 DAG size of output: 100 [2019-10-02 16:15:51,502 WARN L191 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-10-02 16:15:51,606 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-02 16:15:51,606 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 16:15:51,606 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2019-10-02 16:15:51,607 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2019-10-02 16:15:51,607 INFO L446 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2019-10-02 16:15:51,607 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2019-10-02 16:15:51,607 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2019-10-02 16:15:51,607 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2019-10-02 16:15:51,608 INFO L439 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2019-10-02 16:15:51,608 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 520) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) (<= 12292 ssl3_connect_~s__state~0))) [2019-10-02 16:15:51,608 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2019-10-02 16:15:51,608 INFO L443 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2019-10-02 16:15:51,608 INFO L443 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2019-10-02 16:15:51,609 INFO L443 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2019-10-02 16:15:51,609 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2019-10-02 16:15:51,609 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-10-02 16:15:51,609 INFO L443 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2019-10-02 16:15:51,609 INFO L443 ceAbstractionStarter]: For program point L270-2(lines 202 485) no Hoare annotation was computed. [2019-10-02 16:15:51,610 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2019-10-02 16:15:51,610 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2019-10-02 16:15:51,610 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2019-10-02 16:15:51,610 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2019-10-02 16:15:51,610 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1))) [2019-10-02 16:15:51,611 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2019-10-02 16:15:51,611 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2019-10-02 16:15:51,611 INFO L443 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2019-10-02 16:15:51,611 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2019-10-02 16:15:51,611 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2019-10-02 16:15:51,611 INFO L439 ceAbstractionStarter]: At program point L207(lines 105 519) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (<= ssl3_connect_~blastFlag~0 0)) [2019-10-02 16:15:51,612 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2019-10-02 16:15:51,612 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2019-10-02 16:15:51,612 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2019-10-02 16:15:51,612 INFO L439 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2019-10-02 16:15:51,613 INFO L443 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2019-10-02 16:15:51,613 INFO L443 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2019-10-02 16:15:51,613 INFO L446 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2019-10-02 16:15:51,613 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2019-10-02 16:15:51,613 INFO L443 ceAbstractionStarter]: For program point L276-2(lines 276 280) no Hoare annotation was computed. [2019-10-02 16:15:51,614 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2019-10-02 16:15:51,614 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2019-10-02 16:15:51,614 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2019-10-02 16:15:51,614 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= ssl3_connect_~s__hit~0 0)) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2019-10-02 16:15:51,614 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2019-10-02 16:15:51,614 INFO L443 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2019-10-02 16:15:51,615 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2019-10-02 16:15:51,615 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2019-10-02 16:15:51,615 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2019-10-02 16:15:51,615 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2019-10-02 16:15:51,616 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2019-10-02 16:15:51,616 INFO L443 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2019-10-02 16:15:51,616 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2019-10-02 16:15:51,616 INFO L443 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2019-10-02 16:15:51,616 INFO L443 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2019-10-02 16:15:51,617 INFO L439 ceAbstractionStarter]: At program point L181(lines 177 495) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2019-10-02 16:15:51,617 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2019-10-02 16:15:51,617 INFO L443 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2019-10-02 16:15:51,617 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2019-10-02 16:15:51,617 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2019-10-02 16:15:51,618 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2019-10-02 16:15:51,618 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2019-10-02 16:15:51,618 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2019-10-02 16:15:51,618 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-10-02 16:15:51,618 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2019-10-02 16:15:51,619 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 505) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2019-10-02 16:15:51,619 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2019-10-02 16:15:51,619 INFO L443 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2019-10-02 16:15:51,619 INFO L443 ceAbstractionStarter]: For program point L251(lines 251 257) no Hoare annotation was computed. [2019-10-02 16:15:51,619 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2019-10-02 16:15:51,620 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2019-10-02 16:15:51,620 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2019-10-02 16:15:51,620 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2019-10-02 16:15:51,620 INFO L439 ceAbstractionStarter]: At program point L187(lines 183 493) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2019-10-02 16:15:51,621 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2019-10-02 16:15:51,621 INFO L443 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2019-10-02 16:15:51,621 INFO L443 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2019-10-02 16:15:51,621 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 297) no Hoare annotation was computed. [2019-10-02 16:15:51,621 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2019-10-02 16:15:51,622 INFO L443 ceAbstractionStarter]: For program point L287-2(lines 287 297) no Hoare annotation was computed. [2019-10-02 16:15:51,622 INFO L443 ceAbstractionStarter]: For program point L254-2(lines 202 485) no Hoare annotation was computed. [2019-10-02 16:15:51,623 INFO L439 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0))) (let ((.cse9 (not .cse1)) (.cse5 (= ssl3_connect_~s__state~0 4512)) (.cse7 (<= 4560 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4560)) (.cse12 (<= ssl3_connect_~s__state~0 3)) (.cse2 (= ssl3_connect_~s__state~0 4480)) (.cse13 (= 4464 ssl3_connect_~s__state~0)) (.cse14 (= ssl3_connect_~s__state~0 4528)) (.cse6 (<= ssl3_connect_~blastFlag~0 2)) (.cse16 (= 4400 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4352 ssl3_connect_~s__state~0)) (.cse15 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse4 (= ssl3_connect_~s__state~0 4496)) (.cse0 (<= ssl3_connect_~blastFlag~0 4)) (.cse17 (= 4448 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1) (and .cse3 .cse5 .cse1) (and .cse6 .cse7 .cse8 .cse9) (and .cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse10 .cse11 .cse9) (and .cse5 .cse0 .cse1) (and .cse12 .cse6 .cse1) (and .cse3 .cse13 .cse1) (and .cse6 .cse5) (and .cse3 .cse14 .cse1) (and .cse3 .cse7 .cse1 .cse8 .cse15) (and .cse12 .cse3) (and .cse6 (= 4384 ssl3_connect_~s__state~0)) (and .cse3 .cse1 .cse2) (and .cse13 .cse0 .cse1) (and .cse3 .cse0 .cse16 .cse1) (and .cse6 .cse14) (and (= ssl3_connect_~s__state~0 4432) .cse0 .cse1) (and .cse14 .cse0 .cse1) (and .cse3 .cse1 .cse17) (and .cse6 .cse16 .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse10 .cse11 .cse1 .cse15) (and .cse4 .cse0 .cse1) (and .cse0 .cse1 (= 4416 ssl3_connect_~s__state~0)) (and .cse0 .cse1 .cse17) (<= ssl3_connect_~blastFlag~0 0)))) [2019-10-02 16:15:51,623 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2019-10-02 16:15:51,623 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2019-10-02 16:15:51,623 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2019-10-02 16:15:51,623 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2019-10-02 16:15:51,624 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2019-10-02 16:15:51,624 INFO L439 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2019-10-02 16:15:51,624 INFO L443 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2019-10-02 16:15:51,624 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2019-10-02 16:15:51,624 INFO L443 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2019-10-02 16:15:51,625 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2019-10-02 16:15:51,625 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2019-10-02 16:15:51,625 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2019-10-02 16:15:51,625 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2019-10-02 16:15:51,625 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-10-02 16:15:51,625 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 293) no Hoare annotation was computed. [2019-10-02 16:15:51,625 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2019-10-02 16:15:51,626 INFO L443 ceAbstractionStarter]: For program point L291-2(lines 289 297) no Hoare annotation was computed. [2019-10-02 16:15:51,626 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2019-10-02 16:15:51,626 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2019-10-02 16:15:51,626 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2019-10-02 16:15:51,626 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2019-10-02 16:15:51,627 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2019-10-02 16:15:51,627 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2019-10-02 16:15:51,627 INFO L443 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2019-10-02 16:15:51,627 INFO L439 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 (not .cse1)))) [2019-10-02 16:15:51,628 INFO L439 ceAbstractionStarter]: At program point L127(lines 123 513) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2019-10-02 16:15:51,628 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2019-10-02 16:15:51,628 INFO L443 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2019-10-02 16:15:51,628 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2019-10-02 16:15:51,628 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2019-10-02 16:15:51,628 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2019-10-02 16:15:51,628 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2019-10-02 16:15:51,629 INFO L443 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2019-10-02 16:15:51,629 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2019-10-02 16:15:51,629 INFO L439 ceAbstractionStarter]: At program point L196(lines 195 489) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)))) [2019-10-02 16:15:51,629 INFO L439 ceAbstractionStarter]: At program point L163(lines 153 503) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2019-10-02 16:15:51,630 INFO L443 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2019-10-02 16:15:51,630 INFO L443 ceAbstractionStarter]: For program point L263(lines 263 265) no Hoare annotation was computed. [2019-10-02 16:15:51,630 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2019-10-02 16:15:51,630 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2019-10-02 16:15:51,630 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2019-10-02 16:15:51,631 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 76 551) no Hoare annotation was computed. [2019-10-02 16:15:51,631 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2019-10-02 16:15:51,631 INFO L446 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2019-10-02 16:15:51,631 INFO L439 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 .cse1))) [2019-10-02 16:15:51,632 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-02 16:15:51,632 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2019-10-02 16:15:51,632 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 16:15:51,632 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 16:15:51,632 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 16:15:51,633 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 16:15:51,633 INFO L439 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (<= 12292 main_~s~0) [2019-10-02 16:15:51,633 INFO L443 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2019-10-02 16:15:51,633 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2019-10-02 16:15:51,633 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2019-10-02 16:15:51,634 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2019-10-02 16:15:51,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 04:15:51 BoogieIcfgContainer [2019-10-02 16:15:51,660 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 16:15:51,663 INFO L168 Benchmark]: Toolchain (without parser) took 17032.63 ms. Allocated memory was 140.0 MB in the beginning and 888.1 MB in the end (delta: 748.2 MB). Free memory was 86.6 MB in the beginning and 588.3 MB in the end (delta: -501.7 MB). Peak memory consumption was 764.3 MB. Max. memory is 7.1 GB. [2019-10-02 16:15:51,664 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 106.0 MB in the beginning and 105.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:15:51,665 INFO L168 Benchmark]: CACSL2BoogieTranslator took 553.53 ms. Allocated memory was 140.0 MB in the beginning and 200.3 MB in the end (delta: 60.3 MB). Free memory was 86.3 MB in the beginning and 172.9 MB in the end (delta: -86.5 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2019-10-02 16:15:51,666 INFO L168 Benchmark]: Boogie Preprocessor took 49.22 ms. Allocated memory is still 200.3 MB. Free memory was 172.9 MB in the beginning and 170.4 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:15:51,667 INFO L168 Benchmark]: RCFGBuilder took 737.01 ms. Allocated memory is still 200.3 MB. Free memory was 170.4 MB in the beginning and 124.4 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2019-10-02 16:15:51,668 INFO L168 Benchmark]: TraceAbstraction took 15687.40 ms. Allocated memory was 200.3 MB in the beginning and 888.1 MB in the end (delta: 687.9 MB). Free memory was 124.4 MB in the beginning and 588.3 MB in the end (delta: -463.9 MB). Peak memory consumption was 741.9 MB. Max. memory is 7.1 GB. [2019-10-02 16:15:51,672 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.22 ms. Allocated memory is still 140.0 MB. Free memory was 106.0 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 553.53 ms. Allocated memory was 140.0 MB in the beginning and 200.3 MB in the end (delta: 60.3 MB). Free memory was 86.3 MB in the beginning and 172.9 MB in the end (delta: -86.5 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.22 ms. Allocated memory is still 200.3 MB. Free memory was 172.9 MB in the beginning and 170.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 737.01 ms. Allocated memory is still 200.3 MB. Free memory was 170.4 MB in the beginning and 124.4 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15687.40 ms. Allocated memory was 200.3 MB in the beginning and 888.1 MB in the end (delta: 687.9 MB). Free memory was 124.4 MB in the beginning and 588.3 MB in the end (delta: -463.9 MB). Peak memory consumption was 741.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: 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: 189]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (blastFlag <= 0 && 4560 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state))) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || blastFlag <= 0 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((blastFlag <= 0 && s__state <= 4352) && 4352 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && 4464 == s__state) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && 4384 == s__state)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((4464 == s__state && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 4) && 4400 == s__state) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && 4448 == s__state)) || ((blastFlag <= 2 && 4400 == s__state) && s__hit == 0)) || !(12292 <= \old(initial_state))) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || ((blastFlag <= 4 && s__hit == 0) && 4416 == s__state)) || ((blastFlag <= 4 && s__hit == 0) && 4448 == s__state)) || blastFlag <= 0 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 136 locations, 1 error locations. SAFE Result, 15.5s OverallTime, 24 OverallIterations, 20 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 3.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4971 SDtfs, 1932 SDslu, 3379 SDs, 0 SdLazy, 2650 SolverSat, 478 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1335 GetRequests, 1296 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8518occurred in iteration=22, 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: 2.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 5532 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 269 NumberOfFragments, 773 HoareAnnotationTreeSize, 26 FomulaSimplifications, 17947 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 26 FomulaSimplificationsInter, 1648 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 6709 NumberOfCodeBlocks, 6709 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6682 ConstructedInterpolants, 0 QuantifiedInterpolants, 3264518 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2309 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 27 InterpolantComputations, 23 PerfectInterpolantSequences, 26313/26347 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...