java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:49:11,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:49:11,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:49:11,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:49:11,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:49:11,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:49:11,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:49:11,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:49:11,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:49:11,417 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:49:11,419 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:49:11,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:49:11,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:49:11,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:49:11,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:49:11,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:49:11,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:49:11,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:49:11,430 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:49:11,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:49:11,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:49:11,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:49:11,444 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:49:11,445 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:49:11,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:49:11,448 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:49:11,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:49:11,450 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:49:11,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:49:11,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:49:11,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:49:11,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:49:11,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:49:11,456 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:49:11,457 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:49:11,457 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:49:11,458 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:49:11,458 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:49:11,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:49:11,459 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:49:11,460 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:49:11,461 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-14 23:49:11,479 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:49:11,479 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:49:11,480 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:49:11,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:49:11,481 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:49:11,481 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:49:11,481 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:49:11,481 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:49:11,482 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:49:11,482 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:49:11,482 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:49:11,482 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:49:11,482 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:49:11,482 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:49:11,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:49:11,483 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:49:11,483 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:49:11,483 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:49:11,483 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:49:11,484 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:49:11,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:49:11,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:49:11,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:49:11,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:49:11,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:49:11,485 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:49:11,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:49:11,485 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:49:11,485 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:49:11,765 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:49:11,775 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:49:11,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:49:11,779 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:49:11,779 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:49:11,780 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-1.c [2019-10-14 23:49:11,839 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead404660/dd33f905fc1a4ee1a70b4f2c14ee5020/FLAG6f36d6a44 [2019-10-14 23:49:12,339 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:49:12,340 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-1.c [2019-10-14 23:49:12,367 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead404660/dd33f905fc1a4ee1a70b4f2c14ee5020/FLAG6f36d6a44 [2019-10-14 23:49:12,858 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead404660/dd33f905fc1a4ee1a70b4f2c14ee5020 [2019-10-14 23:49:12,866 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:49:12,868 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:49:12,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:12,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:49:12,873 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:49:12,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:12" (1/1) ... [2019-10-14 23:49:12,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702ad793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:12, skipping insertion in model container [2019-10-14 23:49:12,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:12" (1/1) ... [2019-10-14 23:49:12,884 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:49:12,942 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:49:13,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:13,165 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:49:13,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:13,320 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:49:13,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:13 WrapperNode [2019-10-14 23:49:13,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:13,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:49:13,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:49:13,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:49:13,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:13" (1/1) ... [2019-10-14 23:49:13,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:13" (1/1) ... [2019-10-14 23:49:13,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:13" (1/1) ... [2019-10-14 23:49:13,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:13" (1/1) ... [2019-10-14 23:49:13,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:13" (1/1) ... [2019-10-14 23:49:13,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:13" (1/1) ... [2019-10-14 23:49:13,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:13" (1/1) ... [2019-10-14 23:49:13,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:49:13,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:49:13,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:49:13,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:49:13,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:13" (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-14 23:49:13,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:49:13,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:49:13,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-14 23:49:13,449 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:49:13,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:49:13,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:49:13,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:49:13,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-14 23:49:13,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-14 23:49:13,450 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-14 23:49:13,450 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:49:13,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:49:13,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:49:13,603 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-14 23:49:14,134 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-14 23:49:14,134 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-14 23:49:14,145 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:49:14,145 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:49:14,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:14 BoogieIcfgContainer [2019-10-14 23:49:14,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:49:14,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:49:14,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:49:14,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:49:14,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:49:12" (1/3) ... [2019-10-14 23:49:14,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354b1651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:14, skipping insertion in model container [2019-10-14 23:49:14,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:13" (2/3) ... [2019-10-14 23:49:14,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354b1651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:14, skipping insertion in model container [2019-10-14 23:49:14,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:14" (3/3) ... [2019-10-14 23:49:14,155 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil-1.c [2019-10-14 23:49:14,165 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:49:14,173 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:49:14,184 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:49:14,210 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:49:14,211 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:49:14,211 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:49:14,211 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:49:14,211 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:49:14,212 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:49:14,212 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:49:14,212 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:49:14,234 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2019-10-14 23:49:14,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:49:14,242 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:14,243 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-14 23:49:14,244 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:14,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:14,250 INFO L82 PathProgramCache]: Analyzing trace with hash 173381458, now seen corresponding path program 1 times [2019-10-14 23:49:14,256 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:14,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698945970] [2019-10-14 23:49:14,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:14,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:14,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:14,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698945970] [2019-10-14 23:49:14,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:14,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:14,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376449035] [2019-10-14 23:49:14,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:14,481 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:14,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:14,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:14,497 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 3 states. [2019-10-14 23:49:14,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:14,676 INFO L93 Difference]: Finished difference Result 374 states and 631 transitions. [2019-10-14 23:49:14,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:14,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-14 23:49:14,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:14,703 INFO L225 Difference]: With dead ends: 374 [2019-10-14 23:49:14,703 INFO L226 Difference]: Without dead ends: 218 [2019-10-14 23:49:14,711 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-10-14 23:49:14,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2019-10-14 23:49:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-10-14 23:49:14,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 324 transitions. [2019-10-14 23:49:14,808 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 324 transitions. Word has length 29 [2019-10-14 23:49:14,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:14,809 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 324 transitions. [2019-10-14 23:49:14,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:14,809 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 324 transitions. [2019-10-14 23:49:14,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-14 23:49:14,812 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:14,812 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-14 23:49:14,813 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:14,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:14,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1098410427, now seen corresponding path program 1 times [2019-10-14 23:49:14,814 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:14,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652671034] [2019-10-14 23:49:14,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:14,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:14,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:14,944 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-14 23:49:14,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652671034] [2019-10-14 23:49:14,945 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:14,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:14,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689423010] [2019-10-14 23:49:14,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:14,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:14,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:14,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:14,948 INFO L87 Difference]: Start difference. First operand 218 states and 324 transitions. Second operand 3 states. [2019-10-14 23:49:15,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:15,140 INFO L93 Difference]: Finished difference Result 466 states and 703 transitions. [2019-10-14 23:49:15,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:15,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-14 23:49:15,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:15,143 INFO L225 Difference]: With dead ends: 466 [2019-10-14 23:49:15,143 INFO L226 Difference]: Without dead ends: 260 [2019-10-14 23:49:15,146 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:15,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-10-14 23:49:15,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 252. [2019-10-14 23:49:15,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-14 23:49:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 368 transitions. [2019-10-14 23:49:15,164 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 368 transitions. Word has length 43 [2019-10-14 23:49:15,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:15,164 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 368 transitions. [2019-10-14 23:49:15,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:15,164 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 368 transitions. [2019-10-14 23:49:15,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-14 23:49:15,167 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:15,168 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-14 23:49:15,168 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:15,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:15,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1578256893, now seen corresponding path program 1 times [2019-10-14 23:49:15,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:15,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710927180] [2019-10-14 23:49:15,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:15,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:15,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:15,291 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-14 23:49:15,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710927180] [2019-10-14 23:49:15,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:15,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:15,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445804690] [2019-10-14 23:49:15,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:15,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:15,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:15,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:15,298 INFO L87 Difference]: Start difference. First operand 252 states and 368 transitions. Second operand 3 states. [2019-10-14 23:49:15,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:15,495 INFO L93 Difference]: Finished difference Result 594 states and 898 transitions. [2019-10-14 23:49:15,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:15,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-14 23:49:15,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:15,498 INFO L225 Difference]: With dead ends: 594 [2019-10-14 23:49:15,498 INFO L226 Difference]: Without dead ends: 352 [2019-10-14 23:49:15,499 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:15,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-10-14 23:49:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 334. [2019-10-14 23:49:15,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-10-14 23:49:15,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 468 transitions. [2019-10-14 23:49:15,515 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 468 transitions. Word has length 60 [2019-10-14 23:49:15,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:15,516 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 468 transitions. [2019-10-14 23:49:15,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 468 transitions. [2019-10-14 23:49:15,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-14 23:49:15,519 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:15,519 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-14 23:49:15,520 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:15,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:15,520 INFO L82 PathProgramCache]: Analyzing trace with hash -227181441, now seen corresponding path program 1 times [2019-10-14 23:49:15,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:15,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189474966] [2019-10-14 23:49:15,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:15,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:15,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:15,575 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-14 23:49:15,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189474966] [2019-10-14 23:49:15,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:15,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:15,576 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916885326] [2019-10-14 23:49:15,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:15,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:15,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:15,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:15,577 INFO L87 Difference]: Start difference. First operand 334 states and 468 transitions. Second operand 3 states. [2019-10-14 23:49:15,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:15,747 INFO L93 Difference]: Finished difference Result 702 states and 999 transitions. [2019-10-14 23:49:15,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:15,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-14 23:49:15,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:15,753 INFO L225 Difference]: With dead ends: 702 [2019-10-14 23:49:15,753 INFO L226 Difference]: Without dead ends: 380 [2019-10-14 23:49:15,755 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:15,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-10-14 23:49:15,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 372. [2019-10-14 23:49:15,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-10-14 23:49:15,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 516 transitions. [2019-10-14 23:49:15,777 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 516 transitions. Word has length 60 [2019-10-14 23:49:15,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:15,778 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 516 transitions. [2019-10-14 23:49:15,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:15,778 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 516 transitions. [2019-10-14 23:49:15,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-14 23:49:15,790 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:15,791 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-14 23:49:15,791 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:15,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:15,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1103223005, now seen corresponding path program 1 times [2019-10-14 23:49:15,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:15,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158304419] [2019-10-14 23:49:15,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:15,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:15,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:15,909 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-14 23:49:15,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158304419] [2019-10-14 23:49:15,910 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:15,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:15,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865269174] [2019-10-14 23:49:15,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:15,912 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:15,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:15,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:15,914 INFO L87 Difference]: Start difference. First operand 372 states and 516 transitions. Second operand 3 states. [2019-10-14 23:49:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:16,095 INFO L93 Difference]: Finished difference Result 838 states and 1200 transitions. [2019-10-14 23:49:16,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:16,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-14 23:49:16,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:16,099 INFO L225 Difference]: With dead ends: 838 [2019-10-14 23:49:16,099 INFO L226 Difference]: Without dead ends: 476 [2019-10-14 23:49:16,100 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:16,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-10-14 23:49:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 450. [2019-10-14 23:49:16,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-10-14 23:49:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 650 transitions. [2019-10-14 23:49:16,120 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 650 transitions. Word has length 73 [2019-10-14 23:49:16,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:16,121 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 650 transitions. [2019-10-14 23:49:16,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:16,121 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 650 transitions. [2019-10-14 23:49:16,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-14 23:49:16,123 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:16,124 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] [2019-10-14 23:49:16,124 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:16,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:16,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1464237739, now seen corresponding path program 1 times [2019-10-14 23:49:16,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:16,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791456838] [2019-10-14 23:49:16,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:16,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:16,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:16,179 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-14 23:49:16,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791456838] [2019-10-14 23:49:16,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:16,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:16,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292990203] [2019-10-14 23:49:16,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:16,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:16,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:16,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:16,182 INFO L87 Difference]: Start difference. First operand 450 states and 650 transitions. Second operand 3 states. [2019-10-14 23:49:16,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:16,322 INFO L93 Difference]: Finished difference Result 936 states and 1361 transitions. [2019-10-14 23:49:16,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:16,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-10-14 23:49:16,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:16,334 INFO L225 Difference]: With dead ends: 936 [2019-10-14 23:49:16,334 INFO L226 Difference]: Without dead ends: 498 [2019-10-14 23:49:16,336 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:16,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-10-14 23:49:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 492. [2019-10-14 23:49:16,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-10-14 23:49:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 702 transitions. [2019-10-14 23:49:16,351 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 702 transitions. Word has length 76 [2019-10-14 23:49:16,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:16,351 INFO L462 AbstractCegarLoop]: Abstraction has 492 states and 702 transitions. [2019-10-14 23:49:16,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:16,351 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 702 transitions. [2019-10-14 23:49:16,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-14 23:49:16,353 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:16,353 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] [2019-10-14 23:49:16,354 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:16,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:16,354 INFO L82 PathProgramCache]: Analyzing trace with hash 665980045, now seen corresponding path program 1 times [2019-10-14 23:49:16,354 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:16,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528837861] [2019-10-14 23:49:16,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:16,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:16,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:16,423 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-14 23:49:16,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528837861] [2019-10-14 23:49:16,424 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:16,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:16,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249252867] [2019-10-14 23:49:16,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:16,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:16,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:16,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:16,426 INFO L87 Difference]: Start difference. First operand 492 states and 702 transitions. Second operand 3 states. [2019-10-14 23:49:16,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:16,464 INFO L93 Difference]: Finished difference Result 972 states and 1393 transitions. [2019-10-14 23:49:16,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:16,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-14 23:49:16,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:16,469 INFO L225 Difference]: With dead ends: 972 [2019-10-14 23:49:16,469 INFO L226 Difference]: Without dead ends: 731 [2019-10-14 23:49:16,470 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:16,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-10-14 23:49:16,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-10-14 23:49:16,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-10-14 23:49:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1044 transitions. [2019-10-14 23:49:16,496 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1044 transitions. Word has length 96 [2019-10-14 23:49:16,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:16,497 INFO L462 AbstractCegarLoop]: Abstraction has 731 states and 1044 transitions. [2019-10-14 23:49:16,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:16,497 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1044 transitions. [2019-10-14 23:49:16,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-14 23:49:16,499 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:16,499 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] [2019-10-14 23:49:16,500 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:16,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:16,500 INFO L82 PathProgramCache]: Analyzing trace with hash -208123337, now seen corresponding path program 1 times [2019-10-14 23:49:16,500 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:16,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317450434] [2019-10-14 23:49:16,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:16,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:16,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:16,585 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-14 23:49:16,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317450434] [2019-10-14 23:49:16,586 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:16,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:16,586 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102608666] [2019-10-14 23:49:16,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:16,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:16,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:16,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:16,587 INFO L87 Difference]: Start difference. First operand 731 states and 1044 transitions. Second operand 3 states. [2019-10-14 23:49:16,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:16,626 INFO L93 Difference]: Finished difference Result 972 states and 1390 transitions. [2019-10-14 23:49:16,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:16,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-14 23:49:16,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:16,632 INFO L225 Difference]: With dead ends: 972 [2019-10-14 23:49:16,632 INFO L226 Difference]: Without dead ends: 970 [2019-10-14 23:49:16,633 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:16,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-10-14 23:49:16,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2019-10-14 23:49:16,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-10-14 23:49:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1388 transitions. [2019-10-14 23:49:16,659 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1388 transitions. Word has length 98 [2019-10-14 23:49:16,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:16,659 INFO L462 AbstractCegarLoop]: Abstraction has 970 states and 1388 transitions. [2019-10-14 23:49:16,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1388 transitions. [2019-10-14 23:49:16,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-14 23:49:16,662 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:16,663 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:16,663 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:16,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:16,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1174534704, now seen corresponding path program 1 times [2019-10-14 23:49:16,663 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:16,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423098329] [2019-10-14 23:49:16,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:16,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:16,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-14 23:49:16,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423098329] [2019-10-14 23:49:16,711 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:16,711 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:16,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612412923] [2019-10-14 23:49:16,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:16,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:16,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:16,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:16,713 INFO L87 Difference]: Start difference. First operand 970 states and 1388 transitions. Second operand 3 states. [2019-10-14 23:49:16,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:16,843 INFO L93 Difference]: Finished difference Result 2034 states and 2930 transitions. [2019-10-14 23:49:16,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:16,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-10-14 23:49:16,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:16,849 INFO L225 Difference]: With dead ends: 2034 [2019-10-14 23:49:16,849 INFO L226 Difference]: Without dead ends: 1076 [2019-10-14 23:49:16,851 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:16,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-10-14 23:49:16,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1062. [2019-10-14 23:49:16,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2019-10-14 23:49:16,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1500 transitions. [2019-10-14 23:49:16,881 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1500 transitions. Word has length 123 [2019-10-14 23:49:16,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:16,882 INFO L462 AbstractCegarLoop]: Abstraction has 1062 states and 1500 transitions. [2019-10-14 23:49:16,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:16,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1500 transitions. [2019-10-14 23:49:16,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-14 23:49:16,885 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:16,885 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:16,886 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:16,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:16,886 INFO L82 PathProgramCache]: Analyzing trace with hash -176623095, now seen corresponding path program 1 times [2019-10-14 23:49:16,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:16,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038346576] [2019-10-14 23:49:16,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:16,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:16,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:16,953 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-14 23:49:16,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038346576] [2019-10-14 23:49:16,954 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:16,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:16,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043872073] [2019-10-14 23:49:16,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:16,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:16,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:16,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:16,955 INFO L87 Difference]: Start difference. First operand 1062 states and 1500 transitions. Second operand 3 states. [2019-10-14 23:49:17,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:17,155 INFO L93 Difference]: Finished difference Result 2316 states and 3324 transitions. [2019-10-14 23:49:17,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:17,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-10-14 23:49:17,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:17,162 INFO L225 Difference]: With dead ends: 2316 [2019-10-14 23:49:17,162 INFO L226 Difference]: Without dead ends: 1258 [2019-10-14 23:49:17,164 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:17,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-10-14 23:49:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1218. [2019-10-14 23:49:17,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-14 23:49:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1724 transitions. [2019-10-14 23:49:17,199 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1724 transitions. Word has length 144 [2019-10-14 23:49:17,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:17,199 INFO L462 AbstractCegarLoop]: Abstraction has 1218 states and 1724 transitions. [2019-10-14 23:49:17,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1724 transitions. [2019-10-14 23:49:17,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-14 23:49:17,204 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:17,204 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:17,204 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:17,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:17,205 INFO L82 PathProgramCache]: Analyzing trace with hash -871418854, now seen corresponding path program 1 times [2019-10-14 23:49:17,205 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:17,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920361670] [2019-10-14 23:49:17,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:17,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:17,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-14 23:49:17,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920361670] [2019-10-14 23:49:17,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:17,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:17,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529661782] [2019-10-14 23:49:17,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:17,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:17,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:17,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:17,273 INFO L87 Difference]: Start difference. First operand 1218 states and 1724 transitions. Second operand 3 states. [2019-10-14 23:49:17,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:17,409 INFO L93 Difference]: Finished difference Result 2544 states and 3576 transitions. [2019-10-14 23:49:17,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:17,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-14 23:49:17,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:17,418 INFO L225 Difference]: With dead ends: 2544 [2019-10-14 23:49:17,418 INFO L226 Difference]: Without dead ends: 1338 [2019-10-14 23:49:17,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:17,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2019-10-14 23:49:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1330. [2019-10-14 23:49:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2019-10-14 23:49:17,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1856 transitions. [2019-10-14 23:49:17,465 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1856 transitions. Word has length 180 [2019-10-14 23:49:17,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:17,466 INFO L462 AbstractCegarLoop]: Abstraction has 1330 states and 1856 transitions. [2019-10-14 23:49:17,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:17,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1856 transitions. [2019-10-14 23:49:17,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-14 23:49:17,470 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:17,471 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:17,471 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:17,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:17,472 INFO L82 PathProgramCache]: Analyzing trace with hash -310719076, now seen corresponding path program 1 times [2019-10-14 23:49:17,472 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:17,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084880853] [2019-10-14 23:49:17,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:17,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:17,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-14 23:49:17,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084880853] [2019-10-14 23:49:17,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:17,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:17,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446641730] [2019-10-14 23:49:17,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:17,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:17,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:17,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:17,575 INFO L87 Difference]: Start difference. First operand 1330 states and 1856 transitions. Second operand 3 states. [2019-10-14 23:49:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:17,711 INFO L93 Difference]: Finished difference Result 2784 states and 3876 transitions. [2019-10-14 23:49:17,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:17,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-14 23:49:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:17,719 INFO L225 Difference]: With dead ends: 2784 [2019-10-14 23:49:17,720 INFO L226 Difference]: Without dead ends: 1466 [2019-10-14 23:49:17,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:17,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2019-10-14 23:49:17,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1454. [2019-10-14 23:49:17,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2019-10-14 23:49:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2000 transitions. [2019-10-14 23:49:17,761 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2000 transitions. Word has length 180 [2019-10-14 23:49:17,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:17,762 INFO L462 AbstractCegarLoop]: Abstraction has 1454 states and 2000 transitions. [2019-10-14 23:49:17,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:17,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2000 transitions. [2019-10-14 23:49:17,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-14 23:49:17,767 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:17,767 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:17,768 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:17,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:17,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2035334682, now seen corresponding path program 1 times [2019-10-14 23:49:17,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:17,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841281636] [2019-10-14 23:49:17,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:17,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:17,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-10-14 23:49:17,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841281636] [2019-10-14 23:49:17,877 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:17,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:17,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739607897] [2019-10-14 23:49:17,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:17,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:17,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:17,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:17,879 INFO L87 Difference]: Start difference. First operand 1454 states and 2000 transitions. Second operand 3 states. [2019-10-14 23:49:17,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:17,945 INFO L93 Difference]: Finished difference Result 4334 states and 5964 transitions. [2019-10-14 23:49:17,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:17,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-10-14 23:49:17,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:17,964 INFO L225 Difference]: With dead ends: 4334 [2019-10-14 23:49:17,964 INFO L226 Difference]: Without dead ends: 2892 [2019-10-14 23:49:17,968 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:17,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2019-10-14 23:49:18,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2890. [2019-10-14 23:49:18,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2890 states. [2019-10-14 23:49:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 3975 transitions. [2019-10-14 23:49:18,135 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 3975 transitions. Word has length 210 [2019-10-14 23:49:18,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:18,136 INFO L462 AbstractCegarLoop]: Abstraction has 2890 states and 3975 transitions. [2019-10-14 23:49:18,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:18,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 3975 transitions. [2019-10-14 23:49:18,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-14 23:49:18,146 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:18,147 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:18,147 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:18,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:18,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1698932836, now seen corresponding path program 1 times [2019-10-14 23:49:18,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:18,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380430250] [2019-10-14 23:49:18,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:18,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:18,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:18,262 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-10-14 23:49:18,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380430250] [2019-10-14 23:49:18,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:18,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:18,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589738022] [2019-10-14 23:49:18,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:18,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:18,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:18,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:18,266 INFO L87 Difference]: Start difference. First operand 2890 states and 3975 transitions. Second operand 3 states. [2019-10-14 23:49:18,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:18,497 INFO L93 Difference]: Finished difference Result 6068 states and 8346 transitions. [2019-10-14 23:49:18,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:18,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-10-14 23:49:18,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:18,518 INFO L225 Difference]: With dead ends: 6068 [2019-10-14 23:49:18,518 INFO L226 Difference]: Without dead ends: 3190 [2019-10-14 23:49:18,526 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:18,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2019-10-14 23:49:18,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 3174. [2019-10-14 23:49:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3174 states. [2019-10-14 23:49:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 4299 transitions. [2019-10-14 23:49:18,642 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 4299 transitions. Word has length 210 [2019-10-14 23:49:18,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:18,642 INFO L462 AbstractCegarLoop]: Abstraction has 3174 states and 4299 transitions. [2019-10-14 23:49:18,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:18,643 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 4299 transitions. [2019-10-14 23:49:18,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-14 23:49:18,655 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:18,656 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:18,656 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:18,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:18,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1588238652, now seen corresponding path program 1 times [2019-10-14 23:49:18,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:18,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125680454] [2019-10-14 23:49:18,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:18,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:18,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-10-14 23:49:18,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125680454] [2019-10-14 23:49:18,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:18,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:18,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293740386] [2019-10-14 23:49:18,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:18,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:18,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:18,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:18,890 INFO L87 Difference]: Start difference. First operand 3174 states and 4299 transitions. Second operand 3 states. [2019-10-14 23:49:19,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:19,063 INFO L93 Difference]: Finished difference Result 6484 states and 8778 transitions. [2019-10-14 23:49:19,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:19,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-10-14 23:49:19,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:19,078 INFO L225 Difference]: With dead ends: 6484 [2019-10-14 23:49:19,078 INFO L226 Difference]: Without dead ends: 3322 [2019-10-14 23:49:19,084 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:19,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2019-10-14 23:49:19,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3306. [2019-10-14 23:49:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3306 states. [2019-10-14 23:49:19,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 4451 transitions. [2019-10-14 23:49:19,166 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 4451 transitions. Word has length 234 [2019-10-14 23:49:19,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:19,166 INFO L462 AbstractCegarLoop]: Abstraction has 3306 states and 4451 transitions. [2019-10-14 23:49:19,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:19,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 4451 transitions. [2019-10-14 23:49:19,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-14 23:49:19,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:19,175 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:19,175 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:19,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:19,176 INFO L82 PathProgramCache]: Analyzing trace with hash -736614694, now seen corresponding path program 1 times [2019-10-14 23:49:19,176 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:19,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573423394] [2019-10-14 23:49:19,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:19,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:19,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:19,263 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-10-14 23:49:19,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573423394] [2019-10-14 23:49:19,264 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:19,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:19,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081453166] [2019-10-14 23:49:19,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:19,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:19,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:19,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:19,266 INFO L87 Difference]: Start difference. First operand 3306 states and 4451 transitions. Second operand 3 states. [2019-10-14 23:49:19,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:19,495 INFO L93 Difference]: Finished difference Result 7000 states and 9558 transitions. [2019-10-14 23:49:19,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:19,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-10-14 23:49:19,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:19,512 INFO L225 Difference]: With dead ends: 7000 [2019-10-14 23:49:19,512 INFO L226 Difference]: Without dead ends: 3706 [2019-10-14 23:49:19,519 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:19,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2019-10-14 23:49:19,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3618. [2019-10-14 23:49:19,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3618 states. [2019-10-14 23:49:19,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3618 states to 3618 states and 4819 transitions. [2019-10-14 23:49:19,617 INFO L78 Accepts]: Start accepts. Automaton has 3618 states and 4819 transitions. Word has length 245 [2019-10-14 23:49:19,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:19,617 INFO L462 AbstractCegarLoop]: Abstraction has 3618 states and 4819 transitions. [2019-10-14 23:49:19,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:19,617 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 4819 transitions. [2019-10-14 23:49:19,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-14 23:49:19,626 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:19,626 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:19,627 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:19,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:19,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1168177660, now seen corresponding path program 1 times [2019-10-14 23:49:19,627 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:19,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971362165] [2019-10-14 23:49:19,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:19,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:19,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:19,738 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-10-14 23:49:19,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971362165] [2019-10-14 23:49:19,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:19,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:19,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426401206] [2019-10-14 23:49:19,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:19,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:19,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:19,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:19,740 INFO L87 Difference]: Start difference. First operand 3618 states and 4819 transitions. Second operand 3 states. [2019-10-14 23:49:19,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:19,952 INFO L93 Difference]: Finished difference Result 7632 states and 10102 transitions. [2019-10-14 23:49:19,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:19,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-10-14 23:49:19,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:19,974 INFO L225 Difference]: With dead ends: 7632 [2019-10-14 23:49:19,974 INFO L226 Difference]: Without dead ends: 4026 [2019-10-14 23:49:19,983 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:19,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4026 states. [2019-10-14 23:49:20,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4026 to 3738. [2019-10-14 23:49:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3738 states. [2019-10-14 23:49:20,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 4963 transitions. [2019-10-14 23:49:20,111 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 4963 transitions. Word has length 259 [2019-10-14 23:49:20,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:20,112 INFO L462 AbstractCegarLoop]: Abstraction has 3738 states and 4963 transitions. [2019-10-14 23:49:20,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:20,112 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 4963 transitions. [2019-10-14 23:49:20,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-14 23:49:20,130 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:20,130 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:20,131 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:20,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:20,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1227839833, now seen corresponding path program 1 times [2019-10-14 23:49:20,132 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:20,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373132184] [2019-10-14 23:49:20,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:20,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:20,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-10-14 23:49:20,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373132184] [2019-10-14 23:49:20,401 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:20,401 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:20,401 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137587527] [2019-10-14 23:49:20,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:20,402 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:20,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:20,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:20,403 INFO L87 Difference]: Start difference. First operand 3738 states and 4963 transitions. Second operand 3 states. [2019-10-14 23:49:20,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:20,495 INFO L93 Difference]: Finished difference Result 10686 states and 14265 transitions. [2019-10-14 23:49:20,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:20,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-10-14 23:49:20,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:20,529 INFO L225 Difference]: With dead ends: 10686 [2019-10-14 23:49:20,529 INFO L226 Difference]: Without dead ends: 6960 [2019-10-14 23:49:20,537 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:20,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6960 states. [2019-10-14 23:49:20,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6960 to 6958. [2019-10-14 23:49:20,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6958 states. [2019-10-14 23:49:20,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6958 states to 6958 states and 9293 transitions. [2019-10-14 23:49:20,683 INFO L78 Accepts]: Start accepts. Automaton has 6958 states and 9293 transitions. Word has length 260 [2019-10-14 23:49:20,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:20,684 INFO L462 AbstractCegarLoop]: Abstraction has 6958 states and 9293 transitions. [2019-10-14 23:49:20,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:20,684 INFO L276 IsEmpty]: Start isEmpty. Operand 6958 states and 9293 transitions. [2019-10-14 23:49:20,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-14 23:49:20,696 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:20,697 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:20,697 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:20,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:20,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818967, now seen corresponding path program 1 times [2019-10-14 23:49:20,697 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:20,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632494812] [2019-10-14 23:49:20,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:20,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:20,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2019-10-14 23:49:20,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632494812] [2019-10-14 23:49:20,794 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:20,794 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:20,794 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915283959] [2019-10-14 23:49:20,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:20,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:20,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:20,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:20,797 INFO L87 Difference]: Start difference. First operand 6958 states and 9293 transitions. Second operand 3 states. [2019-10-14 23:49:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:21,030 INFO L93 Difference]: Finished difference Result 13912 states and 18562 transitions. [2019-10-14 23:49:21,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:21,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-10-14 23:49:21,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:21,050 INFO L225 Difference]: With dead ends: 13912 [2019-10-14 23:49:21,050 INFO L226 Difference]: Without dead ends: 6966 [2019-10-14 23:49:21,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:21,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6966 states. [2019-10-14 23:49:21,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6966 to 6934. [2019-10-14 23:49:21,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6934 states. [2019-10-14 23:49:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6934 states to 6934 states and 9077 transitions. [2019-10-14 23:49:21,221 INFO L78 Accepts]: Start accepts. Automaton has 6934 states and 9077 transitions. Word has length 261 [2019-10-14 23:49:21,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:21,222 INFO L462 AbstractCegarLoop]: Abstraction has 6934 states and 9077 transitions. [2019-10-14 23:49:21,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:21,222 INFO L276 IsEmpty]: Start isEmpty. Operand 6934 states and 9077 transitions. [2019-10-14 23:49:21,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-14 23:49:21,235 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:21,236 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:21,236 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:21,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:21,236 INFO L82 PathProgramCache]: Analyzing trace with hash 747649846, now seen corresponding path program 1 times [2019-10-14 23:49:21,237 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:21,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734597747] [2019-10-14 23:49:21,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:21,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:21,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 318 proven. 18 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-10-14 23:49:21,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734597747] [2019-10-14 23:49:21,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818213179] [2019-10-14 23:49:21,357 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-14 23:49:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:21,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:49:21,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2019-10-14 23:49:21,655 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:49:21,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-14 23:49:21,656 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041244234] [2019-10-14 23:49:21,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:49:21,657 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:21,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:49:21,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:21,658 INFO L87 Difference]: Start difference. First operand 6934 states and 9077 transitions. Second operand 4 states. [2019-10-14 23:49:22,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:22,046 INFO L93 Difference]: Finished difference Result 14034 states and 18379 transitions. [2019-10-14 23:49:22,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:49:22,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2019-10-14 23:49:22,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:22,066 INFO L225 Difference]: With dead ends: 14034 [2019-10-14 23:49:22,066 INFO L226 Difference]: Without dead ends: 7084 [2019-10-14 23:49:22,084 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:49:22,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7084 states. [2019-10-14 23:49:22,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7084 to 6940. [2019-10-14 23:49:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6940 states. [2019-10-14 23:49:22,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6940 states to 6940 states and 9085 transitions. [2019-10-14 23:49:22,346 INFO L78 Accepts]: Start accepts. Automaton has 6940 states and 9085 transitions. Word has length 284 [2019-10-14 23:49:22,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:22,347 INFO L462 AbstractCegarLoop]: Abstraction has 6940 states and 9085 transitions. [2019-10-14 23:49:22,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:49:22,347 INFO L276 IsEmpty]: Start isEmpty. Operand 6940 states and 9085 transitions. [2019-10-14 23:49:22,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-14 23:49:22,370 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:22,370 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:49:22,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:22,576 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:22,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:22,577 INFO L82 PathProgramCache]: Analyzing trace with hash -39333344, now seen corresponding path program 1 times [2019-10-14 23:49:22,577 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:22,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805089065] [2019-10-14 23:49:22,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:22,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:22,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:22,792 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-10-14 23:49:22,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805089065] [2019-10-14 23:49:22,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999199542] [2019-10-14 23:49:22,800 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-14 23:49:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:22,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:22,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-10-14 23:49:23,217 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:49:23,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:49:23,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262086866] [2019-10-14 23:49:23,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:49:23,221 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:23,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:49:23,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:49:23,222 INFO L87 Difference]: Start difference. First operand 6940 states and 9085 transitions. Second operand 4 states. [2019-10-14 23:49:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:23,658 INFO L93 Difference]: Finished difference Result 13792 states and 18051 transitions. [2019-10-14 23:49:23,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:23,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 297 [2019-10-14 23:49:23,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:23,678 INFO L225 Difference]: With dead ends: 13792 [2019-10-14 23:49:23,678 INFO L226 Difference]: Without dead ends: 10410 [2019-10-14 23:49:23,688 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10410 states. [2019-10-14 23:49:23,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10410 to 8844. [2019-10-14 23:49:23,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8844 states. [2019-10-14 23:49:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8844 states to 8844 states and 11583 transitions. [2019-10-14 23:49:23,926 INFO L78 Accepts]: Start accepts. Automaton has 8844 states and 11583 transitions. Word has length 297 [2019-10-14 23:49:23,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:23,927 INFO L462 AbstractCegarLoop]: Abstraction has 8844 states and 11583 transitions. [2019-10-14 23:49:23,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:49:23,928 INFO L276 IsEmpty]: Start isEmpty. Operand 8844 states and 11583 transitions. [2019-10-14 23:49:23,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-14 23:49:23,951 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:23,952 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:24,166 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:24,166 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:24,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:24,168 INFO L82 PathProgramCache]: Analyzing trace with hash 280748442, now seen corresponding path program 2 times [2019-10-14 23:49:24,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:24,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676975193] [2019-10-14 23:49:24,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:24,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:24,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:24,300 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 407 proven. 5 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-10-14 23:49:24,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676975193] [2019-10-14 23:49:24,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334608237] [2019-10-14 23:49:24,301 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-14 23:49:24,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:49:24,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:49:24,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:24,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2019-10-14 23:49:24,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:49:24,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:49:24,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872571622] [2019-10-14 23:49:24,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:24,692 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:24,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:24,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:24,693 INFO L87 Difference]: Start difference. First operand 8844 states and 11583 transitions. Second operand 3 states. [2019-10-14 23:49:24,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:24,979 INFO L93 Difference]: Finished difference Result 18102 states and 23742 transitions. [2019-10-14 23:49:24,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:24,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-10-14 23:49:24,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:24,998 INFO L225 Difference]: With dead ends: 18102 [2019-10-14 23:49:24,998 INFO L226 Difference]: Without dead ends: 9276 [2019-10-14 23:49:25,014 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:25,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9276 states. [2019-10-14 23:49:25,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9276 to 9204. [2019-10-14 23:49:25,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9204 states. [2019-10-14 23:49:25,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9204 states to 9204 states and 12063 transitions. [2019-10-14 23:49:25,217 INFO L78 Accepts]: Start accepts. Automaton has 9204 states and 12063 transitions. Word has length 310 [2019-10-14 23:49:25,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:25,217 INFO L462 AbstractCegarLoop]: Abstraction has 9204 states and 12063 transitions. [2019-10-14 23:49:25,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 9204 states and 12063 transitions. [2019-10-14 23:49:25,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-10-14 23:49:25,235 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:25,236 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:49:25,441 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:25,441 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:25,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:25,442 INFO L82 PathProgramCache]: Analyzing trace with hash 670685447, now seen corresponding path program 1 times [2019-10-14 23:49:25,442 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:25,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132491251] [2019-10-14 23:49:25,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:25,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:25,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:25,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 954 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-14 23:49:25,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132491251] [2019-10-14 23:49:25,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939763515] [2019-10-14 23:49:25,598 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-14 23:49:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:25,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:25,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:25,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 821 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2019-10-14 23:49:25,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:49:25,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:49:25,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225872531] [2019-10-14 23:49:25,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:25,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:25,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:25,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:25,923 INFO L87 Difference]: Start difference. First operand 9204 states and 12063 transitions. Second operand 3 states. [2019-10-14 23:49:26,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:26,101 INFO L93 Difference]: Finished difference Result 22958 states and 30072 transitions. [2019-10-14 23:49:26,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:26,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 377 [2019-10-14 23:49:26,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:26,138 INFO L225 Difference]: With dead ends: 22958 [2019-10-14 23:49:26,138 INFO L226 Difference]: Without dead ends: 13772 [2019-10-14 23:49:26,159 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:26,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13772 states. [2019-10-14 23:49:26,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13772 to 13772. [2019-10-14 23:49:26,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13772 states. [2019-10-14 23:49:26,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13772 states to 13772 states and 18009 transitions. [2019-10-14 23:49:26,466 INFO L78 Accepts]: Start accepts. Automaton has 13772 states and 18009 transitions. Word has length 377 [2019-10-14 23:49:26,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:26,467 INFO L462 AbstractCegarLoop]: Abstraction has 13772 states and 18009 transitions. [2019-10-14 23:49:26,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:26,467 INFO L276 IsEmpty]: Start isEmpty. Operand 13772 states and 18009 transitions. [2019-10-14 23:49:26,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-10-14 23:49:26,495 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:26,495 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:49:26,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:26,700 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:26,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:26,701 INFO L82 PathProgramCache]: Analyzing trace with hash 2068327023, now seen corresponding path program 1 times [2019-10-14 23:49:26,701 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:26,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105400478] [2019-10-14 23:49:26,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:26,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:26,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-14 23:49:26,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105400478] [2019-10-14 23:49:26,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219627276] [2019-10-14 23:49:26,867 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-14 23:49:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:27,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:27,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-14 23:49:27,173 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:49:27,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:49:27,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681169565] [2019-10-14 23:49:27,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:49:27,176 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:27,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:49:27,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:49:27,177 INFO L87 Difference]: Start difference. First operand 13772 states and 18009 transitions. Second operand 4 states. [2019-10-14 23:49:27,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:27,790 INFO L93 Difference]: Finished difference Result 30950 states and 40277 transitions. [2019-10-14 23:49:27,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:49:27,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2019-10-14 23:49:27,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:27,827 INFO L225 Difference]: With dead ends: 30950 [2019-10-14 23:49:27,827 INFO L226 Difference]: Without dead ends: 17184 [2019-10-14 23:49:27,852 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17184 states. [2019-10-14 23:49:28,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17184 to 14520. [2019-10-14 23:49:28,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14520 states. [2019-10-14 23:49:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14520 states to 14520 states and 18571 transitions. [2019-10-14 23:49:28,153 INFO L78 Accepts]: Start accepts. Automaton has 14520 states and 18571 transitions. Word has length 379 [2019-10-14 23:49:28,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:28,154 INFO L462 AbstractCegarLoop]: Abstraction has 14520 states and 18571 transitions. [2019-10-14 23:49:28,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:49:28,155 INFO L276 IsEmpty]: Start isEmpty. Operand 14520 states and 18571 transitions. [2019-10-14 23:49:28,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-10-14 23:49:28,182 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:28,183 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:49:28,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:28,388 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:28,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:28,389 INFO L82 PathProgramCache]: Analyzing trace with hash -725462501, now seen corresponding path program 1 times [2019-10-14 23:49:28,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:28,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045063917] [2019-10-14 23:49:28,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:28,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:28,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:28,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 886 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-10-14 23:49:28,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045063917] [2019-10-14 23:49:28,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:28,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:28,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076979722] [2019-10-14 23:49:28,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:28,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:28,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:28,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:28,689 INFO L87 Difference]: Start difference. First operand 14520 states and 18571 transitions. Second operand 3 states. [2019-10-14 23:49:29,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:29,008 INFO L93 Difference]: Finished difference Result 27597 states and 34926 transitions. [2019-10-14 23:49:29,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:29,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-10-14 23:49:29,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:29,023 INFO L225 Difference]: With dead ends: 27597 [2019-10-14 23:49:29,023 INFO L226 Difference]: Without dead ends: 5535 [2019-10-14 23:49:29,046 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:29,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states. [2019-10-14 23:49:29,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 5194. [2019-10-14 23:49:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5194 states. [2019-10-14 23:49:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5194 states to 5194 states and 6445 transitions. [2019-10-14 23:49:29,139 INFO L78 Accepts]: Start accepts. Automaton has 5194 states and 6445 transitions. Word has length 418 [2019-10-14 23:49:29,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:29,140 INFO L462 AbstractCegarLoop]: Abstraction has 5194 states and 6445 transitions. [2019-10-14 23:49:29,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:29,140 INFO L276 IsEmpty]: Start isEmpty. Operand 5194 states and 6445 transitions. [2019-10-14 23:49:29,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-10-14 23:49:29,152 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:29,153 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:29,153 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:29,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:29,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1911375163, now seen corresponding path program 1 times [2019-10-14 23:49:29,155 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:29,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103074041] [2019-10-14 23:49:29,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:29,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:29,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:29,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-10-14 23:49:29,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103074041] [2019-10-14 23:49:29,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149001886] [2019-10-14 23:49:29,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:29,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:29,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-10-14 23:49:29,958 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:49:29,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:49:29,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158912095] [2019-10-14 23:49:29,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:49:29,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:29,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:49:29,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:49:29,962 INFO L87 Difference]: Start difference. First operand 5194 states and 6445 transitions. Second operand 4 states. [2019-10-14 23:49:30,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:30,148 INFO L93 Difference]: Finished difference Result 5690 states and 7070 transitions. [2019-10-14 23:49:30,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:49:30,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 447 [2019-10-14 23:49:30,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:30,150 INFO L225 Difference]: With dead ends: 5690 [2019-10-14 23:49:30,150 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:49:30,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:30,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:49:30,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:49:30,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:49:30,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:49:30,158 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 447 [2019-10-14 23:49:30,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:30,159 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:49:30,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:49:30,159 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:49:30,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:49:30,363 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:30,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:49:30,737 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 76 [2019-10-14 23:49:31,640 WARN L191 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 454 DAG size of output: 93 [2019-10-14 23:49:32,015 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-10-14 23:49:32,348 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 19 [2019-10-14 23:49:33,144 WARN L191 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2019-10-14 23:49:33,451 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-14 23:49:33,451 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:49:33,451 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-10-14 23:49:33,451 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2019-10-14 23:49:33,451 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 491) no Hoare annotation was computed. [2019-10-14 23:49:33,452 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 502) no Hoare annotation was computed. [2019-10-14 23:49:33,452 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 513) no Hoare annotation was computed. [2019-10-14 23:49:33,452 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2019-10-14 23:49:33,452 INFO L443 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2019-10-14 23:49:33,452 INFO L439 ceAbstractionStarter]: At program point L137(lines 133 503) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse2) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-10-14 23:49:33,452 INFO L446 ceAbstractionStarter]: At program point L534(lines 96 535) the Hoare annotation is: true [2019-10-14 23:49:33,452 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2019-10-14 23:49:33,453 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 240) no Hoare annotation was computed. [2019-10-14 23:49:33,453 INFO L443 ceAbstractionStarter]: For program point L270-2(lines 270 274) no Hoare annotation was computed. [2019-10-14 23:49:33,453 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 307) no Hoare annotation was computed. [2019-10-14 23:49:33,453 INFO L439 ceAbstractionStarter]: At program point L205(lines 103 513) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0))) (or (<= ssl3_connect_~blastFlag~0 0) (and (<= ssl3_connect_~blastFlag~0 2) .cse0) (and (<= ssl3_connect_~blastFlag~0 4) .cse0 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2019-10-14 23:49:33,453 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 490) no Hoare annotation was computed. [2019-10-14 23:49:33,453 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 501) no Hoare annotation was computed. [2019-10-14 23:49:33,453 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 512) no Hoare annotation was computed. [2019-10-14 23:49:33,454 INFO L439 ceAbstractionStarter]: At program point L173(lines 169 491) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (<= 4464 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse2))) [2019-10-14 23:49:33,454 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2019-10-14 23:49:33,454 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 450) no Hoare annotation was computed. [2019-10-14 23:49:33,454 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 420) no Hoare annotation was computed. [2019-10-14 23:49:33,454 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 406 420) no Hoare annotation was computed. [2019-10-14 23:49:33,456 INFO L443 ceAbstractionStarter]: For program point L439-2(lines 439 450) no Hoare annotation was computed. [2019-10-14 23:49:33,457 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 489) no Hoare annotation was computed. [2019-10-14 23:49:33,457 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 500) no Hoare annotation was computed. [2019-10-14 23:49:33,457 INFO L443 ceAbstractionStarter]: For program point L109(lines 109 511) no Hoare annotation was computed. [2019-10-14 23:49:33,457 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 541) no Hoare annotation was computed. [2019-10-14 23:49:33,457 INFO L443 ceAbstractionStarter]: For program point L539-2(lines 539 541) no Hoare annotation was computed. [2019-10-14 23:49:33,457 INFO L439 ceAbstractionStarter]: At program point L143(lines 139 501) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-10-14 23:49:33,457 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 344) no Hoare annotation was computed. [2019-10-14 23:49:33,457 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 212) no Hoare annotation was computed. [2019-10-14 23:49:33,458 INFO L443 ceAbstractionStarter]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2019-10-14 23:49:33,458 INFO L443 ceAbstractionStarter]: For program point L376(lines 376 378) no Hoare annotation was computed. [2019-10-14 23:49:33,458 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 488) no Hoare annotation was computed. [2019-10-14 23:49:33,458 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 499) no Hoare annotation was computed. [2019-10-14 23:49:33,458 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 510) no Hoare annotation was computed. [2019-10-14 23:49:33,458 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 416) no Hoare annotation was computed. [2019-10-14 23:49:33,458 INFO L439 ceAbstractionStarter]: At program point L179(lines 175 489) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~0))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and (= ssl3_connect_~s__hit~0 0) .cse0 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2019-10-14 23:49:33,458 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2019-10-14 23:49:33,459 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 314) no Hoare annotation was computed. [2019-10-14 23:49:33,459 INFO L443 ceAbstractionStarter]: For program point L279-1(lines 279 289) no Hoare annotation was computed. [2019-10-14 23:49:33,460 INFO L439 ceAbstractionStarter]: At program point L313(lines 75 545) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2019-10-14 23:49:33,460 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 487) no Hoare annotation was computed. [2019-10-14 23:49:33,460 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 498) no Hoare annotation was computed. [2019-10-14 23:49:33,460 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 509) no Hoare annotation was computed. [2019-10-14 23:49:33,460 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2019-10-14 23:49:33,460 INFO L439 ceAbstractionStarter]: At program point L149(lines 145 499) the Hoare annotation is: (let ((.cse3 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 .cse3) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-10-14 23:49:33,460 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-10-14 23:49:33,461 INFO L439 ceAbstractionStarter]: At program point L480(lines 97 533) the Hoare annotation is: (let ((.cse7 (<= 4560 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4560)) (.cse9 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 3)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4528)) (.cse6 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (.cse4 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse5 (= ssl3_connect_~s__state~0 4512))) (or (and .cse0 .cse1) (and .cse2 .cse0 .cse3) (and .cse0 .cse4) (and .cse5 .cse4 .cse6) (and .cse3 .cse7 .cse4 .cse8 .cse6 .cse9) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse0 .cse7 .cse8) (and .cse3 .cse10 .cse11 .cse4 .cse6 .cse9) (and .cse4 .cse6 (= ssl3_connect_~s__state~0 4480)) (and .cse0 (= 4384 ssl3_connect_~s__state~0)) (and (= ssl3_connect_~s__state~0 4496) .cse4 .cse6) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse10 .cse11) (and (= 4464 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse2 .cse3 .cse6) (and (<= ssl3_connect_~blastFlag~0 4) .cse4 .cse6) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse6 .cse4) (and .cse0 .cse5))) [2019-10-14 23:49:33,461 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2019-10-14 23:49:33,461 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 251) no Hoare annotation was computed. [2019-10-14 23:49:33,461 INFO L443 ceAbstractionStarter]: For program point L249-2(lines 200 479) no Hoare annotation was computed. [2019-10-14 23:49:33,461 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 543) no Hoare annotation was computed. [2019-10-14 23:49:33,462 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 546) the Hoare annotation is: true [2019-10-14 23:49:33,462 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 386) no Hoare annotation was computed. [2019-10-14 23:49:33,462 INFO L443 ceAbstractionStarter]: For program point L382-2(lines 200 479) no Hoare annotation was computed. [2019-10-14 23:49:33,462 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2019-10-14 23:49:33,463 INFO L443 ceAbstractionStarter]: For program point L283-2(lines 281 289) no Hoare annotation was computed. [2019-10-14 23:49:33,463 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 486) no Hoare annotation was computed. [2019-10-14 23:49:33,463 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 497) no Hoare annotation was computed. [2019-10-14 23:49:33,463 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 508) no Hoare annotation was computed. [2019-10-14 23:49:33,463 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 531) no Hoare annotation was computed. [2019-10-14 23:49:33,464 INFO L439 ceAbstractionStarter]: At program point L185(lines 181 487) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and (= ssl3_connect_~s__hit~0 0) .cse0 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse1))) [2019-10-14 23:49:33,464 INFO L439 ceAbstractionStarter]: At program point L119(lines 115 509) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 .cse1))) [2019-10-14 23:49:33,464 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-10-14 23:49:33,464 INFO L443 ceAbstractionStarter]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2019-10-14 23:49:33,464 INFO L443 ceAbstractionStarter]: For program point L516(lines 516 530) no Hoare annotation was computed. [2019-10-14 23:49:33,464 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2019-10-14 23:49:33,464 INFO L443 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2019-10-14 23:49:33,465 INFO L443 ceAbstractionStarter]: For program point L517-2(lines 516 530) no Hoare annotation was computed. [2019-10-14 23:49:33,465 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 485) no Hoare annotation was computed. [2019-10-14 23:49:33,465 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 496) no Hoare annotation was computed. [2019-10-14 23:49:33,465 INFO L443 ceAbstractionStarter]: For program point L121(lines 121 507) no Hoare annotation was computed. [2019-10-14 23:49:33,465 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 232) no Hoare annotation was computed. [2019-10-14 23:49:33,465 INFO L443 ceAbstractionStarter]: For program point L221-2(lines 200 479) no Hoare annotation was computed. [2019-10-14 23:49:33,465 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 521) no Hoare annotation was computed. [2019-10-14 23:49:33,465 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 360) no Hoare annotation was computed. [2019-10-14 23:49:33,465 INFO L443 ceAbstractionStarter]: For program point L355-2(lines 355 360) no Hoare annotation was computed. [2019-10-14 23:49:33,466 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 226) no Hoare annotation was computed. [2019-10-14 23:49:33,466 INFO L443 ceAbstractionStarter]: For program point L190(lines 190 484) no Hoare annotation was computed. [2019-10-14 23:49:33,466 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 495) no Hoare annotation was computed. [2019-10-14 23:49:33,466 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 506) no Hoare annotation was computed. [2019-10-14 23:49:33,466 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 95) no Hoare annotation was computed. [2019-10-14 23:49:33,466 INFO L443 ceAbstractionStarter]: For program point L455-1(lines 455 457) no Hoare annotation was computed. [2019-10-14 23:49:33,467 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 259) no Hoare annotation was computed. [2019-10-14 23:49:33,467 INFO L439 ceAbstractionStarter]: At program point L191(lines 187 485) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (.cse4 (<= ssl3_connect_~blastFlag~0 2)) (.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse3) (and .cse4 .cse0 .cse2))) [2019-10-14 23:49:33,468 INFO L439 ceAbstractionStarter]: At program point L125(lines 121 507) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)))) [2019-10-14 23:49:33,468 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 94) no Hoare annotation was computed. [2019-10-14 23:49:33,468 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 546) no Hoare annotation was computed. [2019-10-14 23:49:33,468 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-10-14 23:49:33,468 INFO L443 ceAbstractionStarter]: For program point L324-2(lines 200 479) no Hoare annotation was computed. [2019-10-14 23:49:33,468 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 546) no Hoare annotation was computed. [2019-10-14 23:49:33,468 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 394) no Hoare annotation was computed. [2019-10-14 23:49:33,468 INFO L443 ceAbstractionStarter]: For program point L193(lines 193 483) no Hoare annotation was computed. [2019-10-14 23:49:33,469 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 494) no Hoare annotation was computed. [2019-10-14 23:49:33,469 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 505) no Hoare annotation was computed. [2019-10-14 23:49:33,469 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 528) no Hoare annotation was computed. [2019-10-14 23:49:33,469 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-10-14 23:49:33,469 INFO L439 ceAbstractionStarter]: At program point L194(lines 193 483) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ssl3_connect_~s__state~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3 .cse4 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4) .cse3 .cse4))) [2019-10-14 23:49:33,469 INFO L439 ceAbstractionStarter]: At program point L161(lines 151 497) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (<= 4464 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse2))) [2019-10-14 23:49:33,469 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 428) no Hoare annotation was computed. [2019-10-14 23:49:33,470 INFO L443 ceAbstractionStarter]: For program point L196(lines 196 482) no Hoare annotation was computed. [2019-10-14 23:49:33,470 INFO L443 ceAbstractionStarter]: For program point L163(lines 163 493) no Hoare annotation was computed. [2019-10-14 23:49:33,470 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 504) no Hoare annotation was computed. [2019-10-14 23:49:33,470 INFO L443 ceAbstractionStarter]: For program point L97-1(lines 75 545) no Hoare annotation was computed. [2019-10-14 23:49:33,470 INFO L443 ceAbstractionStarter]: For program point L461(lines 461 463) no Hoare annotation was computed. [2019-10-14 23:49:33,471 INFO L443 ceAbstractionStarter]: For program point L461-2(lines 461 463) no Hoare annotation was computed. [2019-10-14 23:49:33,471 INFO L443 ceAbstractionStarter]: For program point L296(lines 296 298) no Hoare annotation was computed. [2019-10-14 23:49:33,471 INFO L443 ceAbstractionStarter]: For program point L296-2(lines 200 479) no Hoare annotation was computed. [2019-10-14 23:49:33,471 INFO L446 ceAbstractionStarter]: At program point L197(lines 196 482) the Hoare annotation is: true [2019-10-14 23:49:33,471 INFO L439 ceAbstractionStarter]: At program point L131(lines 127 505) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-10-14 23:49:33,471 INFO L443 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-10-14 23:49:33,471 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-10-14 23:49:33,472 INFO L443 ceAbstractionStarter]: For program point L429-2(lines 429 433) no Hoare annotation was computed. [2019-10-14 23:49:33,472 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 334) no Hoare annotation was computed. [2019-10-14 23:49:33,472 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2019-10-14 23:49:33,472 INFO L443 ceAbstractionStarter]: For program point L330-2(lines 330 334) no Hoare annotation was computed. [2019-10-14 23:49:33,472 INFO L443 ceAbstractionStarter]: For program point L264-2(lines 200 479) no Hoare annotation was computed. [2019-10-14 23:49:33,472 INFO L446 ceAbstractionStarter]: At program point L199(lines 198 482) the Hoare annotation is: true [2019-10-14 23:49:33,472 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 492) no Hoare annotation was computed. [2019-10-14 23:49:33,472 INFO L443 ceAbstractionStarter]: For program point L133(lines 133 503) no Hoare annotation was computed. [2019-10-14 23:49:33,472 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 514) no Hoare annotation was computed. [2019-10-14 23:49:33,473 INFO L439 ceAbstractionStarter]: At program point L167(lines 163 493) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (<= 4464 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse2))) [2019-10-14 23:49:33,473 INFO L439 ceAbstractionStarter]: At program point L101(lines 100 514) the Hoare annotation is: (let ((.cse0 (<= 12292 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)))) [2019-10-14 23:49:33,473 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:49:33,473 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-14 23:49:33,473 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:49:33,473 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:49:33,473 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 547 557) the Hoare annotation is: true [2019-10-14 23:49:33,474 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 547 557) no Hoare annotation was computed. [2019-10-14 23:49:33,474 INFO L446 ceAbstractionStarter]: At program point L553(line 553) the Hoare annotation is: true [2019-10-14 23:49:33,474 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 547 557) no Hoare annotation was computed. [2019-10-14 23:49:33,474 INFO L443 ceAbstractionStarter]: For program point L553-1(line 553) no Hoare annotation was computed. [2019-10-14 23:49:33,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:49:33 BoogieIcfgContainer [2019-10-14 23:49:33,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:49:33,525 INFO L168 Benchmark]: Toolchain (without parser) took 20653.13 ms. Allocated memory was 139.5 MB in the beginning and 940.6 MB in the end (delta: 801.1 MB). Free memory was 103.6 MB in the beginning and 171.5 MB in the end (delta: -67.9 MB). Peak memory consumption was 733.2 MB. Max. memory is 7.1 GB. [2019-10-14 23:49:33,527 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-14 23:49:33,528 INFO L168 Benchmark]: CACSL2BoogieTranslator took 451.91 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 103.4 MB in the beginning and 178.4 MB in the end (delta: -75.0 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-10-14 23:49:33,529 INFO L168 Benchmark]: Boogie Preprocessor took 59.46 ms. Allocated memory is still 202.9 MB. Free memory was 178.4 MB in the beginning and 175.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-14 23:49:33,530 INFO L168 Benchmark]: RCFGBuilder took 765.59 ms. Allocated memory is still 202.9 MB. Free memory was 175.8 MB in the beginning and 130.3 MB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. [2019-10-14 23:49:33,530 INFO L168 Benchmark]: TraceAbstraction took 19371.41 ms. Allocated memory was 202.9 MB in the beginning and 940.6 MB in the end (delta: 737.7 MB). Free memory was 129.6 MB in the beginning and 171.5 MB in the end (delta: -41.9 MB). Peak memory consumption was 695.8 MB. Max. memory is 7.1 GB. [2019-10-14 23:49:33,535 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.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 451.91 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 103.4 MB in the beginning and 178.4 MB in the end (delta: -75.0 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.46 ms. Allocated memory is still 202.9 MB. Free memory was 178.4 MB in the beginning and 175.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 765.59 ms. Allocated memory is still 202.9 MB. Free memory was 175.8 MB in the beginning and 130.3 MB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19371.41 ms. Allocated memory was 202.9 MB in the beginning and 940.6 MB in the end (delta: 737.7 MB). Free memory was 129.6 MB in the beginning and 171.5 MB in the end (delta: -41.9 MB). Peak memory consumption was 695.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4464 <= s__state)) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((((((((blastFlag <= 2 && s__state == 4528) || ((s__state <= 3 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && s__hit == 0)) || ((s__state == 4512 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0)) || ((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state == 4480)) || (blastFlag <= 2 && 4384 == s__state)) || ((s__state == 4496 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || ((4464 == s__state && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 4 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || !(12292 <= \old(initial_state))) || ((s__state == 4528 && 256 == s__s3__tmp__new_cipher__algorithms) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state)) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((blastFlag <= 0 || (blastFlag <= 2 && s__hit == 0)) || ((blastFlag <= 4 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4464 <= s__state)) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((!(12292 <= \old(initial_state)) || (((blastFlag <= 2 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0)) || ((((s__state <= 4352 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4464 <= s__state)) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (blastFlag <= 0 && 12292 <= s__state)) || ((blastFlag <= 2 && 12292 <= s__state) && s__hit == 0)) || (((12292 <= s__state && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((!(12292 <= \old(initial_state)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 2 && 4560 <= s__state) && s__hit == 0)) || (((4560 <= s__state && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state)) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 135 locations, 1 error locations. Result: SAFE, OverallTime: 19.2s, OverallIterations: 26, TraceHistogramMax: 18, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.0s, HoareTripleCheckerStatistics: 5320 SDtfs, 1895 SDslu, 2986 SDs, 0 SdLazy, 2527 SolverSat, 460 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2231 GetRequests, 2191 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14520occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 26 MinimizatonAttempts, 5371 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 505 NumberOfFragments, 750 HoareAnnotationTreeSize, 26 FomulaSimplifications, 40117 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 26 FomulaSimplificationsInter, 4509 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 7447 NumberOfCodeBlocks, 7447 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 7415 ConstructedInterpolants, 0 QuantifiedInterpolants, 2973961 SizeOfPredicates, 10 NumberOfNonLiveVariables, 4035 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 32 InterpolantComputations, 23 PerfectInterpolantSequences, 24196/24298 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...