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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_4.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:27:38,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:27:38,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:27:38,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:27:38,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:27:38,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:27:38,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:27:38,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:27:38,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:27:38,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:27:38,092 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:27:38,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:27:38,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:27:38,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:27:38,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:27:38,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:27:38,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:27:38,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:27:38,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:27:38,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:27:38,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:27:38,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:27:38,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:27:38,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:27:38,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:27:38,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:27:38,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:27:38,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:27:38,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:27:38,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:27:38,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:27:38,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:27:38,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:27:38,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:27:38,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:27:38,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:27:38,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:27:38,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:27:38,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:27:38,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:27:38,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:27:38,119 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:27:38,133 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:27:38,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:27:38,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:27:38,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:27:38,137 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:27:38,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:27:38,137 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:27:38,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:27:38,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:27:38,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:27:38,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:27:38,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:27:38,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:27:38,139 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:27:38,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:27:38,140 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:27:38,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:27:38,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:27:38,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:27:38,141 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:27:38,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:27:38,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:27:38,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:27:38,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:27:38,143 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:27:38,143 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:27:38,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:27:38,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:27:38,144 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:27:38,409 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:27:38,422 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:27:38,425 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:27:38,427 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:27:38,427 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:27:38,428 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_4.cil-1.c [2019-10-15 01:27:38,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8caa22c4/0e5d7772fe584f3fa4df66019cbee9f1/FLAG340cb5d73 [2019-10-15 01:27:38,913 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:27:38,914 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_4.cil-1.c [2019-10-15 01:27:38,924 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8caa22c4/0e5d7772fe584f3fa4df66019cbee9f1/FLAG340cb5d73 [2019-10-15 01:27:39,227 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8caa22c4/0e5d7772fe584f3fa4df66019cbee9f1 [2019-10-15 01:27:39,237 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:27:39,238 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:27:39,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:27:39,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:27:39,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:27:39,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:27:39" (1/1) ... [2019-10-15 01:27:39,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350b2bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:39, skipping insertion in model container [2019-10-15 01:27:39,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:27:39" (1/1) ... [2019-10-15 01:27:39,253 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:27:39,306 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:27:39,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:27:39,556 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:27:39,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:27:39,759 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:27:39,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:39 WrapperNode [2019-10-15 01:27:39,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:27:39,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:27:39,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:27:39,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:27:39,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:39" (1/1) ... [2019-10-15 01:27:39,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:39" (1/1) ... [2019-10-15 01:27:39,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:39" (1/1) ... [2019-10-15 01:27:39,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:39" (1/1) ... [2019-10-15 01:27:39,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:39" (1/1) ... [2019-10-15 01:27:39,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:39" (1/1) ... [2019-10-15 01:27:39,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:39" (1/1) ... [2019-10-15 01:27:39,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:27:39,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:27:39,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:27:39,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:27:39,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:27:39,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:27:39,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:27:39,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-15 01:27:39,881 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:27:39,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:27:39,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:27:39,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:27:39,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 01:27:39,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 01:27:39,882 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-15 01:27:39,882 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:27:39,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:27:39,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:27:40,121 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:27:40,568 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-15 01:27:40,568 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-15 01:27:40,582 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:27:40,583 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:27:40,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:27:40 BoogieIcfgContainer [2019-10-15 01:27:40,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:27:40,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:27:40,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:27:40,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:27:40,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:27:39" (1/3) ... [2019-10-15 01:27:40,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de6e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:27:40, skipping insertion in model container [2019-10-15 01:27:40,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:39" (2/3) ... [2019-10-15 01:27:40,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de6e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:27:40, skipping insertion in model container [2019-10-15 01:27:40,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:27:40" (3/3) ... [2019-10-15 01:27:40,603 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil-1.c [2019-10-15 01:27:40,615 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:27:40,624 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:27:40,635 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:27:40,660 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:27:40,661 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:27:40,661 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:27:40,661 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:27:40,661 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:27:40,661 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:27:40,662 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:27:40,662 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:27:40,682 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2019-10-15 01:27:40,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:27:40,691 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:40,692 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:40,694 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:40,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:40,699 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2019-10-15 01:27:40,705 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:40,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244867364] [2019-10-15 01:27:40,706 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:40,706 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:40,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:40,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:40,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244867364] [2019-10-15 01:27:40,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:40,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:40,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431409214] [2019-10-15 01:27:40,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:40,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:40,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:40,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:40,964 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2019-10-15 01:27:41,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:41,079 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2019-10-15 01:27:41,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:41,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-15 01:27:41,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:41,096 INFO L225 Difference]: With dead ends: 377 [2019-10-15 01:27:41,096 INFO L226 Difference]: Without dead ends: 220 [2019-10-15 01:27:41,101 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-15 01:27:41,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-10-15 01:27:41,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-15 01:27:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2019-10-15 01:27:41,168 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2019-10-15 01:27:41,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:41,169 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2019-10-15 01:27:41,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:41,169 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2019-10-15 01:27:41,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 01:27:41,172 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:41,172 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:41,173 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:41,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:41,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1098416379, now seen corresponding path program 1 times [2019-10-15 01:27:41,174 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:41,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164376974] [2019-10-15 01:27:41,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:41,314 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:41,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164376974] [2019-10-15 01:27:41,316 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:41,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:41,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126671803] [2019-10-15 01:27:41,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:41,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:41,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:41,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,319 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2019-10-15 01:27:41,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:41,505 INFO L93 Difference]: Finished difference Result 470 states and 707 transitions. [2019-10-15 01:27:41,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:41,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-15 01:27:41,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:41,508 INFO L225 Difference]: With dead ends: 470 [2019-10-15 01:27:41,509 INFO L226 Difference]: Without dead ends: 262 [2019-10-15 01:27:41,511 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-15 01:27:41,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2019-10-15 01:27:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-10-15 01:27:41,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2019-10-15 01:27:41,546 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2019-10-15 01:27:41,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:41,547 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2019-10-15 01:27:41,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2019-10-15 01:27:41,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:27:41,554 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:41,554 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:41,554 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:41,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:41,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1578262845, now seen corresponding path program 1 times [2019-10-15 01:27:41,555 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:41,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881610468] [2019-10-15 01:27:41,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:27:41,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881610468] [2019-10-15 01:27:41,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:41,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:41,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093426047] [2019-10-15 01:27:41,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:41,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:41,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:41,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,712 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2019-10-15 01:27:41,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:41,932 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2019-10-15 01:27:41,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:41,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-15 01:27:41,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:41,936 INFO L225 Difference]: With dead ends: 598 [2019-10-15 01:27:41,936 INFO L226 Difference]: Without dead ends: 354 [2019-10-15 01:27:41,938 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-15 01:27:41,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2019-10-15 01:27:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-15 01:27:41,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2019-10-15 01:27:41,956 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2019-10-15 01:27:41,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:41,956 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2019-10-15 01:27:41,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:41,956 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2019-10-15 01:27:41,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:27:41,959 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:41,959 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:41,960 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:41,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:41,960 INFO L82 PathProgramCache]: Analyzing trace with hash -227175489, now seen corresponding path program 1 times [2019-10-15 01:27:41,960 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:41,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551870821] [2019-10-15 01:27:41,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:27:42,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551870821] [2019-10-15 01:27:42,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:42,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:42,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601281826] [2019-10-15 01:27:42,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:42,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:42,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:42,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,044 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2019-10-15 01:27:42,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:42,188 INFO L93 Difference]: Finished difference Result 710 states and 1008 transitions. [2019-10-15 01:27:42,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:42,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-15 01:27:42,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:42,192 INFO L225 Difference]: With dead ends: 710 [2019-10-15 01:27:42,192 INFO L226 Difference]: Without dead ends: 386 [2019-10-15 01:27:42,199 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-10-15 01:27:42,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 374. [2019-10-15 01:27:42,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-10-15 01:27:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2019-10-15 01:27:42,223 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2019-10-15 01:27:42,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:42,224 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2019-10-15 01:27:42,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:42,224 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2019-10-15 01:27:42,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-15 01:27:42,234 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:42,235 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:42,235 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:42,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:42,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1103228957, now seen corresponding path program 1 times [2019-10-15 01:27:42,236 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:42,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538517514] [2019-10-15 01:27:42,237 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,237 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:42,345 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:27:42,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538517514] [2019-10-15 01:27:42,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:42,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:42,347 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559122596] [2019-10-15 01:27:42,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:42,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:42,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:42,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,348 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2019-10-15 01:27:42,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:42,516 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2019-10-15 01:27:42,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:42,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-15 01:27:42,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:42,520 INFO L225 Difference]: With dead ends: 842 [2019-10-15 01:27:42,520 INFO L226 Difference]: Without dead ends: 478 [2019-10-15 01:27:42,521 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-10-15 01:27:42,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2019-10-15 01:27:42,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-15 01:27:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2019-10-15 01:27:42,544 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2019-10-15 01:27:42,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:42,544 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2019-10-15 01:27:42,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:42,545 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2019-10-15 01:27:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-15 01:27:42,548 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:42,548 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:42,549 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:42,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:42,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1629529054, now seen corresponding path program 1 times [2019-10-15 01:27:42,550 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:42,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001546960] [2019-10-15 01:27:42,550 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,550 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-15 01:27:42,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001546960] [2019-10-15 01:27:42,620 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:42,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:42,621 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597889039] [2019-10-15 01:27:42,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:42,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:42,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:42,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,622 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2019-10-15 01:27:42,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:42,750 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2019-10-15 01:27:42,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:42,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-15 01:27:42,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:42,757 INFO L225 Difference]: With dead ends: 940 [2019-10-15 01:27:42,759 INFO L226 Difference]: Without dead ends: 500 [2019-10-15 01:27:42,762 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-10-15 01:27:42,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2019-10-15 01:27:42,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-10-15 01:27:42,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2019-10-15 01:27:42,783 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2019-10-15 01:27:42,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:42,793 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2019-10-15 01:27:42,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:42,793 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2019-10-15 01:27:42,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 01:27:42,796 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:42,796 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:42,797 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:42,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:42,797 INFO L82 PathProgramCache]: Analyzing trace with hash -233915046, now seen corresponding path program 1 times [2019-10-15 01:27:42,797 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:42,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475756291] [2019-10-15 01:27:42,798 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,798 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:42,884 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:27:42,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475756291] [2019-10-15 01:27:42,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:42,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:42,885 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046658713] [2019-10-15 01:27:42,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:42,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:42,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:42,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,888 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2019-10-15 01:27:42,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:42,930 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2019-10-15 01:27:42,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:42,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-15 01:27:42,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:42,935 INFO L225 Difference]: With dead ends: 976 [2019-10-15 01:27:42,935 INFO L226 Difference]: Without dead ends: 734 [2019-10-15 01:27:42,936 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-10-15 01:27:42,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2019-10-15 01:27:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2019-10-15 01:27:42,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2019-10-15 01:27:42,957 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2019-10-15 01:27:42,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:42,957 INFO L462 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2019-10-15 01:27:42,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:42,958 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2019-10-15 01:27:42,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-15 01:27:42,959 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:42,960 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:42,960 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:42,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:42,960 INFO L82 PathProgramCache]: Analyzing trace with hash -674483159, now seen corresponding path program 1 times [2019-10-15 01:27:42,960 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:42,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304824942] [2019-10-15 01:27:42,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-15 01:27:43,050 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304824942] [2019-10-15 01:27:43,050 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:43,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:43,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271728322] [2019-10-15 01:27:43,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:43,051 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:43,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:43,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,052 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2019-10-15 01:27:43,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:43,090 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2019-10-15 01:27:43,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:43,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-15 01:27:43,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:43,095 INFO L225 Difference]: With dead ends: 976 [2019-10-15 01:27:43,095 INFO L226 Difference]: Without dead ends: 974 [2019-10-15 01:27:43,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-10-15 01:27:43,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2019-10-15 01:27:43,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-10-15 01:27:43,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2019-10-15 01:27:43,122 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2019-10-15 01:27:43,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:43,122 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2019-10-15 01:27:43,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:43,122 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2019-10-15 01:27:43,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-15 01:27:43,125 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:43,125 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 3, 3, 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] [2019-10-15 01:27:43,126 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:43,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:43,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2095197958, now seen corresponding path program 1 times [2019-10-15 01:27:43,126 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:43,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750591151] [2019-10-15 01:27:43,127 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,127 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:43,179 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-15 01:27:43,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750591151] [2019-10-15 01:27:43,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:43,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:43,181 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569961443] [2019-10-15 01:27:43,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:43,182 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:43,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:43,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,182 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2019-10-15 01:27:43,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:43,342 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2019-10-15 01:27:43,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:43,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-10-15 01:27:43,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:43,348 INFO L225 Difference]: With dead ends: 2140 [2019-10-15 01:27:43,349 INFO L226 Difference]: Without dead ends: 1170 [2019-10-15 01:27:43,351 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-10-15 01:27:43,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2019-10-15 01:27:43,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-10-15 01:27:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2019-10-15 01:27:43,383 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 139 [2019-10-15 01:27:43,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:43,383 INFO L462 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2019-10-15 01:27:43,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:43,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2019-10-15 01:27:43,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-15 01:27:43,387 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:43,388 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:43,388 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:43,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:43,388 INFO L82 PathProgramCache]: Analyzing trace with hash -2111242741, now seen corresponding path program 1 times [2019-10-15 01:27:43,388 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:43,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749746466] [2019-10-15 01:27:43,389 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:43,473 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-15 01:27:43,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749746466] [2019-10-15 01:27:43,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:43,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:43,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709320060] [2019-10-15 01:27:43,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:43,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:43,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:43,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,476 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2019-10-15 01:27:43,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:43,624 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2019-10-15 01:27:43,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:43,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-10-15 01:27:43,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:43,633 INFO L225 Difference]: With dead ends: 2354 [2019-10-15 01:27:43,633 INFO L226 Difference]: Without dead ends: 1236 [2019-10-15 01:27:43,635 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2019-10-15 01:27:43,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2019-10-15 01:27:43,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-10-15 01:27:43,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2019-10-15 01:27:43,679 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 175 [2019-10-15 01:27:43,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:43,680 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2019-10-15 01:27:43,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:43,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2019-10-15 01:27:43,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-15 01:27:43,685 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:43,686 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:43,686 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:43,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:43,687 INFO L82 PathProgramCache]: Analyzing trace with hash 834252520, now seen corresponding path program 1 times [2019-10-15 01:27:43,687 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:43,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762929783] [2019-10-15 01:27:43,687 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:43,780 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-10-15 01:27:43,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762929783] [2019-10-15 01:27:43,780 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:43,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:43,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999657521] [2019-10-15 01:27:43,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:43,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:43,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:43,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,783 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2019-10-15 01:27:43,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:43,950 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2019-10-15 01:27:43,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:43,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-15 01:27:43,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:43,958 INFO L225 Difference]: With dead ends: 2544 [2019-10-15 01:27:43,958 INFO L226 Difference]: Without dead ends: 1334 [2019-10-15 01:27:43,961 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-10-15 01:27:44,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2019-10-15 01:27:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-10-15 01:27:44,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2019-10-15 01:27:44,011 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 196 [2019-10-15 01:27:44,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:44,012 INFO L462 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2019-10-15 01:27:44,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2019-10-15 01:27:44,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-15 01:27:44,016 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:44,016 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2019-10-15 01:27:44,016 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:44,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:44,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1654542421, now seen corresponding path program 1 times [2019-10-15 01:27:44,017 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:44,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54385539] [2019-10-15 01:27:44,017 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:44,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:44,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2019-10-15 01:27:44,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54385539] [2019-10-15 01:27:44,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:44,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:44,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418875122] [2019-10-15 01:27:44,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:44,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:44,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:44,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:44,097 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2019-10-15 01:27:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:44,238 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2019-10-15 01:27:44,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:44,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-10-15 01:27:44,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:44,248 INFO L225 Difference]: With dead ends: 2752 [2019-10-15 01:27:44,248 INFO L226 Difference]: Without dead ends: 1442 [2019-10-15 01:27:44,252 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:44,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-10-15 01:27:44,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2019-10-15 01:27:44,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-10-15 01:27:44,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2019-10-15 01:27:44,306 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 220 [2019-10-15 01:27:44,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:44,307 INFO L462 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2019-10-15 01:27:44,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:44,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2019-10-15 01:27:44,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-15 01:27:44,314 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:44,314 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2019-10-15 01:27:44,315 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:44,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:44,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1609383977, now seen corresponding path program 1 times [2019-10-15 01:27:44,316 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:44,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389639893] [2019-10-15 01:27:44,316 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:44,316 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:44,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2019-10-15 01:27:44,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389639893] [2019-10-15 01:27:44,491 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:44,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:44,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135822737] [2019-10-15 01:27:44,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:44,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:44,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:44,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:44,494 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2019-10-15 01:27:44,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:44,653 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2019-10-15 01:27:44,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:44,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-10-15 01:27:44,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:44,661 INFO L225 Difference]: With dead ends: 2992 [2019-10-15 01:27:44,662 INFO L226 Difference]: Without dead ends: 1570 [2019-10-15 01:27:44,664 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:44,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-10-15 01:27:44,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2019-10-15 01:27:44,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-10-15 01:27:44,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2019-10-15 01:27:44,704 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 220 [2019-10-15 01:27:44,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:44,705 INFO L462 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2019-10-15 01:27:44,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:44,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2019-10-15 01:27:44,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-15 01:27:44,710 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:44,711 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:44,711 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:44,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:44,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1500640469, now seen corresponding path program 1 times [2019-10-15 01:27:44,712 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:44,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624875268] [2019-10-15 01:27:44,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:44,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:44,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:44,807 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-10-15 01:27:44,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624875268] [2019-10-15 01:27:44,807 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:44,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:44,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379002756] [2019-10-15 01:27:44,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:44,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:44,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:44,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:44,809 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2019-10-15 01:27:44,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:44,870 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2019-10-15 01:27:44,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:44,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-10-15 01:27:44,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:44,890 INFO L225 Difference]: With dead ends: 4646 [2019-10-15 01:27:44,890 INFO L226 Difference]: Without dead ends: 3100 [2019-10-15 01:27:44,895 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:44,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2019-10-15 01:27:45,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2019-10-15 01:27:45,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2019-10-15 01:27:45,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2019-10-15 01:27:45,043 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 250 [2019-10-15 01:27:45,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:45,044 INFO L462 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2019-10-15 01:27:45,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2019-10-15 01:27:45,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-15 01:27:45,052 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:45,052 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:45,053 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:45,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:45,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1763285929, now seen corresponding path program 1 times [2019-10-15 01:27:45,053 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:45,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893716643] [2019-10-15 01:27:45,054 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:45,054 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:45,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:45,157 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-10-15 01:27:45,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893716643] [2019-10-15 01:27:45,157 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:45,157 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:45,158 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102482612] [2019-10-15 01:27:45,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:45,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:45,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:45,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:45,159 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2019-10-15 01:27:45,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:45,329 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2019-10-15 01:27:45,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:45,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-10-15 01:27:45,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:45,348 INFO L225 Difference]: With dead ends: 6484 [2019-10-15 01:27:45,348 INFO L226 Difference]: Without dead ends: 3398 [2019-10-15 01:27:45,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:45,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-10-15 01:27:45,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2019-10-15 01:27:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2019-10-15 01:27:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2019-10-15 01:27:45,441 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 250 [2019-10-15 01:27:45,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:45,441 INFO L462 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2019-10-15 01:27:45,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2019-10-15 01:27:45,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-15 01:27:45,450 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:45,450 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:45,451 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:45,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:45,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1165577599, now seen corresponding path program 1 times [2019-10-15 01:27:45,451 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:45,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929737435] [2019-10-15 01:27:45,452 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:45,452 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:45,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2019-10-15 01:27:45,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929737435] [2019-10-15 01:27:45,590 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:45,590 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:45,590 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075190104] [2019-10-15 01:27:45,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:45,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:45,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:45,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:45,592 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2019-10-15 01:27:45,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:45,853 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2019-10-15 01:27:45,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:45,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-10-15 01:27:45,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:45,879 INFO L225 Difference]: With dead ends: 6900 [2019-10-15 01:27:45,879 INFO L226 Difference]: Without dead ends: 3530 [2019-10-15 01:27:45,889 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:45,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2019-10-15 01:27:46,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2019-10-15 01:27:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2019-10-15 01:27:46,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2019-10-15 01:27:46,043 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 274 [2019-10-15 01:27:46,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:46,044 INFO L462 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2019-10-15 01:27:46,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2019-10-15 01:27:46,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-10-15 01:27:46,060 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:46,060 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:46,061 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:46,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:46,061 INFO L82 PathProgramCache]: Analyzing trace with hash -373875199, now seen corresponding path program 1 times [2019-10-15 01:27:46,062 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:46,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953844837] [2019-10-15 01:27:46,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:46,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:46,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2019-10-15 01:27:46,345 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953844837] [2019-10-15 01:27:46,345 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:46,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:46,346 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260684276] [2019-10-15 01:27:46,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:46,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:46,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:46,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:46,348 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2019-10-15 01:27:46,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:46,642 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2019-10-15 01:27:46,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:46,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2019-10-15 01:27:46,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:46,662 INFO L225 Difference]: With dead ends: 7416 [2019-10-15 01:27:46,662 INFO L226 Difference]: Without dead ends: 3914 [2019-10-15 01:27:46,670 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:46,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2019-10-15 01:27:46,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2019-10-15 01:27:46,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2019-10-15 01:27:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2019-10-15 01:27:46,781 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 285 [2019-10-15 01:27:46,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:46,782 INFO L462 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2019-10-15 01:27:46,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2019-10-15 01:27:46,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-10-15 01:27:46,791 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:46,791 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:46,792 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:46,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:46,792 INFO L82 PathProgramCache]: Analyzing trace with hash -233584477, now seen corresponding path program 1 times [2019-10-15 01:27:46,792 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:46,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802221240] [2019-10-15 01:27:46,793 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:46,793 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:46,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-10-15 01:27:46,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802221240] [2019-10-15 01:27:46,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:46,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:46,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957238991] [2019-10-15 01:27:46,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:46,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:46,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:46,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:46,911 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2019-10-15 01:27:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:47,116 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2019-10-15 01:27:47,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:47,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2019-10-15 01:27:47,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:47,153 INFO L225 Difference]: With dead ends: 8048 [2019-10-15 01:27:47,154 INFO L226 Difference]: Without dead ends: 4234 [2019-10-15 01:27:47,162 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:47,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2019-10-15 01:27:47,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2019-10-15 01:27:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2019-10-15 01:27:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2019-10-15 01:27:47,290 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 299 [2019-10-15 01:27:47,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:47,291 INFO L462 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2019-10-15 01:27:47,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:47,291 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2019-10-15 01:27:47,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-15 01:27:47,301 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:47,301 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:47,302 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:47,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:47,302 INFO L82 PathProgramCache]: Analyzing trace with hash -110745964, now seen corresponding path program 1 times [2019-10-15 01:27:47,302 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:47,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847328848] [2019-10-15 01:27:47,303 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:47,303 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:47,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:47,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2019-10-15 01:27:47,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847328848] [2019-10-15 01:27:47,471 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:47,471 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:47,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870416432] [2019-10-15 01:27:47,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:47,474 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:47,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:47,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:47,474 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2019-10-15 01:27:47,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:47,576 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2019-10-15 01:27:47,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:47,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-10-15 01:27:47,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:47,605 INFO L225 Difference]: With dead ends: 11310 [2019-10-15 01:27:47,605 INFO L226 Difference]: Without dead ends: 7376 [2019-10-15 01:27:47,618 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:47,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2019-10-15 01:27:47,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2019-10-15 01:27:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2019-10-15 01:27:47,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2019-10-15 01:27:47,856 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 300 [2019-10-15 01:27:47,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:47,857 INFO L462 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2019-10-15 01:27:47,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:47,857 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2019-10-15 01:27:47,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-10-15 01:27:47,871 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:47,872 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:47,872 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:47,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:47,872 INFO L82 PathProgramCache]: Analyzing trace with hash 123119806, now seen corresponding path program 1 times [2019-10-15 01:27:47,873 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:47,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277092198] [2019-10-15 01:27:47,873 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:47,874 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:47,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:48,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2019-10-15 01:27:48,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277092198] [2019-10-15 01:27:48,131 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:48,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:48,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886544833] [2019-10-15 01:27:48,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:48,133 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:48,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:48,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:48,133 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2019-10-15 01:27:48,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:48,355 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2019-10-15 01:27:48,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:48,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2019-10-15 01:27:48,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:48,373 INFO L225 Difference]: With dead ends: 14744 [2019-10-15 01:27:48,373 INFO L226 Difference]: Without dead ends: 7382 [2019-10-15 01:27:48,389 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:48,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-10-15 01:27:48,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2019-10-15 01:27:48,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2019-10-15 01:27:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2019-10-15 01:27:48,561 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 301 [2019-10-15 01:27:48,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:48,562 INFO L462 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2019-10-15 01:27:48,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:48,562 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2019-10-15 01:27:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-10-15 01:27:48,576 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:48,576 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:48,576 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:48,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:48,577 INFO L82 PathProgramCache]: Analyzing trace with hash -994522767, now seen corresponding path program 1 times [2019-10-15 01:27:48,577 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:48,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647986895] [2019-10-15 01:27:48,577 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:48,577 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:48,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 637 proven. 14 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2019-10-15 01:27:48,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647986895] [2019-10-15 01:27:48,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475852664] [2019-10-15 01:27:48,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:48,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-15 01:27:48,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:49,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1097 trivial. 0 not checked. [2019-10-15 01:27:49,156 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:49,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1097 trivial. 0 not checked. [2019-10-15 01:27:49,324 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:27:49,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [4] total 10 [2019-10-15 01:27:49,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839424425] [2019-10-15 01:27:49,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:27:49,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:49,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:27:49,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:27:49,329 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 8 states. [2019-10-15 01:27:49,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:49,813 INFO L93 Difference]: Finished difference Result 14914 states and 19435 transitions. [2019-10-15 01:27:49,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:27:49,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 324 [2019-10-15 01:27:49,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:49,831 INFO L225 Difference]: With dead ends: 14914 [2019-10-15 01:27:49,831 INFO L226 Difference]: Without dead ends: 7548 [2019-10-15 01:27:49,846 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:27:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7548 states. [2019-10-15 01:27:50,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7548 to 7356. [2019-10-15 01:27:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7356 states. [2019-10-15 01:27:50,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 9581 transitions. [2019-10-15 01:27:50,110 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 9581 transitions. Word has length 324 [2019-10-15 01:27:50,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:50,110 INFO L462 AbstractCegarLoop]: Abstraction has 7356 states and 9581 transitions. [2019-10-15 01:27:50,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:27:50,110 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 9581 transitions. [2019-10-15 01:27:50,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-10-15 01:27:50,131 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:50,131 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:50,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:50,337 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:50,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:50,338 INFO L82 PathProgramCache]: Analyzing trace with hash -697717157, now seen corresponding path program 1 times [2019-10-15 01:27:50,338 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:50,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115964619] [2019-10-15 01:27:50,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:50,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:50,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-10-15 01:27:50,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115964619] [2019-10-15 01:27:50,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885326244] [2019-10-15 01:27:50,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:50,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:27:50,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-10-15 01:27:50,901 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-10-15 01:27:50,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1467680051] [2019-10-15 01:27:50,998 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 338 [2019-10-15 01:27:51,083 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:27:51,083 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:27:51,430 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:27:53,122 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:27:53,125 INFO L272 AbstractInterpreter]: Visited 110 different actions 2213 times. Merged at 100 different actions 1796 times. Widened at 22 different actions 217 times. Performed 5691 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5691 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 290 fixpoints after 37 different actions. Largest state had 105 variables. [2019-10-15 01:27:53,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:53,132 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:27:53,132 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:27:53,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:27:53,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390840947] [2019-10-15 01:27:53,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:27:53,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:53,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:27:53,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:53,135 INFO L87 Difference]: Start difference. First operand 7356 states and 9581 transitions. Second operand 6 states. [2019-10-15 01:27:54,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:54,010 INFO L93 Difference]: Finished difference Result 14768 states and 19241 transitions. [2019-10-15 01:27:54,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:27:54,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 337 [2019-10-15 01:27:54,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:54,043 INFO L225 Difference]: With dead ends: 14768 [2019-10-15 01:27:54,043 INFO L226 Difference]: Without dead ends: 11178 [2019-10-15 01:27:54,056 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 675 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:27:54,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11178 states. [2019-10-15 01:27:54,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11178 to 8460. [2019-10-15 01:27:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2019-10-15 01:27:54,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2019-10-15 01:27:54,339 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 337 [2019-10-15 01:27:54,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:54,340 INFO L462 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2019-10-15 01:27:54,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:27:54,341 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2019-10-15 01:27:54,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-10-15 01:27:54,367 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:54,367 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:54,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:54,573 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:54,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:54,573 INFO L82 PathProgramCache]: Analyzing trace with hash 233855425, now seen corresponding path program 2 times [2019-10-15 01:27:54,573 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:54,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359132511] [2019-10-15 01:27:54,574 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:54,574 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:54,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 714 proven. 5 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-10-15 01:27:54,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359132511] [2019-10-15 01:27:54,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343461023] [2019-10-15 01:27:54,737 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:54,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-15 01:27:54,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:27:54,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:27:54,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:54,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2019-10-15 01:27:54,913 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2019-10-15 01:27:55,024 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:27:55,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-10-15 01:27:55,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335384793] [2019-10-15 01:27:55,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:27:55,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:55,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:27:55,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:55,026 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 4 states. [2019-10-15 01:27:55,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:55,320 INFO L93 Difference]: Finished difference Result 17182 states and 22474 transitions. [2019-10-15 01:27:55,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:27:55,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 350 [2019-10-15 01:27:55,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:55,338 INFO L225 Difference]: With dead ends: 17182 [2019-10-15 01:27:55,338 INFO L226 Difference]: Without dead ends: 8740 [2019-10-15 01:27:55,354 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 699 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:55,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8740 states. [2019-10-15 01:27:55,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8740 to 7884. [2019-10-15 01:27:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7884 states. [2019-10-15 01:27:55,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7884 states to 7884 states and 9925 transitions. [2019-10-15 01:27:55,528 INFO L78 Accepts]: Start accepts. Automaton has 7884 states and 9925 transitions. Word has length 350 [2019-10-15 01:27:55,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:55,529 INFO L462 AbstractCegarLoop]: Abstraction has 7884 states and 9925 transitions. [2019-10-15 01:27:55,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:27:55,529 INFO L276 IsEmpty]: Start isEmpty. Operand 7884 states and 9925 transitions. [2019-10-15 01:27:55,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-10-15 01:27:55,544 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:55,545 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 01:27:55,749 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:55,749 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:55,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:55,750 INFO L82 PathProgramCache]: Analyzing trace with hash -382228618, now seen corresponding path program 1 times [2019-10-15 01:27:55,750 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:55,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076861882] [2019-10-15 01:27:55,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:55,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:55,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-15 01:27:55,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076861882] [2019-10-15 01:27:55,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715513349] [2019-10-15 01:27:55,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:56,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:27:56,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:56,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-15 01:27:56,131 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:56,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-15 01:27:56,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [756203498] [2019-10-15 01:27:56,312 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 382 [2019-10-15 01:27:56,317 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:27:56,318 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:27:56,362 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:27:58,049 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:27:58,050 INFO L272 AbstractInterpreter]: Visited 112 different actions 2547 times. Merged at 100 different actions 2054 times. Widened at 20 different actions 245 times. Performed 6444 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6444 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 361 fixpoints after 40 different actions. Largest state had 105 variables. [2019-10-15 01:27:58,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:58,051 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:27:58,052 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:27:58,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:27:58,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446995196] [2019-10-15 01:27:58,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:27:58,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:58,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:27:58,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:58,057 INFO L87 Difference]: Start difference. First operand 7884 states and 9925 transitions. Second operand 6 states. [2019-10-15 01:27:58,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:58,523 INFO L93 Difference]: Finished difference Result 17918 states and 22458 transitions. [2019-10-15 01:27:58,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:58,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 381 [2019-10-15 01:27:58,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:58,542 INFO L225 Difference]: With dead ends: 17918 [2019-10-15 01:27:58,543 INFO L226 Difference]: Without dead ends: 10044 [2019-10-15 01:27:58,561 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 767 GetRequests, 762 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:27:58,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10044 states. [2019-10-15 01:27:58,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10044 to 8293. [2019-10-15 01:27:58,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8293 states. [2019-10-15 01:27:58,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8293 states to 8293 states and 10415 transitions. [2019-10-15 01:27:58,711 INFO L78 Accepts]: Start accepts. Automaton has 8293 states and 10415 transitions. Word has length 381 [2019-10-15 01:27:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:58,712 INFO L462 AbstractCegarLoop]: Abstraction has 8293 states and 10415 transitions. [2019-10-15 01:27:58,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:27:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 8293 states and 10415 transitions. [2019-10-15 01:27:58,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-10-15 01:27:58,738 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:58,738 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:58,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:58,945 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:58,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:58,945 INFO L82 PathProgramCache]: Analyzing trace with hash 675475598, now seen corresponding path program 1 times [2019-10-15 01:27:58,945 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:58,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905442076] [2019-10-15 01:27:58,946 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:58,946 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:58,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:59,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1972 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-10-15 01:27:59,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905442076] [2019-10-15 01:27:59,101 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:59,101 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:59,101 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20637005] [2019-10-15 01:27:59,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:59,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:59,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:59,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:59,103 INFO L87 Difference]: Start difference. First operand 8293 states and 10415 transitions. Second operand 3 states. [2019-10-15 01:27:59,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:59,302 INFO L93 Difference]: Finished difference Result 15667 states and 19288 transitions. [2019-10-15 01:27:59,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:59,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 420 [2019-10-15 01:27:59,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:59,312 INFO L225 Difference]: With dead ends: 15667 [2019-10-15 01:27:59,313 INFO L226 Difference]: Without dead ends: 3877 [2019-10-15 01:27:59,323 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:59,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3877 states. [2019-10-15 01:27:59,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3877 to 3643. [2019-10-15 01:27:59,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-10-15 01:27:59,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 4533 transitions. [2019-10-15 01:27:59,388 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 4533 transitions. Word has length 420 [2019-10-15 01:27:59,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:59,389 INFO L462 AbstractCegarLoop]: Abstraction has 3643 states and 4533 transitions. [2019-10-15 01:27:59,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 4533 transitions. [2019-10-15 01:27:59,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-10-15 01:27:59,396 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:59,397 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:59,397 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:59,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:59,398 INFO L82 PathProgramCache]: Analyzing trace with hash 331734252, now seen corresponding path program 1 times [2019-10-15 01:27:59,398 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:59,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448678946] [2019-10-15 01:27:59,399 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:59,399 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:59,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:59,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2019-10-15 01:27:59,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448678946] [2019-10-15 01:27:59,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141195113] [2019-10-15 01:27:59,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:59,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:27:59,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2019-10-15 01:28:00,080 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:00,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2019-10-15 01:28:00,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2050296193] [2019-10-15 01:28:00,236 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 488 [2019-10-15 01:28:00,243 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:28:00,243 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:28:00,279 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:28:01,396 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:28:01,397 INFO L272 AbstractInterpreter]: Visited 116 different actions 2300 times. Merged at 104 different actions 1864 times. Widened at 22 different actions 233 times. Performed 6042 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6042 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 304 fixpoints after 38 different actions. Largest state had 106 variables. [2019-10-15 01:28:01,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:01,397 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:28:01,397 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:28:01,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:28:01,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838367339] [2019-10-15 01:28:01,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:01,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:01,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:01,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:01,400 INFO L87 Difference]: Start difference. First operand 3643 states and 4533 transitions. Second operand 6 states. [2019-10-15 01:28:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:01,763 INFO L93 Difference]: Finished difference Result 4515 states and 5616 transitions. [2019-10-15 01:28:01,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:01,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 487 [2019-10-15 01:28:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:01,764 INFO L225 Difference]: With dead ends: 4515 [2019-10-15 01:28:01,764 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:28:01,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 981 GetRequests, 975 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:01,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:28:01,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:28:01,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:28:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:28:01,771 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 487 [2019-10-15 01:28:01,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:01,772 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:28:01,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:01,772 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:28:01,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:28:01,986 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:01,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:28:02,823 WARN L191 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 417 DAG size of output: 99 [2019-10-15 01:28:02,956 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 23 [2019-10-15 01:28:03,209 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2019-10-15 01:28:04,461 WARN L191 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-10-15 01:28:04,514 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 01:28:04,514 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:28:04,514 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2019-10-15 01:28:04,514 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2019-10-15 01:28:04,514 INFO L446 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2019-10-15 01:28:04,514 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2019-10-15 01:28:04,514 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2019-10-15 01:28:04,514 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2019-10-15 01:28:04,515 INFO L439 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2019-10-15 01:28:04,515 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 520) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) (<= 12292 ssl3_connect_~s__state~0))) [2019-10-15 01:28:04,515 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2019-10-15 01:28:04,515 INFO L443 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2019-10-15 01:28:04,515 INFO L443 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2019-10-15 01:28:04,515 INFO L443 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2019-10-15 01:28:04,515 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2019-10-15 01:28:04,516 INFO L443 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2019-10-15 01:28:04,516 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2019-10-15 01:28:04,516 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2019-10-15 01:28:04,516 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2019-10-15 01:28:04,517 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (let ((.cse0 (< 4400 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1))) [2019-10-15 01:28:04,517 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2019-10-15 01:28:04,517 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-10-15 01:28:04,517 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2019-10-15 01:28:04,517 INFO L443 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2019-10-15 01:28:04,518 INFO L443 ceAbstractionStarter]: For program point L272-2(lines 272 276) no Hoare annotation was computed. [2019-10-15 01:28:04,518 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2019-10-15 01:28:04,518 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2019-10-15 01:28:04,518 INFO L439 ceAbstractionStarter]: At program point L207(lines 105 519) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (<= ssl3_connect_~blastFlag~0 0)) [2019-10-15 01:28:04,518 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2019-10-15 01:28:04,518 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2019-10-15 01:28:04,519 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2019-10-15 01:28:04,519 INFO L439 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2019-10-15 01:28:04,519 INFO L443 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2019-10-15 01:28:04,519 INFO L443 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2019-10-15 01:28:04,519 INFO L446 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2019-10-15 01:28:04,519 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2019-10-15 01:28:04,520 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2019-10-15 01:28:04,520 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2019-10-15 01:28:04,520 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2019-10-15 01:28:04,520 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2019-10-15 01:28:04,520 INFO L443 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2019-10-15 01:28:04,520 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2019-10-15 01:28:04,521 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2019-10-15 01:28:04,521 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2019-10-15 01:28:04,521 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2019-10-15 01:28:04,521 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2019-10-15 01:28:04,521 INFO L443 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2019-10-15 01:28:04,521 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2019-10-15 01:28:04,521 INFO L443 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2019-10-15 01:28:04,522 INFO L443 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2019-10-15 01:28:04,522 INFO L439 ceAbstractionStarter]: At program point L181(lines 177 495) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2))) [2019-10-15 01:28:04,522 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2019-10-15 01:28:04,522 INFO L443 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2019-10-15 01:28:04,522 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2019-10-15 01:28:04,522 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2019-10-15 01:28:04,523 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2019-10-15 01:28:04,523 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2019-10-15 01:28:04,523 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2019-10-15 01:28:04,523 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-10-15 01:28:04,523 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 297) no Hoare annotation was computed. [2019-10-15 01:28:04,523 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2019-10-15 01:28:04,523 INFO L443 ceAbstractionStarter]: For program point L283-2(lines 283 297) no Hoare annotation was computed. [2019-10-15 01:28:04,524 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 505) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1))) [2019-10-15 01:28:04,524 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2019-10-15 01:28:04,524 INFO L443 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2019-10-15 01:28:04,524 INFO L443 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2019-10-15 01:28:04,524 INFO L443 ceAbstractionStarter]: For program point L251-2(lines 202 485) no Hoare annotation was computed. [2019-10-15 01:28:04,524 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2019-10-15 01:28:04,525 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2019-10-15 01:28:04,525 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2019-10-15 01:28:04,525 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2019-10-15 01:28:04,525 INFO L439 ceAbstractionStarter]: At program point L187(lines 183 493) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2))) [2019-10-15 01:28:04,525 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (and (<= ssl3_connect_~blastFlag~0 0) (<= 4352 ssl3_connect_~s__state~0)) (< ssl3_connect_~s__state~0 4400))) [2019-10-15 01:28:04,525 INFO L443 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2019-10-15 01:28:04,525 INFO L443 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2019-10-15 01:28:04,526 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 293) no Hoare annotation was computed. [2019-10-15 01:28:04,526 INFO L439 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse7 (= ssl3_connect_~s__state~0 4496)) (.cse12 (= ssl3_connect_~s__state~0 4480)) (.cse4 (<= ssl3_connect_~s__state~0 4352)) (.cse5 (<= 4352 ssl3_connect_~s__state~0)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse11 (= 4448 ssl3_connect_~s__state~0)) (.cse14 (= ssl3_connect_~s__state~0 4528)) (.cse3 (<= ssl3_connect_~blastFlag~0 2)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (= ssl3_connect_~s__state~0 4512)) (.cse13 (<= ssl3_connect_~s__state~0 3)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse15 (= 4464 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~blastFlag~0 4)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse4 .cse5) (and .cse3 (= 4384 ssl3_connect_~s__state~0)) (and .cse3 .cse0) (and .cse6 .cse7 .cse2) (and .cse6 .cse8 .cse2 .cse9 .cse10) (and (= ssl3_connect_~s__state~0 4432) .cse1 .cse2) (and .cse7 .cse1 .cse2) (and .cse1 .cse2 .cse11) (and .cse1 .cse2 .cse12) (and .cse13 .cse3 .cse2) (and .cse6 .cse14 .cse2) (and .cse6 .cse2 .cse12) (and .cse6 .cse15 .cse2) (and .cse6 .cse4 .cse5 .cse2 .cse10) (and .cse3 (= 4400 ssl3_connect_~s__state~0) .cse2) (and .cse14 .cse1 .cse2) (and .cse6 .cse2 .cse11) (and .cse3 .cse14) (and .cse3 .cse8 .cse9) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse6 .cse0 .cse2) (and .cse1 .cse2 (= 4416 ssl3_connect_~s__state~0)) (and .cse13 .cse6) (<= ssl3_connect_~blastFlag~0 0) (and .cse15 .cse1 .cse2))) [2019-10-15 01:28:04,526 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2019-10-15 01:28:04,526 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2019-10-15 01:28:04,526 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2019-10-15 01:28:04,527 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2019-10-15 01:28:04,527 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2019-10-15 01:28:04,527 INFO L439 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2019-10-15 01:28:04,527 INFO L443 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2019-10-15 01:28:04,527 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2019-10-15 01:28:04,527 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2019-10-15 01:28:04,528 INFO L443 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2019-10-15 01:28:04,528 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2019-10-15 01:28:04,528 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2019-10-15 01:28:04,528 INFO L443 ceAbstractionStarter]: For program point L290-2(lines 285 297) no Hoare annotation was computed. [2019-10-15 01:28:04,528 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2019-10-15 01:28:04,528 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2019-10-15 01:28:04,528 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2019-10-15 01:28:04,528 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-10-15 01:28:04,529 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2019-10-15 01:28:04,529 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2019-10-15 01:28:04,529 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2019-10-15 01:28:04,529 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2019-10-15 01:28:04,529 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2019-10-15 01:28:04,529 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2019-10-15 01:28:04,529 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2019-10-15 01:28:04,529 INFO L443 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2019-10-15 01:28:04,530 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2019-10-15 01:28:04,530 INFO L439 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= 4560 ssl3_connect_~s__state~0))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (= ssl3_connect_~s__hit~0 0) .cse1 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 0) (< ssl3_connect_~s__state~0 12292) .cse0))) [2019-10-15 01:28:04,530 INFO L439 ceAbstractionStarter]: At program point L127(lines 123 513) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) (< ssl3_connect_~s__state~0 4400) (< 4368 ssl3_connect_~s__state~0))) [2019-10-15 01:28:04,530 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2019-10-15 01:28:04,530 INFO L443 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2019-10-15 01:28:04,530 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2019-10-15 01:28:04,531 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2019-10-15 01:28:04,531 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2019-10-15 01:28:04,531 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2019-10-15 01:28:04,531 INFO L443 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2019-10-15 01:28:04,531 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2019-10-15 01:28:04,531 INFO L439 ceAbstractionStarter]: At program point L196(lines 195 489) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (<= 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-10-15 01:28:04,532 INFO L439 ceAbstractionStarter]: At program point L163(lines 153 503) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2019-10-15 01:28:04,532 INFO L443 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2019-10-15 01:28:04,532 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2019-10-15 01:28:04,532 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2019-10-15 01:28:04,532 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2019-10-15 01:28:04,532 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 76 551) no Hoare annotation was computed. [2019-10-15 01:28:04,532 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2019-10-15 01:28:04,533 INFO L446 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2019-10-15 01:28:04,533 INFO L439 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (< 4368 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) (= ssl3_connect_~s__hit~0 0) .cse0 .cse1))) [2019-10-15 01:28:04,533 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-15 01:28:04,533 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2019-10-15 01:28:04,533 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2019-10-15 01:28:04,533 INFO L443 ceAbstractionStarter]: For program point L266-2(lines 202 485) no Hoare annotation was computed. [2019-10-15 01:28:04,533 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:28:04,534 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 01:28:04,534 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:28:04,534 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:28:04,534 INFO L439 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (<= 12292 main_~s~0) [2019-10-15 01:28:04,534 INFO L443 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2019-10-15 01:28:04,534 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2019-10-15 01:28:04,534 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2019-10-15 01:28:04,534 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2019-10-15 01:28:04,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:28:04 BoogieIcfgContainer [2019-10-15 01:28:04,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:28:04,561 INFO L168 Benchmark]: Toolchain (without parser) took 25323.03 ms. Allocated memory was 146.3 MB in the beginning and 1.1 GB in the end (delta: 951.1 MB). Free memory was 103.4 MB in the beginning and 100.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 954.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:28:04,562 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-15 01:28:04,562 INFO L168 Benchmark]: CACSL2BoogieTranslator took 521.25 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 103.2 MB in the beginning and 180.3 MB in the end (delta: -77.1 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-10-15 01:28:04,563 INFO L168 Benchmark]: Boogie Preprocessor took 69.11 ms. Allocated memory is still 204.5 MB. Free memory was 180.3 MB in the beginning and 177.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-10-15 01:28:04,564 INFO L168 Benchmark]: RCFGBuilder took 754.86 ms. Allocated memory is still 204.5 MB. Free memory was 177.5 MB in the beginning and 131.1 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:28:04,564 INFO L168 Benchmark]: TraceAbstraction took 23972.94 ms. Allocated memory was 204.5 MB in the beginning and 1.1 GB in the end (delta: 892.9 MB). Free memory was 131.1 MB in the beginning and 100.1 MB in the end (delta: 31.0 MB). Peak memory consumption was 923.9 MB. Max. memory is 7.1 GB. [2019-10-15 01:28:04,568 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.23 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 521.25 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 103.2 MB in the beginning and 180.3 MB in the end (delta: -77.1 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.11 ms. Allocated memory is still 204.5 MB. Free memory was 180.3 MB in the beginning and 177.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 754.86 ms. Allocated memory is still 204.5 MB. Free memory was 177.5 MB in the beginning and 131.1 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23972.94 ms. Allocated memory was 204.5 MB in the beginning and 1.1 GB in the end (delta: 892.9 MB). Free memory was 131.1 MB in the beginning and 100.1 MB in the end (delta: 31.0 MB). Peak memory consumption was 923.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) || !(12292 <= \old(initial_state))) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || ((blastFlag <= 0 && s__state < 12292) && 4560 <= s__state) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((blastFlag <= 0 && 4400 < s__state) && s__state <= 4560)) || (((4400 < s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || blastFlag <= 0 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state < 4400) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((blastFlag <= 0 && s__state <= 4352) && 4352 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((s__state == 4512 && blastFlag <= 4) && s__hit == 0) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (blastFlag <= 2 && 4384 == s__state)) || (blastFlag <= 2 && s__state == 4512)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || ((blastFlag <= 4 && s__hit == 0) && 4448 == s__state)) || ((blastFlag <= 4 && s__hit == 0) && s__state == 4480)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((s__s3__tmp__next_state___0 <= 4560 && 4464 == s__state) && 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 && 4400 == s__state) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && 4448 == s__state)) || (blastFlag <= 2 && s__state == 4528)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || !(12292 <= \old(initial_state))) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || ((blastFlag <= 4 && s__hit == 0) && 4416 == s__state)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || blastFlag <= 0) || ((4464 == s__state && blastFlag <= 4) && s__hit == 0) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((blastFlag <= 0 && s__state <= 4560) && 4368 < s__state)) || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4368 < s__state) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 2 && s__state < 4400) && 4368 < s__state) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 136 locations, 1 error locations. Result: SAFE, OverallTime: 23.8s, OverallIterations: 26, TraceHistogramMax: 18, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, HoareTripleCheckerStatistics: 5231 SDtfs, 2285 SDslu, 3745 SDs, 0 SdLazy, 3327 SolverSat, 605 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3848 GetRequests, 3796 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8460occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 6351 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 261 NumberOfFragments, 732 HoareAnnotationTreeSize, 26 FomulaSimplifications, 27594 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 26 FomulaSimplificationsInter, 2775 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 7625 NumberOfCodeBlocks, 7357 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 9468 ConstructedInterpolants, 0 QuantifiedInterpolants, 3839488 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3146 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 36 InterpolantComputations, 25 PerfectInterpolantSequences, 35016/35134 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...