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-f4eb214f-m [2019-10-13 19:50:08,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:50:08,895 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:50:08,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:50:08,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:50:08,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:50:08,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:50:08,923 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:50:08,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:50:08,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:50:08,932 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:50:08,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:50:08,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:50:08,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:50:08,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:50:08,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:50:08,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:50:08,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:50:08,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:50:08,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:50:08,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:50:08,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:50:08,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:50:08,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:50:08,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:50:08,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:50:08,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:50:08,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:50:08,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:50:08,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:50:08,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:50:08,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:50:08,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:50:08,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:50:08,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:50:08,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:50:08,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:50:08,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:50:08,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:50:08,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:50:08,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:50:08,972 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-13 19:50:09,007 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:50:09,007 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:50:09,008 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:50:09,008 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:50:09,008 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:50:09,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:50:09,009 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:50:09,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:50:09,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:50:09,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:50:09,010 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:50:09,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:50:09,010 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:50:09,010 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:50:09,010 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:50:09,011 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:50:09,011 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:50:09,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:50:09,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:50:09,012 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:50:09,012 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:50:09,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:50:09,012 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:50:09,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:50:09,013 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:50:09,013 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:50:09,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:50:09,013 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:50:09,013 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:50:09,308 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:50:09,321 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:50:09,324 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:50:09,326 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:50:09,326 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:50:09,327 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-13 19:50:09,398 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f07b757/05dbb60a97f34d0fb99473b8caf93b1d/FLAGe7a51a72c [2019-10-13 19:50:09,889 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:50:09,891 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-1.c [2019-10-13 19:50:09,905 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f07b757/05dbb60a97f34d0fb99473b8caf93b1d/FLAGe7a51a72c [2019-10-13 19:50:10,262 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f07b757/05dbb60a97f34d0fb99473b8caf93b1d [2019-10-13 19:50:10,272 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:50:10,274 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:50:10,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:10,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:50:10,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:50:10,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:10" (1/1) ... [2019-10-13 19:50:10,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b9809d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:10, skipping insertion in model container [2019-10-13 19:50:10,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:10" (1/1) ... [2019-10-13 19:50:10,291 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:50:10,347 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:50:10,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:10,608 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:50:10,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:10,778 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:50:10,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:10 WrapperNode [2019-10-13 19:50:10,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:10,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:50:10,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:50:10,779 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:50:10,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:10" (1/1) ... [2019-10-13 19:50:10,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:10" (1/1) ... [2019-10-13 19:50:10,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:10" (1/1) ... [2019-10-13 19:50:10,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:10" (1/1) ... [2019-10-13 19:50:10,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:10" (1/1) ... [2019-10-13 19:50:10,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:10" (1/1) ... [2019-10-13 19:50:10,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:10" (1/1) ... [2019-10-13 19:50:10,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:50:10,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:50:10,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:50:10,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:50:10,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:10" (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-13 19:50:10,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:50:10,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:50:10,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-13 19:50:10,892 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:50:10,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:50:10,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:50:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:50:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-13 19:50:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 19:50:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-13 19:50:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:50:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:50:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:50:11,052 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 19:50:11,620 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-13 19:50:11,620 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-13 19:50:11,632 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:50:11,632 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 19:50:11,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:11 BoogieIcfgContainer [2019-10-13 19:50:11,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:50:11,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:50:11,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:50:11,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:50:11,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:50:10" (1/3) ... [2019-10-13 19:50:11,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53530707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:11, skipping insertion in model container [2019-10-13 19:50:11,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:10" (2/3) ... [2019-10-13 19:50:11,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53530707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:11, skipping insertion in model container [2019-10-13 19:50:11,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:11" (3/3) ... [2019-10-13 19:50:11,644 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil-1.c [2019-10-13 19:50:11,654 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:50:11,664 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:50:11,678 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:50:11,707 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:50:11,707 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:50:11,708 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:50:11,708 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:50:11,708 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:50:11,708 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:50:11,709 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:50:11,709 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:50:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2019-10-13 19:50:11,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:50:11,742 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:11,743 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-13 19:50:11,745 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:11,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:11,752 INFO L82 PathProgramCache]: Analyzing trace with hash 173381458, now seen corresponding path program 1 times [2019-10-13 19:50:11,762 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:11,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006810192] [2019-10-13 19:50:11,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:11,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:11,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:12,022 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-13 19:50:12,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006810192] [2019-10-13 19:50:12,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:12,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:12,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539179499] [2019-10-13 19:50:12,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:12,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:12,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:12,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:12,047 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 3 states. [2019-10-13 19:50:12,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:12,164 INFO L93 Difference]: Finished difference Result 374 states and 631 transitions. [2019-10-13 19:50:12,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:12,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 19:50:12,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:12,183 INFO L225 Difference]: With dead ends: 374 [2019-10-13 19:50:12,183 INFO L226 Difference]: Without dead ends: 218 [2019-10-13 19:50:12,188 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-13 19:50:12,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-10-13 19:50:12,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2019-10-13 19:50:12,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-10-13 19:50:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 324 transitions. [2019-10-13 19:50:12,323 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 324 transitions. Word has length 29 [2019-10-13 19:50:12,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:12,324 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 324 transitions. [2019-10-13 19:50:12,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:12,324 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 324 transitions. [2019-10-13 19:50:12,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 19:50:12,329 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:12,330 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-13 19:50:12,331 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:12,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:12,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1098410427, now seen corresponding path program 1 times [2019-10-13 19:50:12,332 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:12,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133973109] [2019-10-13 19:50:12,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:12,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:12,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:12,505 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-13 19:50:12,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133973109] [2019-10-13 19:50:12,506 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:12,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:12,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032525467] [2019-10-13 19:50:12,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:12,508 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:12,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:12,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:12,509 INFO L87 Difference]: Start difference. First operand 218 states and 324 transitions. Second operand 3 states. [2019-10-13 19:50:12,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:12,710 INFO L93 Difference]: Finished difference Result 466 states and 703 transitions. [2019-10-13 19:50:12,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:12,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-13 19:50:12,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:12,714 INFO L225 Difference]: With dead ends: 466 [2019-10-13 19:50:12,714 INFO L226 Difference]: Without dead ends: 260 [2019-10-13 19:50:12,717 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-13 19:50:12,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-10-13 19:50:12,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 252. [2019-10-13 19:50:12,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-13 19:50:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 368 transitions. [2019-10-13 19:50:12,739 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 368 transitions. Word has length 43 [2019-10-13 19:50:12,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:12,740 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 368 transitions. [2019-10-13 19:50:12,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 368 transitions. [2019-10-13 19:50:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 19:50:12,745 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:12,745 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-13 19:50:12,747 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:12,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:12,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1578256893, now seen corresponding path program 1 times [2019-10-13 19:50:12,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:12,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906936614] [2019-10-13 19:50:12,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:12,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:12,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:12,835 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-13 19:50:12,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906936614] [2019-10-13 19:50:12,836 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:12,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:12,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126241489] [2019-10-13 19:50:12,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:12,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:12,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:12,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:12,838 INFO L87 Difference]: Start difference. First operand 252 states and 368 transitions. Second operand 3 states. [2019-10-13 19:50:13,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:13,060 INFO L93 Difference]: Finished difference Result 594 states and 898 transitions. [2019-10-13 19:50:13,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:13,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-13 19:50:13,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:13,064 INFO L225 Difference]: With dead ends: 594 [2019-10-13 19:50:13,065 INFO L226 Difference]: Without dead ends: 352 [2019-10-13 19:50:13,066 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-13 19:50:13,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-10-13 19:50:13,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 334. [2019-10-13 19:50:13,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-10-13 19:50:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 468 transitions. [2019-10-13 19:50:13,083 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 468 transitions. Word has length 60 [2019-10-13 19:50:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:13,084 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 468 transitions. [2019-10-13 19:50:13,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 468 transitions. [2019-10-13 19:50:13,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 19:50:13,087 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:13,088 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-13 19:50:13,088 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:13,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:13,088 INFO L82 PathProgramCache]: Analyzing trace with hash -227181441, now seen corresponding path program 1 times [2019-10-13 19:50:13,089 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:13,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128043501] [2019-10-13 19:50:13,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:13,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:13,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:13,182 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-13 19:50:13,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128043501] [2019-10-13 19:50:13,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:13,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:13,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026993818] [2019-10-13 19:50:13,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:13,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:13,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:13,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:13,184 INFO L87 Difference]: Start difference. First operand 334 states and 468 transitions. Second operand 3 states. [2019-10-13 19:50:13,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:13,371 INFO L93 Difference]: Finished difference Result 702 states and 999 transitions. [2019-10-13 19:50:13,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:13,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-13 19:50:13,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:13,376 INFO L225 Difference]: With dead ends: 702 [2019-10-13 19:50:13,376 INFO L226 Difference]: Without dead ends: 380 [2019-10-13 19:50:13,378 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-13 19:50:13,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-10-13 19:50:13,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 372. [2019-10-13 19:50:13,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-10-13 19:50:13,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 516 transitions. [2019-10-13 19:50:13,396 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 516 transitions. Word has length 60 [2019-10-13 19:50:13,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:13,396 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 516 transitions. [2019-10-13 19:50:13,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:13,397 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 516 transitions. [2019-10-13 19:50:13,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-13 19:50:13,403 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:13,404 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-13 19:50:13,404 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:13,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:13,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1103223005, now seen corresponding path program 1 times [2019-10-13 19:50:13,405 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:13,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887942989] [2019-10-13 19:50:13,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:13,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:13,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:13,531 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-13 19:50:13,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887942989] [2019-10-13 19:50:13,533 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:13,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:13,534 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506061051] [2019-10-13 19:50:13,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:13,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:13,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:13,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:13,537 INFO L87 Difference]: Start difference. First operand 372 states and 516 transitions. Second operand 3 states. [2019-10-13 19:50:13,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:13,732 INFO L93 Difference]: Finished difference Result 838 states and 1200 transitions. [2019-10-13 19:50:13,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:13,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-13 19:50:13,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:13,735 INFO L225 Difference]: With dead ends: 838 [2019-10-13 19:50:13,736 INFO L226 Difference]: Without dead ends: 476 [2019-10-13 19:50:13,737 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-13 19:50:13,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-10-13 19:50:13,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 450. [2019-10-13 19:50:13,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-10-13 19:50:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 650 transitions. [2019-10-13 19:50:13,753 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 650 transitions. Word has length 73 [2019-10-13 19:50:13,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:13,753 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 650 transitions. [2019-10-13 19:50:13,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 650 transitions. [2019-10-13 19:50:13,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-13 19:50:13,755 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:13,755 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-13 19:50:13,755 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:13,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:13,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1464237739, now seen corresponding path program 1 times [2019-10-13 19:50:13,756 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:13,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561010298] [2019-10-13 19:50:13,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:13,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:13,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:13,822 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-13 19:50:13,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561010298] [2019-10-13 19:50:13,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:13,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:13,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549776659] [2019-10-13 19:50:13,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:13,825 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:13,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:13,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:13,825 INFO L87 Difference]: Start difference. First operand 450 states and 650 transitions. Second operand 3 states. [2019-10-13 19:50:13,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:13,977 INFO L93 Difference]: Finished difference Result 936 states and 1361 transitions. [2019-10-13 19:50:13,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:13,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-10-13 19:50:13,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:13,981 INFO L225 Difference]: With dead ends: 936 [2019-10-13 19:50:13,981 INFO L226 Difference]: Without dead ends: 498 [2019-10-13 19:50:13,982 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-13 19:50:13,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-10-13 19:50:13,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 492. [2019-10-13 19:50:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-10-13 19:50:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 702 transitions. [2019-10-13 19:50:13,998 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 702 transitions. Word has length 76 [2019-10-13 19:50:13,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:13,999 INFO L462 AbstractCegarLoop]: Abstraction has 492 states and 702 transitions. [2019-10-13 19:50:13,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 702 transitions. [2019-10-13 19:50:14,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 19:50:14,001 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:14,001 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-13 19:50:14,001 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:14,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:14,001 INFO L82 PathProgramCache]: Analyzing trace with hash 665980045, now seen corresponding path program 1 times [2019-10-13 19:50:14,002 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:14,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633181491] [2019-10-13 19:50:14,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:14,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:14,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:14,063 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-13 19:50:14,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633181491] [2019-10-13 19:50:14,064 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:14,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:14,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046076575] [2019-10-13 19:50:14,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:14,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:14,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:14,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:14,067 INFO L87 Difference]: Start difference. First operand 492 states and 702 transitions. Second operand 3 states. [2019-10-13 19:50:14,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:14,112 INFO L93 Difference]: Finished difference Result 972 states and 1393 transitions. [2019-10-13 19:50:14,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:14,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-13 19:50:14,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:14,117 INFO L225 Difference]: With dead ends: 972 [2019-10-13 19:50:14,117 INFO L226 Difference]: Without dead ends: 731 [2019-10-13 19:50:14,118 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-13 19:50:14,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-10-13 19:50:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-10-13 19:50:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-10-13 19:50:14,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1044 transitions. [2019-10-13 19:50:14,140 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1044 transitions. Word has length 96 [2019-10-13 19:50:14,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:14,140 INFO L462 AbstractCegarLoop]: Abstraction has 731 states and 1044 transitions. [2019-10-13 19:50:14,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:14,141 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1044 transitions. [2019-10-13 19:50:14,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 19:50:14,143 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:14,143 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-13 19:50:14,143 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:14,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:14,143 INFO L82 PathProgramCache]: Analyzing trace with hash -208123337, now seen corresponding path program 1 times [2019-10-13 19:50:14,144 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:14,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043392547] [2019-10-13 19:50:14,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:14,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:14,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:14,221 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-13 19:50:14,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043392547] [2019-10-13 19:50:14,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:14,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:14,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908231791] [2019-10-13 19:50:14,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:14,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:14,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:14,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:14,224 INFO L87 Difference]: Start difference. First operand 731 states and 1044 transitions. Second operand 3 states. [2019-10-13 19:50:14,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:14,264 INFO L93 Difference]: Finished difference Result 972 states and 1390 transitions. [2019-10-13 19:50:14,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:14,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-13 19:50:14,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:14,271 INFO L225 Difference]: With dead ends: 972 [2019-10-13 19:50:14,271 INFO L226 Difference]: Without dead ends: 970 [2019-10-13 19:50:14,272 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-13 19:50:14,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-10-13 19:50:14,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2019-10-13 19:50:14,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-10-13 19:50:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1388 transitions. [2019-10-13 19:50:14,297 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1388 transitions. Word has length 98 [2019-10-13 19:50:14,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:14,298 INFO L462 AbstractCegarLoop]: Abstraction has 970 states and 1388 transitions. [2019-10-13 19:50:14,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1388 transitions. [2019-10-13 19:50:14,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-13 19:50:14,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:14,301 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-13 19:50:14,301 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:14,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:14,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1174534704, now seen corresponding path program 1 times [2019-10-13 19:50:14,302 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:14,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114510491] [2019-10-13 19:50:14,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:14,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:14,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:14,362 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-13 19:50:14,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114510491] [2019-10-13 19:50:14,363 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:14,364 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:14,364 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465275709] [2019-10-13 19:50:14,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:14,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:14,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:14,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:14,365 INFO L87 Difference]: Start difference. First operand 970 states and 1388 transitions. Second operand 3 states. [2019-10-13 19:50:14,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:14,492 INFO L93 Difference]: Finished difference Result 2034 states and 2930 transitions. [2019-10-13 19:50:14,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:14,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-10-13 19:50:14,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:14,498 INFO L225 Difference]: With dead ends: 2034 [2019-10-13 19:50:14,498 INFO L226 Difference]: Without dead ends: 1076 [2019-10-13 19:50:14,500 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-13 19:50:14,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-10-13 19:50:14,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1062. [2019-10-13 19:50:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2019-10-13 19:50:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1500 transitions. [2019-10-13 19:50:14,528 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1500 transitions. Word has length 123 [2019-10-13 19:50:14,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:14,529 INFO L462 AbstractCegarLoop]: Abstraction has 1062 states and 1500 transitions. [2019-10-13 19:50:14,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:14,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1500 transitions. [2019-10-13 19:50:14,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 19:50:14,537 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:14,538 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-13 19:50:14,538 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:14,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:14,538 INFO L82 PathProgramCache]: Analyzing trace with hash -176623095, now seen corresponding path program 1 times [2019-10-13 19:50:14,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:14,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954081381] [2019-10-13 19:50:14,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:14,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:14,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:14,613 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-13 19:50:14,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954081381] [2019-10-13 19:50:14,614 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:14,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:14,615 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419251879] [2019-10-13 19:50:14,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:14,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:14,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:14,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:14,616 INFO L87 Difference]: Start difference. First operand 1062 states and 1500 transitions. Second operand 3 states. [2019-10-13 19:50:14,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:14,797 INFO L93 Difference]: Finished difference Result 2316 states and 3324 transitions. [2019-10-13 19:50:14,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:14,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-10-13 19:50:14,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:14,806 INFO L225 Difference]: With dead ends: 2316 [2019-10-13 19:50:14,806 INFO L226 Difference]: Without dead ends: 1258 [2019-10-13 19:50:14,809 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-13 19:50:14,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-10-13 19:50:14,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1218. [2019-10-13 19:50:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-13 19:50:14,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1724 transitions. [2019-10-13 19:50:14,846 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1724 transitions. Word has length 144 [2019-10-13 19:50:14,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:14,846 INFO L462 AbstractCegarLoop]: Abstraction has 1218 states and 1724 transitions. [2019-10-13 19:50:14,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:14,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1724 transitions. [2019-10-13 19:50:14,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-13 19:50:14,851 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:14,852 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-13 19:50:14,852 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:14,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:14,853 INFO L82 PathProgramCache]: Analyzing trace with hash -871418854, now seen corresponding path program 1 times [2019-10-13 19:50:14,853 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:14,853 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568209552] [2019-10-13 19:50:14,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:14,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:14,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:14,923 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-13 19:50:14,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568209552] [2019-10-13 19:50:14,924 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:14,924 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:14,924 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309106492] [2019-10-13 19:50:14,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:14,925 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:14,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:14,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:14,926 INFO L87 Difference]: Start difference. First operand 1218 states and 1724 transitions. Second operand 3 states. [2019-10-13 19:50:15,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:15,073 INFO L93 Difference]: Finished difference Result 2544 states and 3576 transitions. [2019-10-13 19:50:15,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:15,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-13 19:50:15,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:15,081 INFO L225 Difference]: With dead ends: 2544 [2019-10-13 19:50:15,081 INFO L226 Difference]: Without dead ends: 1338 [2019-10-13 19:50:15,083 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-13 19:50:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2019-10-13 19:50:15,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1330. [2019-10-13 19:50:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2019-10-13 19:50:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1856 transitions. [2019-10-13 19:50:15,121 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1856 transitions. Word has length 180 [2019-10-13 19:50:15,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:15,122 INFO L462 AbstractCegarLoop]: Abstraction has 1330 states and 1856 transitions. [2019-10-13 19:50:15,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:15,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1856 transitions. [2019-10-13 19:50:15,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-13 19:50:15,127 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:15,127 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-13 19:50:15,127 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:15,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:15,128 INFO L82 PathProgramCache]: Analyzing trace with hash -310719076, now seen corresponding path program 1 times [2019-10-13 19:50:15,128 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:15,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870670808] [2019-10-13 19:50:15,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:15,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:15,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:15,220 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-13 19:50:15,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870670808] [2019-10-13 19:50:15,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:15,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:15,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403420174] [2019-10-13 19:50:15,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:15,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:15,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:15,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:15,222 INFO L87 Difference]: Start difference. First operand 1330 states and 1856 transitions. Second operand 3 states. [2019-10-13 19:50:15,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:15,384 INFO L93 Difference]: Finished difference Result 2784 states and 3876 transitions. [2019-10-13 19:50:15,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:15,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-13 19:50:15,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:15,392 INFO L225 Difference]: With dead ends: 2784 [2019-10-13 19:50:15,392 INFO L226 Difference]: Without dead ends: 1466 [2019-10-13 19:50:15,395 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-13 19:50:15,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2019-10-13 19:50:15,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1454. [2019-10-13 19:50:15,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2019-10-13 19:50:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2000 transitions. [2019-10-13 19:50:15,431 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2000 transitions. Word has length 180 [2019-10-13 19:50:15,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:15,431 INFO L462 AbstractCegarLoop]: Abstraction has 1454 states and 2000 transitions. [2019-10-13 19:50:15,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2000 transitions. [2019-10-13 19:50:15,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-13 19:50:15,436 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:15,436 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-13 19:50:15,436 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:15,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:15,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2035334682, now seen corresponding path program 1 times [2019-10-13 19:50:15,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:15,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361575887] [2019-10-13 19:50:15,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:15,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:15,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:15,523 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-13 19:50:15,524 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361575887] [2019-10-13 19:50:15,524 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:15,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:15,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149543735] [2019-10-13 19:50:15,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:15,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:15,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:15,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:15,526 INFO L87 Difference]: Start difference. First operand 1454 states and 2000 transitions. Second operand 3 states. [2019-10-13 19:50:15,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:15,576 INFO L93 Difference]: Finished difference Result 4334 states and 5964 transitions. [2019-10-13 19:50:15,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:15,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-10-13 19:50:15,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:15,590 INFO L225 Difference]: With dead ends: 4334 [2019-10-13 19:50:15,590 INFO L226 Difference]: Without dead ends: 2892 [2019-10-13 19:50:15,594 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-13 19:50:15,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2019-10-13 19:50:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2890. [2019-10-13 19:50:15,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2890 states. [2019-10-13 19:50:15,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 3975 transitions. [2019-10-13 19:50:15,706 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 3975 transitions. Word has length 210 [2019-10-13 19:50:15,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:15,707 INFO L462 AbstractCegarLoop]: Abstraction has 2890 states and 3975 transitions. [2019-10-13 19:50:15,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:15,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 3975 transitions. [2019-10-13 19:50:15,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-13 19:50:15,714 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:15,714 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-13 19:50:15,715 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:15,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:15,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1698932836, now seen corresponding path program 1 times [2019-10-13 19:50:15,715 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:15,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531134710] [2019-10-13 19:50:15,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:15,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:15,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:15,792 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-13 19:50:15,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531134710] [2019-10-13 19:50:15,793 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:15,793 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:15,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260833175] [2019-10-13 19:50:15,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:15,794 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:15,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:15,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:15,794 INFO L87 Difference]: Start difference. First operand 2890 states and 3975 transitions. Second operand 3 states. [2019-10-13 19:50:15,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:15,973 INFO L93 Difference]: Finished difference Result 6068 states and 8346 transitions. [2019-10-13 19:50:15,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:15,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-10-13 19:50:15,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:15,994 INFO L225 Difference]: With dead ends: 6068 [2019-10-13 19:50:15,995 INFO L226 Difference]: Without dead ends: 3190 [2019-10-13 19:50:16,002 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-13 19:50:16,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2019-10-13 19:50:16,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 3174. [2019-10-13 19:50:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3174 states. [2019-10-13 19:50:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 4299 transitions. [2019-10-13 19:50:16,108 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 4299 transitions. Word has length 210 [2019-10-13 19:50:16,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:16,109 INFO L462 AbstractCegarLoop]: Abstraction has 3174 states and 4299 transitions. [2019-10-13 19:50:16,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:16,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 4299 transitions. [2019-10-13 19:50:16,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-13 19:50:16,123 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:16,124 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-13 19:50:16,124 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:16,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:16,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1588238652, now seen corresponding path program 1 times [2019-10-13 19:50:16,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:16,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599223099] [2019-10-13 19:50:16,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:16,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:16,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:16,365 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-13 19:50:16,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599223099] [2019-10-13 19:50:16,366 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:16,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:16,367 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061622447] [2019-10-13 19:50:16,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:16,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:16,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:16,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:16,369 INFO L87 Difference]: Start difference. First operand 3174 states and 4299 transitions. Second operand 3 states. [2019-10-13 19:50:16,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:16,594 INFO L93 Difference]: Finished difference Result 6484 states and 8778 transitions. [2019-10-13 19:50:16,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:16,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-10-13 19:50:16,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:16,614 INFO L225 Difference]: With dead ends: 6484 [2019-10-13 19:50:16,615 INFO L226 Difference]: Without dead ends: 3322 [2019-10-13 19:50:16,626 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-13 19:50:16,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2019-10-13 19:50:16,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3306. [2019-10-13 19:50:16,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3306 states. [2019-10-13 19:50:16,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 4451 transitions. [2019-10-13 19:50:16,754 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 4451 transitions. Word has length 234 [2019-10-13 19:50:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:16,755 INFO L462 AbstractCegarLoop]: Abstraction has 3306 states and 4451 transitions. [2019-10-13 19:50:16,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 4451 transitions. [2019-10-13 19:50:16,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-13 19:50:16,764 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:16,764 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-13 19:50:16,765 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:16,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:16,765 INFO L82 PathProgramCache]: Analyzing trace with hash -736614694, now seen corresponding path program 1 times [2019-10-13 19:50:16,765 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:16,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113785107] [2019-10-13 19:50:16,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:16,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:16,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:16,873 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-13 19:50:16,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113785107] [2019-10-13 19:50:16,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:16,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:16,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615796997] [2019-10-13 19:50:16,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:16,881 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:16,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:16,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:16,882 INFO L87 Difference]: Start difference. First operand 3306 states and 4451 transitions. Second operand 3 states. [2019-10-13 19:50:17,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:17,115 INFO L93 Difference]: Finished difference Result 7000 states and 9558 transitions. [2019-10-13 19:50:17,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:17,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-10-13 19:50:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:17,140 INFO L225 Difference]: With dead ends: 7000 [2019-10-13 19:50:17,140 INFO L226 Difference]: Without dead ends: 3706 [2019-10-13 19:50:17,150 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-13 19:50:17,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2019-10-13 19:50:17,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3618. [2019-10-13 19:50:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3618 states. [2019-10-13 19:50:17,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3618 states to 3618 states and 4819 transitions. [2019-10-13 19:50:17,277 INFO L78 Accepts]: Start accepts. Automaton has 3618 states and 4819 transitions. Word has length 245 [2019-10-13 19:50:17,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:17,278 INFO L462 AbstractCegarLoop]: Abstraction has 3618 states and 4819 transitions. [2019-10-13 19:50:17,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:17,278 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 4819 transitions. [2019-10-13 19:50:17,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-13 19:50:17,302 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:17,302 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-13 19:50:17,303 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:17,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:17,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1168177660, now seen corresponding path program 1 times [2019-10-13 19:50:17,304 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:17,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458216364] [2019-10-13 19:50:17,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:17,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:17,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:17,498 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-13 19:50:17,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458216364] [2019-10-13 19:50:17,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:17,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:17,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881147441] [2019-10-13 19:50:17,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:17,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:17,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:17,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:17,501 INFO L87 Difference]: Start difference. First operand 3618 states and 4819 transitions. Second operand 3 states. [2019-10-13 19:50:17,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:17,776 INFO L93 Difference]: Finished difference Result 7632 states and 10102 transitions. [2019-10-13 19:50:17,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:17,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-10-13 19:50:17,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:17,813 INFO L225 Difference]: With dead ends: 7632 [2019-10-13 19:50:17,813 INFO L226 Difference]: Without dead ends: 4026 [2019-10-13 19:50:17,823 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-13 19:50:17,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4026 states. [2019-10-13 19:50:17,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4026 to 3738. [2019-10-13 19:50:17,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3738 states. [2019-10-13 19:50:17,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 4963 transitions. [2019-10-13 19:50:17,976 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 4963 transitions. Word has length 259 [2019-10-13 19:50:17,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:17,977 INFO L462 AbstractCegarLoop]: Abstraction has 3738 states and 4963 transitions. [2019-10-13 19:50:17,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:17,977 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 4963 transitions. [2019-10-13 19:50:17,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-13 19:50:17,996 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:17,996 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-13 19:50:17,997 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:17,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:17,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1227839833, now seen corresponding path program 1 times [2019-10-13 19:50:17,999 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:17,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914814768] [2019-10-13 19:50:18,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:18,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:18,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:18,286 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-13 19:50:18,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914814768] [2019-10-13 19:50:18,287 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:18,287 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:18,287 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275956562] [2019-10-13 19:50:18,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:18,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:18,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:18,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:18,289 INFO L87 Difference]: Start difference. First operand 3738 states and 4963 transitions. Second operand 3 states. [2019-10-13 19:50:18,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:18,371 INFO L93 Difference]: Finished difference Result 10686 states and 14265 transitions. [2019-10-13 19:50:18,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:18,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-10-13 19:50:18,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:18,396 INFO L225 Difference]: With dead ends: 10686 [2019-10-13 19:50:18,396 INFO L226 Difference]: Without dead ends: 6960 [2019-10-13 19:50:18,405 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-13 19:50:18,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6960 states. [2019-10-13 19:50:18,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6960 to 6958. [2019-10-13 19:50:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6958 states. [2019-10-13 19:50:18,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6958 states to 6958 states and 9293 transitions. [2019-10-13 19:50:18,570 INFO L78 Accepts]: Start accepts. Automaton has 6958 states and 9293 transitions. Word has length 260 [2019-10-13 19:50:18,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:18,571 INFO L462 AbstractCegarLoop]: Abstraction has 6958 states and 9293 transitions. [2019-10-13 19:50:18,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:18,572 INFO L276 IsEmpty]: Start isEmpty. Operand 6958 states and 9293 transitions. [2019-10-13 19:50:18,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-13 19:50:18,584 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:18,585 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-13 19:50:18,585 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:18,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:18,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818967, now seen corresponding path program 1 times [2019-10-13 19:50:18,586 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:18,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220273886] [2019-10-13 19:50:18,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:18,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:18,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:18,749 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-13 19:50:18,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220273886] [2019-10-13 19:50:18,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:18,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:18,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693303634] [2019-10-13 19:50:18,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:18,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:18,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:18,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:18,753 INFO L87 Difference]: Start difference. First operand 6958 states and 9293 transitions. Second operand 3 states. [2019-10-13 19:50:19,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:19,030 INFO L93 Difference]: Finished difference Result 13912 states and 18562 transitions. [2019-10-13 19:50:19,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:19,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-10-13 19:50:19,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:19,055 INFO L225 Difference]: With dead ends: 13912 [2019-10-13 19:50:19,055 INFO L226 Difference]: Without dead ends: 6966 [2019-10-13 19:50:19,075 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-13 19:50:19,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6966 states. [2019-10-13 19:50:19,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6966 to 6934. [2019-10-13 19:50:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6934 states. [2019-10-13 19:50:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6934 states to 6934 states and 9077 transitions. [2019-10-13 19:50:19,279 INFO L78 Accepts]: Start accepts. Automaton has 6934 states and 9077 transitions. Word has length 261 [2019-10-13 19:50:19,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:19,280 INFO L462 AbstractCegarLoop]: Abstraction has 6934 states and 9077 transitions. [2019-10-13 19:50:19,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:19,280 INFO L276 IsEmpty]: Start isEmpty. Operand 6934 states and 9077 transitions. [2019-10-13 19:50:19,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-13 19:50:19,304 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:19,305 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-13 19:50:19,305 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:19,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:19,306 INFO L82 PathProgramCache]: Analyzing trace with hash 747649846, now seen corresponding path program 1 times [2019-10-13 19:50:19,306 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:19,306 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074654013] [2019-10-13 19:50:19,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:19,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:19,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:19,501 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-13 19:50:19,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074654013] [2019-10-13 19:50:19,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161031739] [2019-10-13 19:50:19,502 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-13 19:50:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:19,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 19:50:19,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:19,857 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-13 19:50:19,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:50:19,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-13 19:50:19,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841125364] [2019-10-13 19:50:19,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:50:19,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:19,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:50:19,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:19,860 INFO L87 Difference]: Start difference. First operand 6934 states and 9077 transitions. Second operand 4 states. [2019-10-13 19:50:20,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:20,124 INFO L93 Difference]: Finished difference Result 14034 states and 18379 transitions. [2019-10-13 19:50:20,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:50:20,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2019-10-13 19:50:20,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:20,142 INFO L225 Difference]: With dead ends: 14034 [2019-10-13 19:50:20,142 INFO L226 Difference]: Without dead ends: 7084 [2019-10-13 19:50:20,156 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-13 19:50:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7084 states. [2019-10-13 19:50:20,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7084 to 6940. [2019-10-13 19:50:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6940 states. [2019-10-13 19:50:20,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6940 states to 6940 states and 9085 transitions. [2019-10-13 19:50:20,342 INFO L78 Accepts]: Start accepts. Automaton has 6940 states and 9085 transitions. Word has length 284 [2019-10-13 19:50:20,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:20,343 INFO L462 AbstractCegarLoop]: Abstraction has 6940 states and 9085 transitions. [2019-10-13 19:50:20,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:50:20,343 INFO L276 IsEmpty]: Start isEmpty. Operand 6940 states and 9085 transitions. [2019-10-13 19:50:20,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-13 19:50:20,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:20,358 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-13 19:50:20,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:20,564 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:20,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:20,565 INFO L82 PathProgramCache]: Analyzing trace with hash -39333344, now seen corresponding path program 1 times [2019-10-13 19:50:20,565 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:20,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10528236] [2019-10-13 19:50:20,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:20,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:20,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:20,817 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-13 19:50:20,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10528236] [2019-10-13 19:50:20,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734801379] [2019-10-13 19:50:20,825 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-13 19:50:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:20,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:50:21,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:21,280 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-13 19:50:21,280 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:50:21,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:50:21,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178087637] [2019-10-13 19:50:21,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:50:21,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:21,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:50:21,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:50:21,282 INFO L87 Difference]: Start difference. First operand 6940 states and 9085 transitions. Second operand 4 states. [2019-10-13 19:50:21,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:21,938 INFO L93 Difference]: Finished difference Result 13792 states and 18051 transitions. [2019-10-13 19:50:21,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:21,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 297 [2019-10-13 19:50:21,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:21,971 INFO L225 Difference]: With dead ends: 13792 [2019-10-13 19:50:21,972 INFO L226 Difference]: Without dead ends: 10410 [2019-10-13 19:50:21,986 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-13 19:50:22,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10410 states. [2019-10-13 19:50:22,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10410 to 8844. [2019-10-13 19:50:22,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8844 states. [2019-10-13 19:50:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8844 states to 8844 states and 11583 transitions. [2019-10-13 19:50:22,335 INFO L78 Accepts]: Start accepts. Automaton has 8844 states and 11583 transitions. Word has length 297 [2019-10-13 19:50:22,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:22,336 INFO L462 AbstractCegarLoop]: Abstraction has 8844 states and 11583 transitions. [2019-10-13 19:50:22,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:50:22,336 INFO L276 IsEmpty]: Start isEmpty. Operand 8844 states and 11583 transitions. [2019-10-13 19:50:22,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-13 19:50:22,359 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:22,359 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-13 19:50:22,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:22,565 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:22,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:22,567 INFO L82 PathProgramCache]: Analyzing trace with hash 280748442, now seen corresponding path program 2 times [2019-10-13 19:50:22,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:22,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039427583] [2019-10-13 19:50:22,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:22,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:22,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:22,782 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-13 19:50:22,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039427583] [2019-10-13 19:50:22,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064921716] [2019-10-13 19:50:22,784 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-13 19:50:22,938 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:50:22,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:50:22,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:50:22,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:23,119 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-13 19:50:23,119 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:50:23,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:50:23,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059442824] [2019-10-13 19:50:23,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:23,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:23,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:23,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:23,121 INFO L87 Difference]: Start difference. First operand 8844 states and 11583 transitions. Second operand 3 states. [2019-10-13 19:50:23,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:23,397 INFO L93 Difference]: Finished difference Result 18102 states and 23742 transitions. [2019-10-13 19:50:23,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:23,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-10-13 19:50:23,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:23,426 INFO L225 Difference]: With dead ends: 18102 [2019-10-13 19:50:23,426 INFO L226 Difference]: Without dead ends: 9276 [2019-10-13 19:50:23,451 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-13 19:50:23,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9276 states. [2019-10-13 19:50:23,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9276 to 9204. [2019-10-13 19:50:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9204 states. [2019-10-13 19:50:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9204 states to 9204 states and 12063 transitions. [2019-10-13 19:50:23,736 INFO L78 Accepts]: Start accepts. Automaton has 9204 states and 12063 transitions. Word has length 310 [2019-10-13 19:50:23,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:23,737 INFO L462 AbstractCegarLoop]: Abstraction has 9204 states and 12063 transitions. [2019-10-13 19:50:23,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 9204 states and 12063 transitions. [2019-10-13 19:50:23,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-10-13 19:50:23,769 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:23,769 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-13 19:50:23,976 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:23,976 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:23,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:23,977 INFO L82 PathProgramCache]: Analyzing trace with hash 670685447, now seen corresponding path program 1 times [2019-10-13 19:50:23,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:23,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699051729] [2019-10-13 19:50:23,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:23,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:23,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:24,154 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-13 19:50:24,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699051729] [2019-10-13 19:50:24,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929732488] [2019-10-13 19:50:24,155 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-13 19:50:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:24,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:50:24,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:24,629 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-13 19:50:24,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:50:24,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:50:24,631 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844666691] [2019-10-13 19:50:24,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:24,632 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:24,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:24,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:24,633 INFO L87 Difference]: Start difference. First operand 9204 states and 12063 transitions. Second operand 3 states. [2019-10-13 19:50:24,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:24,853 INFO L93 Difference]: Finished difference Result 22958 states and 30072 transitions. [2019-10-13 19:50:24,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:24,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 377 [2019-10-13 19:50:24,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:24,887 INFO L225 Difference]: With dead ends: 22958 [2019-10-13 19:50:24,887 INFO L226 Difference]: Without dead ends: 13772 [2019-10-13 19:50:24,909 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-13 19:50:24,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13772 states. [2019-10-13 19:50:25,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13772 to 13772. [2019-10-13 19:50:25,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13772 states. [2019-10-13 19:50:25,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13772 states to 13772 states and 18009 transitions. [2019-10-13 19:50:25,205 INFO L78 Accepts]: Start accepts. Automaton has 13772 states and 18009 transitions. Word has length 377 [2019-10-13 19:50:25,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:25,206 INFO L462 AbstractCegarLoop]: Abstraction has 13772 states and 18009 transitions. [2019-10-13 19:50:25,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:25,206 INFO L276 IsEmpty]: Start isEmpty. Operand 13772 states and 18009 transitions. [2019-10-13 19:50:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-10-13 19:50:25,233 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:25,233 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-13 19:50:25,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:25,438 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:25,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:25,438 INFO L82 PathProgramCache]: Analyzing trace with hash 2068327023, now seen corresponding path program 1 times [2019-10-13 19:50:25,438 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:25,438 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078210436] [2019-10-13 19:50:25,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:25,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:25,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:25,699 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-13 19:50:25,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078210436] [2019-10-13 19:50:25,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367716205] [2019-10-13 19:50:25,700 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-13 19:50:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:25,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:50:25,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:25,945 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-13 19:50:25,946 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:50:25,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:50:25,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855985324] [2019-10-13 19:50:25,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:50:25,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:25,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:50:25,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:50:25,949 INFO L87 Difference]: Start difference. First operand 13772 states and 18009 transitions. Second operand 4 states. [2019-10-13 19:50:26,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:26,479 INFO L93 Difference]: Finished difference Result 30950 states and 40277 transitions. [2019-10-13 19:50:26,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:50:26,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2019-10-13 19:50:26,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:26,520 INFO L225 Difference]: With dead ends: 30950 [2019-10-13 19:50:26,520 INFO L226 Difference]: Without dead ends: 17184 [2019-10-13 19:50:26,546 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-13 19:50:26,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17184 states. [2019-10-13 19:50:26,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17184 to 14520. [2019-10-13 19:50:26,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14520 states. [2019-10-13 19:50:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14520 states to 14520 states and 18571 transitions. [2019-10-13 19:50:26,977 INFO L78 Accepts]: Start accepts. Automaton has 14520 states and 18571 transitions. Word has length 379 [2019-10-13 19:50:26,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:26,978 INFO L462 AbstractCegarLoop]: Abstraction has 14520 states and 18571 transitions. [2019-10-13 19:50:26,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:50:26,978 INFO L276 IsEmpty]: Start isEmpty. Operand 14520 states and 18571 transitions. [2019-10-13 19:50:27,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-10-13 19:50:27,010 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:27,010 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-13 19:50:27,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:27,223 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:27,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:27,224 INFO L82 PathProgramCache]: Analyzing trace with hash -725462501, now seen corresponding path program 1 times [2019-10-13 19:50:27,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:27,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007124536] [2019-10-13 19:50:27,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:27,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:27,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:27,397 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-13 19:50:27,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007124536] [2019-10-13 19:50:27,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:27,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:27,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727061255] [2019-10-13 19:50:27,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:27,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:27,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:27,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:27,399 INFO L87 Difference]: Start difference. First operand 14520 states and 18571 transitions. Second operand 3 states. [2019-10-13 19:50:27,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:27,737 INFO L93 Difference]: Finished difference Result 27597 states and 34926 transitions. [2019-10-13 19:50:27,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:27,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-10-13 19:50:27,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:27,749 INFO L225 Difference]: With dead ends: 27597 [2019-10-13 19:50:27,749 INFO L226 Difference]: Without dead ends: 5535 [2019-10-13 19:50:27,775 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-13 19:50:27,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states. [2019-10-13 19:50:27,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 5194. [2019-10-13 19:50:27,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5194 states. [2019-10-13 19:50:27,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5194 states to 5194 states and 6445 transitions. [2019-10-13 19:50:27,875 INFO L78 Accepts]: Start accepts. Automaton has 5194 states and 6445 transitions. Word has length 418 [2019-10-13 19:50:27,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:27,875 INFO L462 AbstractCegarLoop]: Abstraction has 5194 states and 6445 transitions. [2019-10-13 19:50:27,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:27,876 INFO L276 IsEmpty]: Start isEmpty. Operand 5194 states and 6445 transitions. [2019-10-13 19:50:27,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-10-13 19:50:27,890 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:27,890 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-13 19:50:27,891 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:27,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:27,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1911375163, now seen corresponding path program 1 times [2019-10-13 19:50:27,892 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:27,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71930857] [2019-10-13 19:50:27,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:27,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:27,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:28,243 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-13 19:50:28,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71930857] [2019-10-13 19:50:28,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400887460] [2019-10-13 19:50:28,244 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-13 19:50:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:28,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:50:28,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:28,508 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-13 19:50:28,509 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:50:28,509 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:50:28,509 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310452582] [2019-10-13 19:50:28,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:50:28,510 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:28,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:50:28,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:50:28,511 INFO L87 Difference]: Start difference. First operand 5194 states and 6445 transitions. Second operand 4 states. [2019-10-13 19:50:28,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:28,679 INFO L93 Difference]: Finished difference Result 5690 states and 7070 transitions. [2019-10-13 19:50:28,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:50:28,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 447 [2019-10-13 19:50:28,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:28,684 INFO L225 Difference]: With dead ends: 5690 [2019-10-13 19:50:28,684 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:50:28,690 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-13 19:50:28,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:50:28,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:50:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:50:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:50:28,691 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 447 [2019-10-13 19:50:28,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:28,692 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:50:28,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:50:28,692 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:50:28,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:50:28,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:28,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:50:29,778 WARN L191 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 454 DAG size of output: 93 [2019-10-13 19:50:30,314 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 23 [2019-10-13 19:50:30,546 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 19 [2019-10-13 19:50:31,358 WARN L191 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2019-10-13 19:50:31,663 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-13 19:50:31,663 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:50:31,663 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-10-13 19:50:31,663 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2019-10-13 19:50:31,663 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 491) no Hoare annotation was computed. [2019-10-13 19:50:31,663 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 502) no Hoare annotation was computed. [2019-10-13 19:50:31,663 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 513) no Hoare annotation was computed. [2019-10-13 19:50:31,663 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2019-10-13 19:50:31,664 INFO L443 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2019-10-13 19:50:31,664 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-13 19:50:31,664 INFO L446 ceAbstractionStarter]: At program point L534(lines 96 535) the Hoare annotation is: true [2019-10-13 19:50:31,664 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2019-10-13 19:50:31,664 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 240) no Hoare annotation was computed. [2019-10-13 19:50:31,664 INFO L443 ceAbstractionStarter]: For program point L270-2(lines 270 274) no Hoare annotation was computed. [2019-10-13 19:50:31,665 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 307) no Hoare annotation was computed. [2019-10-13 19:50:31,665 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-13 19:50:31,665 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 490) no Hoare annotation was computed. [2019-10-13 19:50:31,665 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 501) no Hoare annotation was computed. [2019-10-13 19:50:31,668 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 512) no Hoare annotation was computed. [2019-10-13 19:50:31,668 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-13 19:50:31,668 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2019-10-13 19:50:31,669 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 450) no Hoare annotation was computed. [2019-10-13 19:50:31,669 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 420) no Hoare annotation was computed. [2019-10-13 19:50:31,669 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 406 420) no Hoare annotation was computed. [2019-10-13 19:50:31,669 INFO L443 ceAbstractionStarter]: For program point L439-2(lines 439 450) no Hoare annotation was computed. [2019-10-13 19:50:31,669 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 489) no Hoare annotation was computed. [2019-10-13 19:50:31,669 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 500) no Hoare annotation was computed. [2019-10-13 19:50:31,669 INFO L443 ceAbstractionStarter]: For program point L109(lines 109 511) no Hoare annotation was computed. [2019-10-13 19:50:31,669 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 541) no Hoare annotation was computed. [2019-10-13 19:50:31,670 INFO L443 ceAbstractionStarter]: For program point L539-2(lines 539 541) no Hoare annotation was computed. [2019-10-13 19:50:31,670 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-13 19:50:31,670 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 344) no Hoare annotation was computed. [2019-10-13 19:50:31,670 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 212) no Hoare annotation was computed. [2019-10-13 19:50:31,672 INFO L443 ceAbstractionStarter]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2019-10-13 19:50:31,672 INFO L443 ceAbstractionStarter]: For program point L376(lines 376 378) no Hoare annotation was computed. [2019-10-13 19:50:31,672 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 488) no Hoare annotation was computed. [2019-10-13 19:50:31,672 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 499) no Hoare annotation was computed. [2019-10-13 19:50:31,672 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 510) no Hoare annotation was computed. [2019-10-13 19:50:31,672 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 416) no Hoare annotation was computed. [2019-10-13 19:50:31,672 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-13 19:50:31,673 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2019-10-13 19:50:31,673 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 314) no Hoare annotation was computed. [2019-10-13 19:50:31,674 INFO L443 ceAbstractionStarter]: For program point L279-1(lines 279 289) no Hoare annotation was computed. [2019-10-13 19:50:31,674 INFO L439 ceAbstractionStarter]: At program point L313(lines 75 545) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2019-10-13 19:50:31,674 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 487) no Hoare annotation was computed. [2019-10-13 19:50:31,674 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 498) no Hoare annotation was computed. [2019-10-13 19:50:31,674 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 509) no Hoare annotation was computed. [2019-10-13 19:50:31,674 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2019-10-13 19:50:31,675 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-13 19:50:31,675 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-10-13 19:50:31,675 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-13 19:50:31,675 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2019-10-13 19:50:31,675 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 251) no Hoare annotation was computed. [2019-10-13 19:50:31,675 INFO L443 ceAbstractionStarter]: For program point L249-2(lines 200 479) no Hoare annotation was computed. [2019-10-13 19:50:31,675 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 546) the Hoare annotation is: true [2019-10-13 19:50:31,676 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 386) no Hoare annotation was computed. [2019-10-13 19:50:31,676 INFO L443 ceAbstractionStarter]: For program point L382-2(lines 200 479) no Hoare annotation was computed. [2019-10-13 19:50:31,676 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2019-10-13 19:50:31,676 INFO L443 ceAbstractionStarter]: For program point L283-2(lines 281 289) no Hoare annotation was computed. [2019-10-13 19:50:31,676 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 486) no Hoare annotation was computed. [2019-10-13 19:50:31,676 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 497) no Hoare annotation was computed. [2019-10-13 19:50:31,676 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 508) no Hoare annotation was computed. [2019-10-13 19:50:31,676 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 531) no Hoare annotation was computed. [2019-10-13 19:50:31,677 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-13 19:50:31,677 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-13 19:50:31,677 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-10-13 19:50:31,677 INFO L443 ceAbstractionStarter]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2019-10-13 19:50:31,677 INFO L443 ceAbstractionStarter]: For program point L516(lines 516 530) no Hoare annotation was computed. [2019-10-13 19:50:31,677 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2019-10-13 19:50:31,677 INFO L443 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2019-10-13 19:50:31,677 INFO L443 ceAbstractionStarter]: For program point L517-2(lines 516 530) no Hoare annotation was computed. [2019-10-13 19:50:31,678 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 485) no Hoare annotation was computed. [2019-10-13 19:50:31,678 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 496) no Hoare annotation was computed. [2019-10-13 19:50:31,678 INFO L443 ceAbstractionStarter]: For program point L121(lines 121 507) no Hoare annotation was computed. [2019-10-13 19:50:31,678 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 232) no Hoare annotation was computed. [2019-10-13 19:50:31,678 INFO L443 ceAbstractionStarter]: For program point L221-2(lines 200 479) no Hoare annotation was computed. [2019-10-13 19:50:31,678 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 521) no Hoare annotation was computed. [2019-10-13 19:50:31,678 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 360) no Hoare annotation was computed. [2019-10-13 19:50:31,678 INFO L443 ceAbstractionStarter]: For program point L355-2(lines 355 360) no Hoare annotation was computed. [2019-10-13 19:50:31,679 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 226) no Hoare annotation was computed. [2019-10-13 19:50:31,679 INFO L443 ceAbstractionStarter]: For program point L190(lines 190 484) no Hoare annotation was computed. [2019-10-13 19:50:31,679 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 495) no Hoare annotation was computed. [2019-10-13 19:50:31,679 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 506) no Hoare annotation was computed. [2019-10-13 19:50:31,679 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 95) no Hoare annotation was computed. [2019-10-13 19:50:31,679 INFO L443 ceAbstractionStarter]: For program point L455-1(lines 455 457) no Hoare annotation was computed. [2019-10-13 19:50:31,679 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 259) no Hoare annotation was computed. [2019-10-13 19:50:31,679 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-13 19:50:31,680 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-13 19:50:31,680 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 94) no Hoare annotation was computed. [2019-10-13 19:50:31,680 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 546) no Hoare annotation was computed. [2019-10-13 19:50:31,681 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-10-13 19:50:31,681 INFO L443 ceAbstractionStarter]: For program point L324-2(lines 200 479) no Hoare annotation was computed. [2019-10-13 19:50:31,681 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 543) no Hoare annotation was computed. [2019-10-13 19:50:31,681 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 546) no Hoare annotation was computed. [2019-10-13 19:50:31,681 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 394) no Hoare annotation was computed. [2019-10-13 19:50:31,681 INFO L443 ceAbstractionStarter]: For program point L193(lines 193 483) no Hoare annotation was computed. [2019-10-13 19:50:31,681 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 494) no Hoare annotation was computed. [2019-10-13 19:50:31,682 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 505) no Hoare annotation was computed. [2019-10-13 19:50:31,682 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 528) no Hoare annotation was computed. [2019-10-13 19:50:31,682 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-10-13 19:50:31,682 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-13 19:50:31,682 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-13 19:50:31,682 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 428) no Hoare annotation was computed. [2019-10-13 19:50:31,683 INFO L443 ceAbstractionStarter]: For program point L196(lines 196 482) no Hoare annotation was computed. [2019-10-13 19:50:31,685 INFO L443 ceAbstractionStarter]: For program point L163(lines 163 493) no Hoare annotation was computed. [2019-10-13 19:50:31,685 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 504) no Hoare annotation was computed. [2019-10-13 19:50:31,685 INFO L443 ceAbstractionStarter]: For program point L97-1(lines 75 545) no Hoare annotation was computed. [2019-10-13 19:50:31,685 INFO L443 ceAbstractionStarter]: For program point L461(lines 461 463) no Hoare annotation was computed. [2019-10-13 19:50:31,685 INFO L443 ceAbstractionStarter]: For program point L461-2(lines 461 463) no Hoare annotation was computed. [2019-10-13 19:50:31,686 INFO L443 ceAbstractionStarter]: For program point L296(lines 296 298) no Hoare annotation was computed. [2019-10-13 19:50:31,686 INFO L443 ceAbstractionStarter]: For program point L296-2(lines 200 479) no Hoare annotation was computed. [2019-10-13 19:50:31,686 INFO L446 ceAbstractionStarter]: At program point L197(lines 196 482) the Hoare annotation is: true [2019-10-13 19:50:31,686 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-13 19:50:31,686 INFO L443 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-10-13 19:50:31,686 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-10-13 19:50:31,687 INFO L443 ceAbstractionStarter]: For program point L429-2(lines 429 433) no Hoare annotation was computed. [2019-10-13 19:50:31,687 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 334) no Hoare annotation was computed. [2019-10-13 19:50:31,687 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2019-10-13 19:50:31,687 INFO L443 ceAbstractionStarter]: For program point L330-2(lines 330 334) no Hoare annotation was computed. [2019-10-13 19:50:31,687 INFO L443 ceAbstractionStarter]: For program point L264-2(lines 200 479) no Hoare annotation was computed. [2019-10-13 19:50:31,687 INFO L446 ceAbstractionStarter]: At program point L199(lines 198 482) the Hoare annotation is: true [2019-10-13 19:50:31,687 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 492) no Hoare annotation was computed. [2019-10-13 19:50:31,687 INFO L443 ceAbstractionStarter]: For program point L133(lines 133 503) no Hoare annotation was computed. [2019-10-13 19:50:31,688 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 514) no Hoare annotation was computed. [2019-10-13 19:50:31,688 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-13 19:50:31,688 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-13 19:50:31,688 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:50:31,688 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 19:50:31,688 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 19:50:31,688 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:50:31,689 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 547 557) the Hoare annotation is: true [2019-10-13 19:50:31,689 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 547 557) no Hoare annotation was computed. [2019-10-13 19:50:31,689 INFO L446 ceAbstractionStarter]: At program point L553(line 553) the Hoare annotation is: true [2019-10-13 19:50:31,689 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 547 557) no Hoare annotation was computed. [2019-10-13 19:50:31,689 INFO L443 ceAbstractionStarter]: For program point L553-1(line 553) no Hoare annotation was computed. [2019-10-13 19:50:31,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:50:31 BoogieIcfgContainer [2019-10-13 19:50:31,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 19:50:31,744 INFO L168 Benchmark]: Toolchain (without parser) took 21469.68 ms. Allocated memory was 146.3 MB in the beginning and 1.0 GB in the end (delta: 874.0 MB). Free memory was 103.5 MB in the beginning and 728.6 MB in the end (delta: -625.1 MB). Peak memory consumption was 765.8 MB. Max. memory is 7.1 GB. [2019-10-13 19:50:31,744 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.3 MB. Free memory is still 122.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-13 19:50:31,745 INFO L168 Benchmark]: CACSL2BoogieTranslator took 503.89 ms. Allocated memory was 146.3 MB in the beginning and 202.4 MB in the end (delta: 56.1 MB). Free memory was 103.1 MB in the beginning and 177.3 MB in the end (delta: -74.2 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-10-13 19:50:31,747 INFO L168 Benchmark]: Boogie Preprocessor took 52.49 ms. Allocated memory is still 202.4 MB. Free memory was 177.3 MB in the beginning and 175.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-10-13 19:50:31,747 INFO L168 Benchmark]: RCFGBuilder took 802.61 ms. Allocated memory is still 202.4 MB. Free memory was 175.4 MB in the beginning and 128.9 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-10-13 19:50:31,748 INFO L168 Benchmark]: TraceAbstraction took 20106.07 ms. Allocated memory was 202.4 MB in the beginning and 1.0 GB in the end (delta: 817.9 MB). Free memory was 128.9 MB in the beginning and 728.6 MB in the end (delta: -599.7 MB). Peak memory consumption was 735.0 MB. Max. memory is 7.1 GB. [2019-10-13 19:50:31,755 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.24 ms. Allocated memory is still 146.3 MB. Free memory is still 122.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 503.89 ms. Allocated memory was 146.3 MB in the beginning and 202.4 MB in the end (delta: 56.1 MB). Free memory was 103.1 MB in the beginning and 177.3 MB in the end (delta: -74.2 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.49 ms. Allocated memory is still 202.4 MB. Free memory was 177.3 MB in the beginning and 175.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 802.61 ms. Allocated memory is still 202.4 MB. Free memory was 175.4 MB in the beginning and 128.9 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20106.07 ms. Allocated memory was 202.4 MB in the beginning and 1.0 GB in the end (delta: 817.9 MB). Free memory was 128.9 MB in the beginning and 728.6 MB in the end (delta: -599.7 MB). Peak memory consumption was 735.0 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.9s, OverallIterations: 26, TraceHistogramMax: 18, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.7s, HoareTripleCheckerStatistics: 5320 SDtfs, 1895 SDslu, 2986 SDs, 0 SdLazy, 2527 SolverSat, 460 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s 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: 3.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 5371 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 505 NumberOfFragments, 750 HoareAnnotationTreeSize, 26 FomulaSimplifications, 40117 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 26 FomulaSimplificationsInter, 4509 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.6s 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...