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_1.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:17:51,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:17:51,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:17:51,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:17:51,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:17:51,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:17:51,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:17:51,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:17:51,587 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:17:51,588 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:17:51,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:17:51,590 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:17:51,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:17:51,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:17:51,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:17:51,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:17:51,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:17:51,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:17:51,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:17:51,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:17:51,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:17:51,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:17:51,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:17:51,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:17:51,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:17:51,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:17:51,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:17:51,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:17:51,615 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:17:51,616 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:17:51,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:17:51,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:17:51,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:17:51,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:17:51,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:17:51,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:17:51,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:17:51,622 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:17:51,622 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:17:51,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:17:51,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:17:51,627 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-09-16 16:17:51,643 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:17:51,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:17:51,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:17:51,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:17:51,645 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:17:51,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:17:51,645 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:17:51,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:17:51,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:17:51,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:17:51,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:17:51,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:17:51,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:17:51,647 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:17:51,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:17:51,647 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:17:51,647 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:17:51,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:17:51,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:17:51,648 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:17:51,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:17:51,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:17:51,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:17:51,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:17:51,649 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:17:51,650 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:17:51,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:17:51,650 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:17:51,650 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:17:51,702 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:17:51,714 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:17:51,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:17:51,721 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:17:51,721 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:17:51,722 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-1.c [2019-09-16 16:17:51,782 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dd92de6d/79eea20a261541258560b26435684f43/FLAG7b161eb7c [2019-09-16 16:17:52,262 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:17:52,263 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-1.c [2019-09-16 16:17:52,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dd92de6d/79eea20a261541258560b26435684f43/FLAG7b161eb7c [2019-09-16 16:17:52,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dd92de6d/79eea20a261541258560b26435684f43 [2019-09-16 16:17:52,309 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:17:52,311 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:17:52,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:17:52,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:17:52,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:17:52,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:17:52" (1/1) ... [2019-09-16 16:17:52,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6325ec14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:17:52, skipping insertion in model container [2019-09-16 16:17:52,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:17:52" (1/1) ... [2019-09-16 16:17:52,327 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:17:52,364 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:17:52,579 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:17:52,586 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:17:52,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:17:52,781 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:17:52,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:17:52 WrapperNode [2019-09-16 16:17:52,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:17:52,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:17:52,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:17:52,784 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:17:52,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:17:52" (1/1) ... [2019-09-16 16:17:52,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:17:52" (1/1) ... [2019-09-16 16:17:52,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:17:52" (1/1) ... [2019-09-16 16:17:52,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:17:52" (1/1) ... [2019-09-16 16:17:52,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:17:52" (1/1) ... [2019-09-16 16:17:52,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:17:52" (1/1) ... [2019-09-16 16:17:52,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:17:52" (1/1) ... [2019-09-16 16:17:52,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:17:52,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:17:52,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:17:52,836 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:17:52,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:17:52" (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-09-16 16:17:52,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:17:52,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:17:52,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-16 16:17:52,890 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:17:52,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:17:52,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-16 16:17:52,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:17:52,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-16 16:17:52,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 16:17:52,891 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-16 16:17:52,891 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:17:52,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:17:52,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:17:53,075 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 16:17:53,543 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-16 16:17:53,543 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-16 16:17:53,554 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:17:53,554 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 16:17:53,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:17:53 BoogieIcfgContainer [2019-09-16 16:17:53,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:17:53,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:17:53,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:17:53,559 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:17:53,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:17:52" (1/3) ... [2019-09-16 16:17:53,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385eb7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:17:53, skipping insertion in model container [2019-09-16 16:17:53,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:17:52" (2/3) ... [2019-09-16 16:17:53,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385eb7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:17:53, skipping insertion in model container [2019-09-16 16:17:53,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:17:53" (3/3) ... [2019-09-16 16:17:53,563 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil-1.c [2019-09-16 16:17:53,573 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:17:53,581 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:17:53,598 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:17:53,645 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:17:53,646 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:17:53,646 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:17:53,646 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:17:53,646 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:17:53,646 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:17:53,647 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:17:53,647 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:17:53,647 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:17:53,672 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2019-09-16 16:17:53,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 16:17:53,681 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:17:53,682 INFO L407 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-09-16 16:17:53,684 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:17:53,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:17:53,688 INFO L82 PathProgramCache]: Analyzing trace with hash 173381458, now seen corresponding path program 1 times [2019-09-16 16:17:53,689 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:17:53,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:17:53,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:53,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:17:53,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:17:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:17:53,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:17:53,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:17:53,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:17:53,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:17:53,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:17:53,925 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 3 states. [2019-09-16 16:17:54,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:17:54,036 INFO L93 Difference]: Finished difference Result 374 states and 631 transitions. [2019-09-16 16:17:54,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:17:54,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-16 16:17:54,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:17:54,054 INFO L225 Difference]: With dead ends: 374 [2019-09-16 16:17:54,055 INFO L226 Difference]: Without dead ends: 218 [2019-09-16 16:17:54,060 INFO L636 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-09-16 16:17:54,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-16 16:17:54,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2019-09-16 16:17:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-09-16 16:17:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 324 transitions. [2019-09-16 16:17:54,132 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 324 transitions. Word has length 29 [2019-09-16 16:17:54,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:17:54,133 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 324 transitions. [2019-09-16 16:17:54,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:17:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 324 transitions. [2019-09-16 16:17:54,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-16 16:17:54,141 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:17:54,142 INFO L407 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-09-16 16:17:54,143 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:17:54,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:17:54,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1098410427, now seen corresponding path program 1 times [2019-09-16 16:17:54,144 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:17:54,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:17:54,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:54,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:17:54,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:17:54,304 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:17:54,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:17:54,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:17:54,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:17:54,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:17:54,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:17:54,308 INFO L87 Difference]: Start difference. First operand 218 states and 324 transitions. Second operand 3 states. [2019-09-16 16:17:54,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:17:54,542 INFO L93 Difference]: Finished difference Result 466 states and 703 transitions. [2019-09-16 16:17:54,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:17:54,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-09-16 16:17:54,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:17:54,546 INFO L225 Difference]: With dead ends: 466 [2019-09-16 16:17:54,546 INFO L226 Difference]: Without dead ends: 260 [2019-09-16 16:17:54,548 INFO L636 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-09-16 16:17:54,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-09-16 16:17:54,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 252. [2019-09-16 16:17:54,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-09-16 16:17:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 368 transitions. [2019-09-16 16:17:54,571 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 368 transitions. Word has length 43 [2019-09-16 16:17:54,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:17:54,571 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 368 transitions. [2019-09-16 16:17:54,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:17:54,571 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 368 transitions. [2019-09-16 16:17:54,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-16 16:17:54,574 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:17:54,575 INFO L407 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-09-16 16:17:54,575 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:17:54,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:17:54,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1578256893, now seen corresponding path program 1 times [2019-09-16 16:17:54,575 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:17:54,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:17:54,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:54,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:17:54,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:17:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 16:17:54,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:17:54,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:17:54,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:17:54,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:17:54,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:17:54,684 INFO L87 Difference]: Start difference. First operand 252 states and 368 transitions. Second operand 3 states. [2019-09-16 16:17:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:17:54,893 INFO L93 Difference]: Finished difference Result 594 states and 898 transitions. [2019-09-16 16:17:54,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:17:54,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-16 16:17:54,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:17:54,896 INFO L225 Difference]: With dead ends: 594 [2019-09-16 16:17:54,896 INFO L226 Difference]: Without dead ends: 352 [2019-09-16 16:17:54,898 INFO L636 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-09-16 16:17:54,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-16 16:17:54,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 334. [2019-09-16 16:17:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-09-16 16:17:54,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 468 transitions. [2019-09-16 16:17:54,918 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 468 transitions. Word has length 60 [2019-09-16 16:17:54,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:17:54,919 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 468 transitions. [2019-09-16 16:17:54,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:17:54,919 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 468 transitions. [2019-09-16 16:17:54,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-16 16:17:54,923 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:17:54,923 INFO L407 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-09-16 16:17:54,923 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:17:54,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:17:54,924 INFO L82 PathProgramCache]: Analyzing trace with hash -227181441, now seen corresponding path program 1 times [2019-09-16 16:17:54,924 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:17:54,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:17:54,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:54,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:17:54,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:17:55,001 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 16:17:55,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:17:55,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:17:55,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:17:55,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:17:55,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:17:55,003 INFO L87 Difference]: Start difference. First operand 334 states and 468 transitions. Second operand 3 states. [2019-09-16 16:17:55,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:17:55,133 INFO L93 Difference]: Finished difference Result 702 states and 999 transitions. [2019-09-16 16:17:55,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:17:55,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-16 16:17:55,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:17:55,138 INFO L225 Difference]: With dead ends: 702 [2019-09-16 16:17:55,138 INFO L226 Difference]: Without dead ends: 380 [2019-09-16 16:17:55,140 INFO L636 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-09-16 16:17:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-09-16 16:17:55,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 372. [2019-09-16 16:17:55,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-09-16 16:17:55,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 516 transitions. [2019-09-16 16:17:55,156 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 516 transitions. Word has length 60 [2019-09-16 16:17:55,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:17:55,157 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 516 transitions. [2019-09-16 16:17:55,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:17:55,157 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 516 transitions. [2019-09-16 16:17:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-16 16:17:55,161 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:17:55,161 INFO L407 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-09-16 16:17:55,162 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:17:55,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:17:55,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1103223005, now seen corresponding path program 1 times [2019-09-16 16:17:55,162 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:17:55,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:17:55,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:55,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:17:55,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:17:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 16:17:55,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:17:55,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:17:55,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:17:55,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:17:55,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:17:55,216 INFO L87 Difference]: Start difference. First operand 372 states and 516 transitions. Second operand 3 states. [2019-09-16 16:17:55,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:17:55,502 INFO L93 Difference]: Finished difference Result 838 states and 1200 transitions. [2019-09-16 16:17:55,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:17:55,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-16 16:17:55,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:17:55,506 INFO L225 Difference]: With dead ends: 838 [2019-09-16 16:17:55,506 INFO L226 Difference]: Without dead ends: 476 [2019-09-16 16:17:55,507 INFO L636 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-09-16 16:17:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-09-16 16:17:55,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 450. [2019-09-16 16:17:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-16 16:17:55,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 650 transitions. [2019-09-16 16:17:55,524 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 650 transitions. Word has length 73 [2019-09-16 16:17:55,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:17:55,524 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 650 transitions. [2019-09-16 16:17:55,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:17:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 650 transitions. [2019-09-16 16:17:55,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-16 16:17:55,526 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:17:55,527 INFO L407 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] [2019-09-16 16:17:55,527 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:17:55,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:17:55,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1464237739, now seen corresponding path program 1 times [2019-09-16 16:17:55,527 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:17:55,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:17:55,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:55,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:17:55,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:17:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-16 16:17:55,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:17:55,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:17:55,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:17:55,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:17:55,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:17:55,582 INFO L87 Difference]: Start difference. First operand 450 states and 650 transitions. Second operand 3 states. [2019-09-16 16:17:55,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:17:55,717 INFO L93 Difference]: Finished difference Result 936 states and 1361 transitions. [2019-09-16 16:17:55,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:17:55,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-16 16:17:55,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:17:55,723 INFO L225 Difference]: With dead ends: 936 [2019-09-16 16:17:55,724 INFO L226 Difference]: Without dead ends: 498 [2019-09-16 16:17:55,725 INFO L636 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-09-16 16:17:55,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-09-16 16:17:55,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 492. [2019-09-16 16:17:55,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-09-16 16:17:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 702 transitions. [2019-09-16 16:17:55,741 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 702 transitions. Word has length 76 [2019-09-16 16:17:55,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:17:55,742 INFO L475 AbstractCegarLoop]: Abstraction has 492 states and 702 transitions. [2019-09-16 16:17:55,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:17:55,742 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 702 transitions. [2019-09-16 16:17:55,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-16 16:17:55,743 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:17:55,744 INFO L407 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] [2019-09-16 16:17:55,744 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:17:55,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:17:55,744 INFO L82 PathProgramCache]: Analyzing trace with hash 665980045, now seen corresponding path program 1 times [2019-09-16 16:17:55,744 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:17:55,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:17:55,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:55,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:17:55,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:17:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-16 16:17:55,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:17:55,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:17:55,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:17:55,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:17:55,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:17:55,822 INFO L87 Difference]: Start difference. First operand 492 states and 702 transitions. Second operand 3 states. [2019-09-16 16:17:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:17:55,860 INFO L93 Difference]: Finished difference Result 972 states and 1393 transitions. [2019-09-16 16:17:55,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:17:55,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-16 16:17:55,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:17:55,865 INFO L225 Difference]: With dead ends: 972 [2019-09-16 16:17:55,865 INFO L226 Difference]: Without dead ends: 731 [2019-09-16 16:17:55,866 INFO L636 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-09-16 16:17:55,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-09-16 16:17:55,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-09-16 16:17:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-09-16 16:17:55,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1044 transitions. [2019-09-16 16:17:55,886 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1044 transitions. Word has length 96 [2019-09-16 16:17:55,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:17:55,886 INFO L475 AbstractCegarLoop]: Abstraction has 731 states and 1044 transitions. [2019-09-16 16:17:55,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:17:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1044 transitions. [2019-09-16 16:17:55,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-16 16:17:55,888 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:17:55,888 INFO L407 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] [2019-09-16 16:17:55,889 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:17:55,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:17:55,889 INFO L82 PathProgramCache]: Analyzing trace with hash -208123337, now seen corresponding path program 1 times [2019-09-16 16:17:55,889 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:17:55,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:17:55,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:55,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:17:55,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:17:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-16 16:17:55,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:17:55,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:17:55,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:17:55,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:17:55,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:17:55,942 INFO L87 Difference]: Start difference. First operand 731 states and 1044 transitions. Second operand 3 states. [2019-09-16 16:17:55,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:17:55,984 INFO L93 Difference]: Finished difference Result 972 states and 1390 transitions. [2019-09-16 16:17:55,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:17:55,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-16 16:17:55,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:17:55,989 INFO L225 Difference]: With dead ends: 972 [2019-09-16 16:17:55,989 INFO L226 Difference]: Without dead ends: 970 [2019-09-16 16:17:55,990 INFO L636 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-09-16 16:17:55,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-09-16 16:17:56,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2019-09-16 16:17:56,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-09-16 16:17:56,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1388 transitions. [2019-09-16 16:17:56,016 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1388 transitions. Word has length 98 [2019-09-16 16:17:56,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:17:56,016 INFO L475 AbstractCegarLoop]: Abstraction has 970 states and 1388 transitions. [2019-09-16 16:17:56,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:17:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1388 transitions. [2019-09-16 16:17:56,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-16 16:17:56,018 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:17:56,019 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:17:56,019 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:17:56,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:17:56,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1174534704, now seen corresponding path program 1 times [2019-09-16 16:17:56,020 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:17:56,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:17:56,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:56,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:17:56,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:17:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-16 16:17:56,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:17:56,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:17:56,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:17:56,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:17:56,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:17:56,101 INFO L87 Difference]: Start difference. First operand 970 states and 1388 transitions. Second operand 3 states. [2019-09-16 16:17:56,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:17:56,233 INFO L93 Difference]: Finished difference Result 2034 states and 2930 transitions. [2019-09-16 16:17:56,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:17:56,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-16 16:17:56,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:17:56,238 INFO L225 Difference]: With dead ends: 2034 [2019-09-16 16:17:56,239 INFO L226 Difference]: Without dead ends: 1076 [2019-09-16 16:17:56,241 INFO L636 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-09-16 16:17:56,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-09-16 16:17:56,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1062. [2019-09-16 16:17:56,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2019-09-16 16:17:56,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1500 transitions. [2019-09-16 16:17:56,271 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1500 transitions. Word has length 123 [2019-09-16 16:17:56,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:17:56,272 INFO L475 AbstractCegarLoop]: Abstraction has 1062 states and 1500 transitions. [2019-09-16 16:17:56,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:17:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1500 transitions. [2019-09-16 16:17:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-16 16:17:56,277 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:17:56,277 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:17:56,278 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:17:56,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:17:56,278 INFO L82 PathProgramCache]: Analyzing trace with hash -176623095, now seen corresponding path program 1 times [2019-09-16 16:17:56,278 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:17:56,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:17:56,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:56,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:17:56,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:17:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-16 16:17:56,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:17:56,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:17:56,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:17:56,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:17:56,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:17:56,339 INFO L87 Difference]: Start difference. First operand 1062 states and 1500 transitions. Second operand 3 states. [2019-09-16 16:17:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:17:56,529 INFO L93 Difference]: Finished difference Result 2316 states and 3324 transitions. [2019-09-16 16:17:56,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:17:56,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-16 16:17:56,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:17:56,537 INFO L225 Difference]: With dead ends: 2316 [2019-09-16 16:17:56,537 INFO L226 Difference]: Without dead ends: 1258 [2019-09-16 16:17:56,540 INFO L636 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-09-16 16:17:56,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-09-16 16:17:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1218. [2019-09-16 16:17:56,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-09-16 16:17:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1724 transitions. [2019-09-16 16:17:56,574 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1724 transitions. Word has length 144 [2019-09-16 16:17:56,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:17:56,575 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1724 transitions. [2019-09-16 16:17:56,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:17:56,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1724 transitions. [2019-09-16 16:17:56,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-16 16:17:56,581 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:17:56,582 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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-09-16 16:17:56,582 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:17:56,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:17:56,583 INFO L82 PathProgramCache]: Analyzing trace with hash -871418854, now seen corresponding path program 1 times [2019-09-16 16:17:56,583 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:17:56,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:17:56,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:56,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:17:56,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:17:56,682 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-16 16:17:56,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:17:56,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:17:56,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:17:56,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:17:56,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:17:56,684 INFO L87 Difference]: Start difference. First operand 1218 states and 1724 transitions. Second operand 3 states. [2019-09-16 16:17:56,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:17:56,816 INFO L93 Difference]: Finished difference Result 2544 states and 3576 transitions. [2019-09-16 16:17:56,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:17:56,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-16 16:17:56,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:17:56,824 INFO L225 Difference]: With dead ends: 2544 [2019-09-16 16:17:56,824 INFO L226 Difference]: Without dead ends: 1338 [2019-09-16 16:17:56,827 INFO L636 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-09-16 16:17:56,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2019-09-16 16:17:56,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1330. [2019-09-16 16:17:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2019-09-16 16:17:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1856 transitions. [2019-09-16 16:17:56,859 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1856 transitions. Word has length 180 [2019-09-16 16:17:56,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:17:56,860 INFO L475 AbstractCegarLoop]: Abstraction has 1330 states and 1856 transitions. [2019-09-16 16:17:56,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:17:56,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1856 transitions. [2019-09-16 16:17:56,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-16 16:17:56,864 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:17:56,864 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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-09-16 16:17:56,864 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:17:56,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:17:56,865 INFO L82 PathProgramCache]: Analyzing trace with hash -310719076, now seen corresponding path program 1 times [2019-09-16 16:17:56,865 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:17:56,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:17:56,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:56,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:17:56,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:17:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-16 16:17:56,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:17:56,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:17:56,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:17:56,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:17:56,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:17:56,931 INFO L87 Difference]: Start difference. First operand 1330 states and 1856 transitions. Second operand 3 states. [2019-09-16 16:17:57,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:17:57,067 INFO L93 Difference]: Finished difference Result 2784 states and 3876 transitions. [2019-09-16 16:17:57,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:17:57,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-16 16:17:57,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:17:57,075 INFO L225 Difference]: With dead ends: 2784 [2019-09-16 16:17:57,075 INFO L226 Difference]: Without dead ends: 1466 [2019-09-16 16:17:57,077 INFO L636 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-09-16 16:17:57,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2019-09-16 16:17:57,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1454. [2019-09-16 16:17:57,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2019-09-16 16:17:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2000 transitions. [2019-09-16 16:17:57,118 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2000 transitions. Word has length 180 [2019-09-16 16:17:57,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:17:57,119 INFO L475 AbstractCegarLoop]: Abstraction has 1454 states and 2000 transitions. [2019-09-16 16:17:57,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:17:57,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2000 transitions. [2019-09-16 16:17:57,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-16 16:17:57,126 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:17:57,126 INFO L407 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 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-09-16 16:17:57,127 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:17:57,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:17:57,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2035334682, now seen corresponding path program 1 times [2019-09-16 16:17:57,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:17:57,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:17:57,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:57,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:17:57,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:17:57,234 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-09-16 16:17:57,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:17:57,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:17:57,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:17:57,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:17:57,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:17:57,236 INFO L87 Difference]: Start difference. First operand 1454 states and 2000 transitions. Second operand 3 states. [2019-09-16 16:17:57,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:17:57,301 INFO L93 Difference]: Finished difference Result 4334 states and 5964 transitions. [2019-09-16 16:17:57,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:17:57,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-09-16 16:17:57,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:17:57,314 INFO L225 Difference]: With dead ends: 4334 [2019-09-16 16:17:57,315 INFO L226 Difference]: Without dead ends: 2892 [2019-09-16 16:17:57,318 INFO L636 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-09-16 16:17:57,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2019-09-16 16:17:57,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2890. [2019-09-16 16:17:57,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2890 states. [2019-09-16 16:17:57,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 3975 transitions. [2019-09-16 16:17:57,393 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 3975 transitions. Word has length 210 [2019-09-16 16:17:57,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:17:57,394 INFO L475 AbstractCegarLoop]: Abstraction has 2890 states and 3975 transitions. [2019-09-16 16:17:57,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:17:57,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 3975 transitions. [2019-09-16 16:17:57,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-16 16:17:57,401 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:17:57,401 INFO L407 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 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-09-16 16:17:57,401 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:17:57,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:17:57,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1698932836, now seen corresponding path program 1 times [2019-09-16 16:17:57,402 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:17:57,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:17:57,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:57,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:17:57,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:17:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-16 16:17:57,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:17:57,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:17:57,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:17:57,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:17:57,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:17:57,502 INFO L87 Difference]: Start difference. First operand 2890 states and 3975 transitions. Second operand 3 states. [2019-09-16 16:17:57,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:17:57,709 INFO L93 Difference]: Finished difference Result 6068 states and 8346 transitions. [2019-09-16 16:17:57,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:17:57,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-09-16 16:17:57,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:17:57,729 INFO L225 Difference]: With dead ends: 6068 [2019-09-16 16:17:57,729 INFO L226 Difference]: Without dead ends: 3190 [2019-09-16 16:17:57,738 INFO L636 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-09-16 16:17:57,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2019-09-16 16:17:57,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 3174. [2019-09-16 16:17:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3174 states. [2019-09-16 16:17:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 4299 transitions. [2019-09-16 16:17:57,833 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 4299 transitions. Word has length 210 [2019-09-16 16:17:57,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:17:57,834 INFO L475 AbstractCegarLoop]: Abstraction has 3174 states and 4299 transitions. [2019-09-16 16:17:57,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:17:57,834 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 4299 transitions. [2019-09-16 16:17:57,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-16 16:17:57,846 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:17:57,847 INFO L407 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:17:57,847 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:17:57,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:17:57,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1588238652, now seen corresponding path program 1 times [2019-09-16 16:17:57,848 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:17:57,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:17:57,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:57,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:17:57,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:17:58,062 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-09-16 16:17:58,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:17:58,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:17:58,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:17:58,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:17:58,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:17:58,065 INFO L87 Difference]: Start difference. First operand 3174 states and 4299 transitions. Second operand 3 states. [2019-09-16 16:17:58,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:17:58,223 INFO L93 Difference]: Finished difference Result 6484 states and 8778 transitions. [2019-09-16 16:17:58,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:17:58,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-09-16 16:17:58,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:17:58,239 INFO L225 Difference]: With dead ends: 6484 [2019-09-16 16:17:58,239 INFO L226 Difference]: Without dead ends: 3322 [2019-09-16 16:17:58,247 INFO L636 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-09-16 16:17:58,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2019-09-16 16:17:58,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3306. [2019-09-16 16:17:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3306 states. [2019-09-16 16:17:58,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 4451 transitions. [2019-09-16 16:17:58,330 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 4451 transitions. Word has length 234 [2019-09-16 16:17:58,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:17:58,331 INFO L475 AbstractCegarLoop]: Abstraction has 3306 states and 4451 transitions. [2019-09-16 16:17:58,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:17:58,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 4451 transitions. [2019-09-16 16:17:58,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-16 16:17:58,338 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:17:58,339 INFO L407 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:17:58,339 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:17:58,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:17:58,339 INFO L82 PathProgramCache]: Analyzing trace with hash -736614694, now seen corresponding path program 1 times [2019-09-16 16:17:58,340 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:17:58,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:17:58,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:58,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:17:58,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:17:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-09-16 16:17:58,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:17:58,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:17:58,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:17:58,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:17:58,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:17:58,437 INFO L87 Difference]: Start difference. First operand 3306 states and 4451 transitions. Second operand 3 states. [2019-09-16 16:17:58,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:17:58,613 INFO L93 Difference]: Finished difference Result 7000 states and 9558 transitions. [2019-09-16 16:17:58,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:17:58,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-09-16 16:17:58,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:17:58,630 INFO L225 Difference]: With dead ends: 7000 [2019-09-16 16:17:58,630 INFO L226 Difference]: Without dead ends: 3706 [2019-09-16 16:17:58,637 INFO L636 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-09-16 16:17:58,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2019-09-16 16:17:58,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3618. [2019-09-16 16:17:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3618 states. [2019-09-16 16:17:58,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3618 states to 3618 states and 4819 transitions. [2019-09-16 16:17:58,724 INFO L78 Accepts]: Start accepts. Automaton has 3618 states and 4819 transitions. Word has length 245 [2019-09-16 16:17:58,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:17:58,725 INFO L475 AbstractCegarLoop]: Abstraction has 3618 states and 4819 transitions. [2019-09-16 16:17:58,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:17:58,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 4819 transitions. [2019-09-16 16:17:58,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-16 16:17:58,736 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:17:58,736 INFO L407 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:17:58,737 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:17:58,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:17:58,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1168177660, now seen corresponding path program 1 times [2019-09-16 16:17:58,737 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:17:58,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:17:58,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:58,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:17:58,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:17:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-09-16 16:17:58,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:17:58,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:17:58,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:17:58,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:17:58,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:17:58,863 INFO L87 Difference]: Start difference. First operand 3618 states and 4819 transitions. Second operand 3 states. [2019-09-16 16:17:59,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:17:59,057 INFO L93 Difference]: Finished difference Result 7632 states and 10102 transitions. [2019-09-16 16:17:59,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:17:59,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-09-16 16:17:59,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:17:59,095 INFO L225 Difference]: With dead ends: 7632 [2019-09-16 16:17:59,095 INFO L226 Difference]: Without dead ends: 4026 [2019-09-16 16:17:59,106 INFO L636 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-09-16 16:17:59,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4026 states. [2019-09-16 16:17:59,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4026 to 3738. [2019-09-16 16:17:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3738 states. [2019-09-16 16:17:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 4963 transitions. [2019-09-16 16:17:59,192 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 4963 transitions. Word has length 259 [2019-09-16 16:17:59,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:17:59,192 INFO L475 AbstractCegarLoop]: Abstraction has 3738 states and 4963 transitions. [2019-09-16 16:17:59,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:17:59,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 4963 transitions. [2019-09-16 16:17:59,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-16 16:17:59,201 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:17:59,202 INFO L407 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:17:59,202 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:17:59,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:17:59,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1227839833, now seen corresponding path program 1 times [2019-09-16 16:17:59,203 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:17:59,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:17:59,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:59,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:17:59,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:17:59,360 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-09-16 16:17:59,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:17:59,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:17:59,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:17:59,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:17:59,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:17:59,362 INFO L87 Difference]: Start difference. First operand 3738 states and 4963 transitions. Second operand 3 states. [2019-09-16 16:17:59,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:17:59,445 INFO L93 Difference]: Finished difference Result 10686 states and 14265 transitions. [2019-09-16 16:17:59,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:17:59,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-09-16 16:17:59,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:17:59,461 INFO L225 Difference]: With dead ends: 10686 [2019-09-16 16:17:59,461 INFO L226 Difference]: Without dead ends: 6960 [2019-09-16 16:17:59,469 INFO L636 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-09-16 16:17:59,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6960 states. [2019-09-16 16:17:59,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6960 to 6958. [2019-09-16 16:17:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6958 states. [2019-09-16 16:17:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6958 states to 6958 states and 9293 transitions. [2019-09-16 16:17:59,604 INFO L78 Accepts]: Start accepts. Automaton has 6958 states and 9293 transitions. Word has length 260 [2019-09-16 16:17:59,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:17:59,604 INFO L475 AbstractCegarLoop]: Abstraction has 6958 states and 9293 transitions. [2019-09-16 16:17:59,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:17:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 6958 states and 9293 transitions. [2019-09-16 16:17:59,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-16 16:17:59,616 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:17:59,617 INFO L407 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:17:59,617 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:17:59,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:17:59,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818967, now seen corresponding path program 1 times [2019-09-16 16:17:59,618 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:17:59,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:17:59,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:59,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:17:59,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:17:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:17:59,699 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2019-09-16 16:17:59,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:17:59,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:17:59,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:17:59,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:17:59,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:17:59,702 INFO L87 Difference]: Start difference. First operand 6958 states and 9293 transitions. Second operand 3 states. [2019-09-16 16:17:59,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:17:59,928 INFO L93 Difference]: Finished difference Result 13912 states and 18562 transitions. [2019-09-16 16:17:59,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:17:59,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-09-16 16:17:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:17:59,949 INFO L225 Difference]: With dead ends: 13912 [2019-09-16 16:17:59,949 INFO L226 Difference]: Without dead ends: 6966 [2019-09-16 16:17:59,965 INFO L636 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-09-16 16:17:59,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6966 states. [2019-09-16 16:18:00,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6966 to 6934. [2019-09-16 16:18:00,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6934 states. [2019-09-16 16:18:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6934 states to 6934 states and 9077 transitions. [2019-09-16 16:18:00,128 INFO L78 Accepts]: Start accepts. Automaton has 6934 states and 9077 transitions. Word has length 261 [2019-09-16 16:18:00,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:00,128 INFO L475 AbstractCegarLoop]: Abstraction has 6934 states and 9077 transitions. [2019-09-16 16:18:00,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 6934 states and 9077 transitions. [2019-09-16 16:18:00,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-16 16:18:00,143 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:00,144 INFO L407 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:18:00,144 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:00,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:00,145 INFO L82 PathProgramCache]: Analyzing trace with hash 747649846, now seen corresponding path program 1 times [2019-09-16 16:18:00,145 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:00,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:00,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:00,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:00,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:00,335 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 318 proven. 18 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-09-16 16:18:00,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:18:00,336 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:18:00,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:00,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-16 16:18:00,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:18:00,624 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2019-09-16 16:18:00,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:18:00,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-16 16:18:00,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:18:00,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:18:00,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:18:00,640 INFO L87 Difference]: Start difference. First operand 6934 states and 9077 transitions. Second operand 6 states. [2019-09-16 16:18:01,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:01,372 INFO L93 Difference]: Finished difference Result 17368 states and 22742 transitions. [2019-09-16 16:18:01,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 16:18:01,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 284 [2019-09-16 16:18:01,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:01,390 INFO L225 Difference]: With dead ends: 17368 [2019-09-16 16:18:01,390 INFO L226 Difference]: Without dead ends: 10410 [2019-09-16 16:18:01,401 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-16 16:18:01,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10410 states. [2019-09-16 16:18:01,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10410 to 8844. [2019-09-16 16:18:01,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8844 states. [2019-09-16 16:18:01,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8844 states to 8844 states and 11583 transitions. [2019-09-16 16:18:01,590 INFO L78 Accepts]: Start accepts. Automaton has 8844 states and 11583 transitions. Word has length 284 [2019-09-16 16:18:01,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:01,591 INFO L475 AbstractCegarLoop]: Abstraction has 8844 states and 11583 transitions. [2019-09-16 16:18:01,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:18:01,591 INFO L276 IsEmpty]: Start isEmpty. Operand 8844 states and 11583 transitions. [2019-09-16 16:18:01,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-16 16:18:01,611 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:01,611 INFO L407 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:18:01,612 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:01,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:01,613 INFO L82 PathProgramCache]: Analyzing trace with hash 280748442, now seen corresponding path program 1 times [2019-09-16 16:18:01,613 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:01,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:01,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:01,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:01,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:01,778 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 407 proven. 5 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-09-16 16:18:01,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:18:01,779 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-09-16 16:18:01,815 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-09-16 16:18:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:01,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-16 16:18:01,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:18:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2019-09-16 16:18:02,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:18:02,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-16 16:18:02,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:18:02,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:18:02,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:18:02,023 INFO L87 Difference]: Start difference. First operand 8844 states and 11583 transitions. Second operand 5 states. [2019-09-16 16:18:02,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:02,606 INFO L93 Difference]: Finished difference Result 20417 states and 26625 transitions. [2019-09-16 16:18:02,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:18:02,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 310 [2019-09-16 16:18:02,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:02,626 INFO L225 Difference]: With dead ends: 20417 [2019-09-16 16:18:02,627 INFO L226 Difference]: Without dead ends: 11583 [2019-09-16 16:18:02,642 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:18:02,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11583 states. [2019-09-16 16:18:02,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11583 to 9674. [2019-09-16 16:18:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9674 states. [2019-09-16 16:18:02,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9674 states to 9674 states and 12389 transitions. [2019-09-16 16:18:02,822 INFO L78 Accepts]: Start accepts. Automaton has 9674 states and 12389 transitions. Word has length 310 [2019-09-16 16:18:02,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:02,823 INFO L475 AbstractCegarLoop]: Abstraction has 9674 states and 12389 transitions. [2019-09-16 16:18:02,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:18:02,823 INFO L276 IsEmpty]: Start isEmpty. Operand 9674 states and 12389 transitions. [2019-09-16 16:18:02,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-09-16 16:18:02,843 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:02,843 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:18:02,843 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:02,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:02,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1592916915, now seen corresponding path program 1 times [2019-09-16 16:18:02,844 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:02,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:02,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:02,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:02,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 884 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-09-16 16:18:02,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:02,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:02,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:02,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:02,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:02,993 INFO L87 Difference]: Start difference. First operand 9674 states and 12389 transitions. Second operand 3 states. [2019-09-16 16:18:03,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:03,203 INFO L93 Difference]: Finished difference Result 18321 states and 23212 transitions. [2019-09-16 16:18:03,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:03,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 416 [2019-09-16 16:18:03,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:03,211 INFO L225 Difference]: With dead ends: 18321 [2019-09-16 16:18:03,211 INFO L226 Difference]: Without dead ends: 3877 [2019-09-16 16:18:03,236 INFO L636 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-09-16 16:18:03,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3877 states. [2019-09-16 16:18:03,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3877 to 3536. [2019-09-16 16:18:03,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3536 states. [2019-09-16 16:18:03,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 3536 states and 4402 transitions. [2019-09-16 16:18:03,361 INFO L78 Accepts]: Start accepts. Automaton has 3536 states and 4402 transitions. Word has length 416 [2019-09-16 16:18:03,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:03,361 INFO L475 AbstractCegarLoop]: Abstraction has 3536 states and 4402 transitions. [2019-09-16 16:18:03,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:03,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 4402 transitions. [2019-09-16 16:18:03,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-09-16 16:18:03,378 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:03,379 INFO L407 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:18:03,379 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:03,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:03,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1911375163, now seen corresponding path program 1 times [2019-09-16 16:18:03,380 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:03,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:03,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:03,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:03,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:03,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-09-16 16:18:03,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:18:03,548 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-09-16 16:18:03,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:03,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-16 16:18:03,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:18:03,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-09-16 16:18:03,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:18:03,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-16 16:18:03,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:18:03,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:18:03,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:18:03,846 INFO L87 Difference]: Start difference. First operand 3536 states and 4402 transitions. Second operand 4 states. [2019-09-16 16:18:04,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:04,085 INFO L93 Difference]: Finished difference Result 4032 states and 5027 transitions. [2019-09-16 16:18:04,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:18:04,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 447 [2019-09-16 16:18:04,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:04,086 INFO L225 Difference]: With dead ends: 4032 [2019-09-16 16:18:04,086 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 16:18:04,093 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 449 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-09-16 16:18:04,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 16:18:04,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 16:18:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 16:18:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 16:18:04,094 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 447 [2019-09-16 16:18:04,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:04,094 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 16:18:04,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:18:04,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 16:18:04,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 16:18:04,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-16 16:18:04,803 WARN L191 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 353 DAG size of output: 66 [2019-09-16 16:18:05,745 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-16 16:18:05,894 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-16 16:18:05,894 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:18:05,894 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-09-16 16:18:05,894 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2019-09-16 16:18:05,894 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 491) no Hoare annotation was computed. [2019-09-16 16:18:05,894 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 502) no Hoare annotation was computed. [2019-09-16 16:18:05,895 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 513) no Hoare annotation was computed. [2019-09-16 16:18:05,895 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2019-09-16 16:18:05,895 INFO L443 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2019-09-16 16:18:05,895 INFO L439 ceAbstractionStarter]: At program point L137(lines 133 503) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2019-09-16 16:18:05,895 INFO L446 ceAbstractionStarter]: At program point L534(lines 96 535) the Hoare annotation is: true [2019-09-16 16:18:05,896 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2019-09-16 16:18:05,896 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 240) no Hoare annotation was computed. [2019-09-16 16:18:05,896 INFO L443 ceAbstractionStarter]: For program point L270-2(lines 270 274) no Hoare annotation was computed. [2019-09-16 16:18:05,896 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 307) no Hoare annotation was computed. [2019-09-16 16:18:05,896 INFO L439 ceAbstractionStarter]: At program point L205(lines 103 513) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (<= ssl3_connect_~blastFlag~0 0) (and (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0))) [2019-09-16 16:18:05,896 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 490) no Hoare annotation was computed. [2019-09-16 16:18:05,896 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 501) no Hoare annotation was computed. [2019-09-16 16:18:05,896 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 512) no Hoare annotation was computed. [2019-09-16 16:18:05,897 INFO L439 ceAbstractionStarter]: At program point L173(lines 169 491) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560) (<= 4464 ssl3_connect_~s__state~0))) [2019-09-16 16:18:05,898 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2019-09-16 16:18:05,898 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 450) no Hoare annotation was computed. [2019-09-16 16:18:05,898 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 420) no Hoare annotation was computed. [2019-09-16 16:18:05,898 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 406 420) no Hoare annotation was computed. [2019-09-16 16:18:05,898 INFO L443 ceAbstractionStarter]: For program point L439-2(lines 439 450) no Hoare annotation was computed. [2019-09-16 16:18:05,899 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 489) no Hoare annotation was computed. [2019-09-16 16:18:05,899 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 500) no Hoare annotation was computed. [2019-09-16 16:18:05,899 INFO L443 ceAbstractionStarter]: For program point L109(lines 109 511) no Hoare annotation was computed. [2019-09-16 16:18:05,899 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 541) no Hoare annotation was computed. [2019-09-16 16:18:05,899 INFO L443 ceAbstractionStarter]: For program point L539-2(lines 539 541) no Hoare annotation was computed. [2019-09-16 16:18:05,899 INFO L439 ceAbstractionStarter]: At program point L143(lines 139 501) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2019-09-16 16:18:05,899 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 344) no Hoare annotation was computed. [2019-09-16 16:18:05,899 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 212) no Hoare annotation was computed. [2019-09-16 16:18:05,900 INFO L443 ceAbstractionStarter]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2019-09-16 16:18:05,900 INFO L443 ceAbstractionStarter]: For program point L376(lines 376 378) no Hoare annotation was computed. [2019-09-16 16:18:05,900 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 488) no Hoare annotation was computed. [2019-09-16 16:18:05,900 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 499) no Hoare annotation was computed. [2019-09-16 16:18:05,900 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 510) no Hoare annotation was computed. [2019-09-16 16:18:05,900 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 416) no Hoare annotation was computed. [2019-09-16 16:18:05,900 INFO L439 ceAbstractionStarter]: At program point L179(lines 175 489) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= ssl3_connect_~s__hit~0 0) .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1))) [2019-09-16 16:18:05,900 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2019-09-16 16:18:05,900 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 314) no Hoare annotation was computed. [2019-09-16 16:18:05,901 INFO L443 ceAbstractionStarter]: For program point L279-1(lines 279 289) no Hoare annotation was computed. [2019-09-16 16:18:05,901 INFO L439 ceAbstractionStarter]: At program point L313(lines 75 545) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2019-09-16 16:18:05,901 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 487) no Hoare annotation was computed. [2019-09-16 16:18:05,901 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 498) no Hoare annotation was computed. [2019-09-16 16:18:05,901 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 509) no Hoare annotation was computed. [2019-09-16 16:18:05,901 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2019-09-16 16:18:05,901 INFO L439 ceAbstractionStarter]: At program point L149(lines 145 499) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2))) [2019-09-16 16:18:05,902 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-09-16 16:18:05,902 INFO L439 ceAbstractionStarter]: At program point L480(lines 97 533) the Hoare annotation is: (let ((.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= 4352 ssl3_connect_~s__state~0)) (.cse7 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4512)) (.cse1 (= ssl3_connect_~s__state~0 4528)) (.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1) (and .cse2 (= ssl3_connect_~s__state~0 4480)) (and (= ssl3_connect_~s__state~0 4496) .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse3 .cse4) (and .cse5 .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse6 .cse3 .cse4 .cse2 .cse7) (and .cse6 .cse8 .cse2 .cse9 .cse7) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and (= 4464 ssl3_connect_~s__state~0) .cse2) (and .cse0 .cse8 .cse9) (and (<= ssl3_connect_~s__state~0 3) .cse6) (and .cse0 .cse5) (and .cse1 .cse2) (and .cse0 (= 4384 ssl3_connect_~s__state~0)) (and (<= ssl3_connect_~blastFlag~0 4) .cse2))) [2019-09-16 16:18:05,902 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2019-09-16 16:18:05,902 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 251) no Hoare annotation was computed. [2019-09-16 16:18:05,902 INFO L443 ceAbstractionStarter]: For program point L249-2(lines 200 479) no Hoare annotation was computed. [2019-09-16 16:18:05,902 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 546) the Hoare annotation is: true [2019-09-16 16:18:05,903 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 386) no Hoare annotation was computed. [2019-09-16 16:18:05,903 INFO L443 ceAbstractionStarter]: For program point L382-2(lines 200 479) no Hoare annotation was computed. [2019-09-16 16:18:05,903 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2019-09-16 16:18:05,905 INFO L443 ceAbstractionStarter]: For program point L283-2(lines 281 289) no Hoare annotation was computed. [2019-09-16 16:18:05,905 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 486) no Hoare annotation was computed. [2019-09-16 16:18:05,905 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 497) no Hoare annotation was computed. [2019-09-16 16:18:05,905 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 508) no Hoare annotation was computed. [2019-09-16 16:18:05,905 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 531) no Hoare annotation was computed. [2019-09-16 16:18:05,905 INFO L439 ceAbstractionStarter]: At program point L185(lines 181 487) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= ssl3_connect_~s__hit~0 0) .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1))) [2019-09-16 16:18:05,906 INFO L439 ceAbstractionStarter]: At program point L119(lines 115 509) the Hoare annotation is: (let ((.cse2 (<= ssl3_connect_~blastFlag~0 0)) (.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 .cse2 (= ssl3_connect_~s__state~0 4368)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse0 .cse1))) [2019-09-16 16:18:05,906 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-09-16 16:18:05,906 INFO L443 ceAbstractionStarter]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2019-09-16 16:18:05,906 INFO L443 ceAbstractionStarter]: For program point L516(lines 516 530) no Hoare annotation was computed. [2019-09-16 16:18:05,906 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2019-09-16 16:18:05,906 INFO L443 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2019-09-16 16:18:05,906 INFO L443 ceAbstractionStarter]: For program point L517-2(lines 516 530) no Hoare annotation was computed. [2019-09-16 16:18:05,906 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 485) no Hoare annotation was computed. [2019-09-16 16:18:05,907 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 496) no Hoare annotation was computed. [2019-09-16 16:18:05,907 INFO L443 ceAbstractionStarter]: For program point L121(lines 121 507) no Hoare annotation was computed. [2019-09-16 16:18:05,907 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 232) no Hoare annotation was computed. [2019-09-16 16:18:05,907 INFO L443 ceAbstractionStarter]: For program point L221-2(lines 200 479) no Hoare annotation was computed. [2019-09-16 16:18:05,907 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 521) no Hoare annotation was computed. [2019-09-16 16:18:05,907 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 543) no Hoare annotation was computed. [2019-09-16 16:18:05,907 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 360) no Hoare annotation was computed. [2019-09-16 16:18:05,908 INFO L443 ceAbstractionStarter]: For program point L355-2(lines 355 360) no Hoare annotation was computed. [2019-09-16 16:18:05,908 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 226) no Hoare annotation was computed. [2019-09-16 16:18:05,908 INFO L443 ceAbstractionStarter]: For program point L190(lines 190 484) no Hoare annotation was computed. [2019-09-16 16:18:05,908 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 495) no Hoare annotation was computed. [2019-09-16 16:18:05,908 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 506) no Hoare annotation was computed. [2019-09-16 16:18:05,908 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 95) no Hoare annotation was computed. [2019-09-16 16:18:05,908 INFO L443 ceAbstractionStarter]: For program point L455-1(lines 455 457) no Hoare annotation was computed. [2019-09-16 16:18:05,909 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 259) no Hoare annotation was computed. [2019-09-16 16:18:05,909 INFO L439 ceAbstractionStarter]: At program point L191(lines 187 485) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2))) [2019-09-16 16:18:05,909 INFO L439 ceAbstractionStarter]: At program point L125(lines 121 507) 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 2) .cse0 .cse1))) [2019-09-16 16:18:05,909 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 94) no Hoare annotation was computed. [2019-09-16 16:18:05,909 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 546) no Hoare annotation was computed. [2019-09-16 16:18:05,909 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-09-16 16:18:05,909 INFO L443 ceAbstractionStarter]: For program point L324-2(lines 200 479) no Hoare annotation was computed. [2019-09-16 16:18:05,909 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 546) no Hoare annotation was computed. [2019-09-16 16:18:05,910 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 394) no Hoare annotation was computed. [2019-09-16 16:18:05,910 INFO L443 ceAbstractionStarter]: For program point L193(lines 193 483) no Hoare annotation was computed. [2019-09-16 16:18:05,910 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 494) no Hoare annotation was computed. [2019-09-16 16:18:05,910 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 505) no Hoare annotation was computed. [2019-09-16 16:18:05,910 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 528) no Hoare annotation was computed. [2019-09-16 16:18:05,910 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-09-16 16:18:05,910 INFO L439 ceAbstractionStarter]: At program point L194(lines 193 483) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4) .cse2) (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) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1))) [2019-09-16 16:18:05,910 INFO L439 ceAbstractionStarter]: At program point L161(lines 151 497) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560) (<= 4464 ssl3_connect_~s__state~0))) [2019-09-16 16:18:05,911 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 428) no Hoare annotation was computed. [2019-09-16 16:18:05,911 INFO L443 ceAbstractionStarter]: For program point L196(lines 196 482) no Hoare annotation was computed. [2019-09-16 16:18:05,911 INFO L443 ceAbstractionStarter]: For program point L163(lines 163 493) no Hoare annotation was computed. [2019-09-16 16:18:05,911 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 504) no Hoare annotation was computed. [2019-09-16 16:18:05,911 INFO L443 ceAbstractionStarter]: For program point L97-1(lines 75 545) no Hoare annotation was computed. [2019-09-16 16:18:05,911 INFO L443 ceAbstractionStarter]: For program point L461(lines 461 463) no Hoare annotation was computed. [2019-09-16 16:18:05,911 INFO L443 ceAbstractionStarter]: For program point L461-2(lines 461 463) no Hoare annotation was computed. [2019-09-16 16:18:05,911 INFO L443 ceAbstractionStarter]: For program point L296(lines 296 298) no Hoare annotation was computed. [2019-09-16 16:18:05,911 INFO L443 ceAbstractionStarter]: For program point L296-2(lines 200 479) no Hoare annotation was computed. [2019-09-16 16:18:05,912 INFO L446 ceAbstractionStarter]: At program point L197(lines 196 482) the Hoare annotation is: true [2019-09-16 16:18:05,912 INFO L439 ceAbstractionStarter]: At program point L131(lines 127 505) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2019-09-16 16:18:05,912 INFO L443 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-09-16 16:18:05,912 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-09-16 16:18:05,912 INFO L443 ceAbstractionStarter]: For program point L429-2(lines 429 433) no Hoare annotation was computed. [2019-09-16 16:18:05,913 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 334) no Hoare annotation was computed. [2019-09-16 16:18:05,913 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2019-09-16 16:18:05,913 INFO L443 ceAbstractionStarter]: For program point L330-2(lines 330 334) no Hoare annotation was computed. [2019-09-16 16:18:05,913 INFO L443 ceAbstractionStarter]: For program point L264-2(lines 200 479) no Hoare annotation was computed. [2019-09-16 16:18:05,913 INFO L446 ceAbstractionStarter]: At program point L199(lines 198 482) the Hoare annotation is: true [2019-09-16 16:18:05,913 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 492) no Hoare annotation was computed. [2019-09-16 16:18:05,913 INFO L443 ceAbstractionStarter]: For program point L133(lines 133 503) no Hoare annotation was computed. [2019-09-16 16:18:05,914 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 514) no Hoare annotation was computed. [2019-09-16 16:18:05,914 INFO L439 ceAbstractionStarter]: At program point L167(lines 163 493) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560) (<= 4464 ssl3_connect_~s__state~0))) [2019-09-16 16:18:05,914 INFO L439 ceAbstractionStarter]: At program point L101(lines 100 514) the Hoare annotation is: (let ((.cse0 (<= 12292 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0)))) [2019-09-16 16:18:05,914 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:18:05,914 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-16 16:18:05,914 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-16 16:18:05,914 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:18:05,914 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 547 557) the Hoare annotation is: true [2019-09-16 16:18:05,915 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 547 557) no Hoare annotation was computed. [2019-09-16 16:18:05,915 INFO L446 ceAbstractionStarter]: At program point L553(line 553) the Hoare annotation is: true [2019-09-16 16:18:05,915 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 547 557) no Hoare annotation was computed. [2019-09-16 16:18:05,915 INFO L443 ceAbstractionStarter]: For program point L553-1(line 553) no Hoare annotation was computed. [2019-09-16 16:18:05,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 04:18:05 BoogieIcfgContainer [2019-09-16 16:18:05,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 16:18:05,954 INFO L168 Benchmark]: Toolchain (without parser) took 13642.85 ms. Allocated memory was 132.1 MB in the beginning and 735.6 MB in the end (delta: 603.5 MB). Free memory was 87.2 MB in the beginning and 333.4 MB in the end (delta: -246.2 MB). Peak memory consumption was 357.3 MB. Max. memory is 7.1 GB. [2019-09-16 16:18:05,954 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 132.1 MB. Free memory is still 106.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-16 16:18:05,955 INFO L168 Benchmark]: CACSL2BoogieTranslator took 471.03 ms. Allocated memory was 132.1 MB in the beginning and 200.8 MB in the end (delta: 68.7 MB). Free memory was 86.8 MB in the beginning and 174.1 MB in the end (delta: -87.3 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2019-09-16 16:18:05,956 INFO L168 Benchmark]: Boogie Preprocessor took 51.59 ms. Allocated memory is still 200.8 MB. Free memory was 174.1 MB in the beginning and 171.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-09-16 16:18:05,959 INFO L168 Benchmark]: RCFGBuilder took 720.08 ms. Allocated memory is still 200.8 MB. Free memory was 171.3 MB in the beginning and 126.5 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-09-16 16:18:05,960 INFO L168 Benchmark]: TraceAbstraction took 12395.95 ms. Allocated memory was 200.8 MB in the beginning and 735.6 MB in the end (delta: 534.8 MB). Free memory was 126.5 MB in the beginning and 333.4 MB in the end (delta: -206.8 MB). Peak memory consumption was 327.9 MB. Max. memory is 7.1 GB. [2019-09-16 16:18:05,969 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.46 ms. Allocated memory is still 132.1 MB. Free memory is still 106.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 471.03 ms. Allocated memory was 132.1 MB in the beginning and 200.8 MB in the end (delta: 68.7 MB). Free memory was 86.8 MB in the beginning and 174.1 MB in the end (delta: -87.3 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.59 ms. Allocated memory is still 200.8 MB. Free memory was 174.1 MB in the beginning and 171.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 720.08 ms. Allocated memory is still 200.8 MB. Free memory was 171.3 MB in the beginning and 126.5 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12395.95 ms. Allocated memory was 200.8 MB in the beginning and 735.6 MB in the end (delta: 534.8 MB). Free memory was 126.5 MB in the beginning and 333.4 MB in the end (delta: -206.8 MB). Peak memory consumption was 327.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: 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: 151]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state))) || (blastFlag <= 0 && s__state == 4368)) || (((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 2 && s__state == 4528) || (s__hit == 0 && s__state == 4480)) || (s__state == 4496 && s__hit == 0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (s__state == 4512 && 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__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || (4464 == s__state && s__hit == 0)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && s__state == 4512)) || (s__state == 4528 && s__hit == 0)) || (blastFlag <= 2 && 4384 == s__state)) || (blastFlag <= 4 && s__hit == 0) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state))) || (((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state)) || ((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || blastFlag <= 0) || (blastFlag <= 4 && s__hit == 0) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((s__state <= 4352 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (blastFlag <= 0 && 12292 <= s__state)) || ((12292 <= s__state && blastFlag <= 4) && s__hit == 0) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((4560 <= s__state && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state)) || ((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state) - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state))) || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 135 locations, 1 error locations. SAFE Result, 12.2s OverallTime, 23 OverallIterations, 18 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 4657 SDtfs, 1854 SDslu, 2919 SDs, 0 SdLazy, 2715 SolverSat, 460 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1125 GetRequests, 1088 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9674occurred in iteration=21, 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: 1.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 4400 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 341 NumberOfFragments, 518 HoareAnnotationTreeSize, 26 FomulaSimplifications, 21998 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 26 FomulaSimplificationsInter, 849 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 5339 NumberOfCodeBlocks, 5339 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 5313 ConstructedInterpolants, 0 QuantifiedInterpolants, 1856425 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1976 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 26 InterpolantComputations, 22 PerfectInterpolantSequences, 15819/15870 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...