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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_4.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:30:52,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:30:52,195 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:30:52,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:30:52,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:30:52,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:30:52,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:30:52,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:30:52,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:30:52,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:30:52,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:30:52,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:30:52,216 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:30:52,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:30:52,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:30:52,219 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:30:52,220 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:30:52,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:30:52,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:30:52,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:30:52,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:30:52,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:30:52,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:30:52,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:30:52,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:30:52,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:30:52,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:30:52,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:30:52,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:30:52,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:30:52,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:30:52,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:30:52,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:30:52,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:30:52,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:30:52,247 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:30:52,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:30:52,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:30:52,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:30:52,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:30:52,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:30:52,252 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:30:52,276 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:30:52,277 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:30:52,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:30:52,279 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:30:52,279 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:30:52,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:30:52,279 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:30:52,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:30:52,280 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:30:52,280 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:30:52,281 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:30:52,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:30:52,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:30:52,282 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:30:52,282 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:30:52,282 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:30:52,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:30:52,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:30:52,283 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:30:52,283 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:30:52,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:30:52,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:30:52,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:30:52,284 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:30:52,284 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:30:52,284 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:30:52,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:30:52,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:30:52,285 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:30:52,562 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:30:52,575 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:30:52,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:30:52,580 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:30:52,580 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:30:52,581 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_4.cil-1.c [2019-10-15 03:30:52,639 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d47080f0/7d1a127eb0714f7384193c3dab149cb9/FLAG695171381 [2019-10-15 03:30:53,127 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:30:53,127 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_4.cil-1.c [2019-10-15 03:30:53,139 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d47080f0/7d1a127eb0714f7384193c3dab149cb9/FLAG695171381 [2019-10-15 03:30:53,384 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d47080f0/7d1a127eb0714f7384193c3dab149cb9 [2019-10-15 03:30:53,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:30:53,400 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:30:53,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:30:53,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:30:53,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:30:53,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:30:53" (1/1) ... [2019-10-15 03:30:53,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53d6129f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:53, skipping insertion in model container [2019-10-15 03:30:53,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:30:53" (1/1) ... [2019-10-15 03:30:53,420 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:30:53,480 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:30:53,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:30:53,741 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:30:53,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:30:53,901 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:30:53,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:53 WrapperNode [2019-10-15 03:30:53,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:30:53,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:30:53,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:30:53,903 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:30:53,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:53" (1/1) ... [2019-10-15 03:30:53,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:53" (1/1) ... [2019-10-15 03:30:53,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:53" (1/1) ... [2019-10-15 03:30:53,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:53" (1/1) ... [2019-10-15 03:30:53,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:53" (1/1) ... [2019-10-15 03:30:53,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:53" (1/1) ... [2019-10-15 03:30:53,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:53" (1/1) ... [2019-10-15 03:30:53,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:30:53,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:30:53,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:30:53,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:30:53,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:30:54,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:30:54,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:30:54,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-15 03:30:54,027 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:30:54,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:30:54,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:30:54,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:30:54,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 03:30:54,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 03:30:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-15 03:30:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:30:54,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:30:54,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:30:54,181 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:30:54,727 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-15 03:30:54,727 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-15 03:30:55,090 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:30:55,090 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:30:55,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:30:55 BoogieIcfgContainer [2019-10-15 03:30:55,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:30:55,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:30:55,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:30:55,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:30:55,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:30:53" (1/3) ... [2019-10-15 03:30:55,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22eb50c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:30:55, skipping insertion in model container [2019-10-15 03:30:55,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:30:53" (2/3) ... [2019-10-15 03:30:55,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22eb50c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:30:55, skipping insertion in model container [2019-10-15 03:30:55,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:30:55" (3/3) ... [2019-10-15 03:30:55,104 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil-1.c [2019-10-15 03:30:55,114 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:30:55,123 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:30:55,134 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:30:55,163 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:30:55,163 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:30:55,164 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:30:55,164 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:30:55,164 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:30:55,164 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:30:55,164 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:30:55,165 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:30:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2019-10-15 03:30:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 03:30:55,190 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:55,191 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] [2019-10-15 03:30:55,192 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:55,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:55,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1309660893, now seen corresponding path program 1 times [2019-10-15 03:30:55,204 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:55,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807628860] [2019-10-15 03:30:55,204 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:55,204 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:55,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:55,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:30:55,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807628860] [2019-10-15 03:30:55,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:55,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:55,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099605638] [2019-10-15 03:30:55,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:55,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:55,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:55,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:55,468 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 5 states. [2019-10-15 03:30:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:55,773 INFO L93 Difference]: Finished difference Result 212 states and 355 transitions. [2019-10-15 03:30:55,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:55,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-15 03:30:55,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:55,790 INFO L225 Difference]: With dead ends: 212 [2019-10-15 03:30:55,791 INFO L226 Difference]: Without dead ends: 114 [2019-10-15 03:30:55,796 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:30:55,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-15 03:30:55,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 109. [2019-10-15 03:30:55,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-15 03:30:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 162 transitions. [2019-10-15 03:30:55,887 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 162 transitions. Word has length 25 [2019-10-15 03:30:55,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:55,888 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 162 transitions. [2019-10-15 03:30:55,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:55,889 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 162 transitions. [2019-10-15 03:30:55,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 03:30:55,892 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:55,892 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] [2019-10-15 03:30:55,893 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:55,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:55,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1949467789, now seen corresponding path program 1 times [2019-10-15 03:30:55,895 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:55,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710927180] [2019-10-15 03:30:55,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:55,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:55,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:30:56,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710927180] [2019-10-15 03:30:56,054 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:56,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:56,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982869698] [2019-10-15 03:30:56,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:56,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:56,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:56,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:56,058 INFO L87 Difference]: Start difference. First operand 109 states and 162 transitions. Second operand 5 states. [2019-10-15 03:30:56,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:56,269 INFO L93 Difference]: Finished difference Result 238 states and 362 transitions. [2019-10-15 03:30:56,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:56,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-15 03:30:56,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:56,272 INFO L225 Difference]: With dead ends: 238 [2019-10-15 03:30:56,273 INFO L226 Difference]: Without dead ends: 136 [2019-10-15 03:30:56,275 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:30:56,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-15 03:30:56,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 131. [2019-10-15 03:30:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-15 03:30:56,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 201 transitions. [2019-10-15 03:30:56,302 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 201 transitions. Word has length 26 [2019-10-15 03:30:56,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:56,303 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 201 transitions. [2019-10-15 03:30:56,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 201 transitions. [2019-10-15 03:30:56,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 03:30:56,307 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:56,307 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:30:56,308 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:56,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:56,309 INFO L82 PathProgramCache]: Analyzing trace with hash -979646552, now seen corresponding path program 1 times [2019-10-15 03:30:56,309 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:56,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145221954] [2019-10-15 03:30:56,310 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:56,310 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:56,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:56,416 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:30:56,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145221954] [2019-10-15 03:30:56,417 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:56,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:56,417 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731418927] [2019-10-15 03:30:56,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:56,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:56,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:56,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:56,420 INFO L87 Difference]: Start difference. First operand 131 states and 201 transitions. Second operand 5 states. [2019-10-15 03:30:56,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:56,628 INFO L93 Difference]: Finished difference Result 276 states and 431 transitions. [2019-10-15 03:30:56,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:56,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-15 03:30:56,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:56,631 INFO L225 Difference]: With dead ends: 276 [2019-10-15 03:30:56,631 INFO L226 Difference]: Without dead ends: 152 [2019-10-15 03:30:56,632 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:30:56,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-15 03:30:56,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-10-15 03:30:56,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-15 03:30:56,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 233 transitions. [2019-10-15 03:30:56,645 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 233 transitions. Word has length 43 [2019-10-15 03:30:56,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:56,645 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 233 transitions. [2019-10-15 03:30:56,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:56,645 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 233 transitions. [2019-10-15 03:30:56,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 03:30:56,647 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:56,648 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:30:56,648 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:56,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:56,648 INFO L82 PathProgramCache]: Analyzing trace with hash -2026732904, now seen corresponding path program 1 times [2019-10-15 03:30:56,649 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:56,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004249642] [2019-10-15 03:30:56,649 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:56,649 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:56,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:56,705 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:30:56,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004249642] [2019-10-15 03:30:56,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:56,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:56,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844749124] [2019-10-15 03:30:56,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:56,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:56,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:56,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:56,708 INFO L87 Difference]: Start difference. First operand 150 states and 233 transitions. Second operand 5 states. [2019-10-15 03:30:56,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:56,893 INFO L93 Difference]: Finished difference Result 295 states and 461 transitions. [2019-10-15 03:30:56,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:56,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-15 03:30:56,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:56,896 INFO L225 Difference]: With dead ends: 295 [2019-10-15 03:30:56,896 INFO L226 Difference]: Without dead ends: 152 [2019-10-15 03:30:56,897 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:30:56,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-15 03:30:56,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-10-15 03:30:56,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-15 03:30:56,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 231 transitions. [2019-10-15 03:30:56,917 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 231 transitions. Word has length 44 [2019-10-15 03:30:56,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:56,917 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 231 transitions. [2019-10-15 03:30:56,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:56,918 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 231 transitions. [2019-10-15 03:30:56,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:30:56,923 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:56,924 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-10-15 03:30:56,924 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:56,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:56,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1558077918, now seen corresponding path program 1 times [2019-10-15 03:30:56,925 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:56,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646216694] [2019-10-15 03:30:56,925 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:56,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:56,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:57,026 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-15 03:30:57,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646216694] [2019-10-15 03:30:57,027 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:57,027 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:57,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193403718] [2019-10-15 03:30:57,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:57,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:57,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:57,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:57,029 INFO L87 Difference]: Start difference. First operand 150 states and 231 transitions. Second operand 5 states. [2019-10-15 03:30:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:57,214 INFO L93 Difference]: Finished difference Result 314 states and 490 transitions. [2019-10-15 03:30:57,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:57,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-15 03:30:57,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:57,216 INFO L225 Difference]: With dead ends: 314 [2019-10-15 03:30:57,216 INFO L226 Difference]: Without dead ends: 171 [2019-10-15 03:30:57,217 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:30:57,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-15 03:30:57,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-10-15 03:30:57,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-15 03:30:57,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 258 transitions. [2019-10-15 03:30:57,239 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 258 transitions. Word has length 59 [2019-10-15 03:30:57,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:57,239 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 258 transitions. [2019-10-15 03:30:57,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:57,240 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 258 transitions. [2019-10-15 03:30:57,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 03:30:57,241 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:57,242 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:30:57,242 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:57,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:57,247 INFO L82 PathProgramCache]: Analyzing trace with hash -901074578, now seen corresponding path program 1 times [2019-10-15 03:30:57,250 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:57,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401558604] [2019-10-15 03:30:57,250 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:57,250 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:57,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-15 03:30:57,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401558604] [2019-10-15 03:30:57,319 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:57,319 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:57,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827325180] [2019-10-15 03:30:57,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:57,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:57,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:57,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:57,322 INFO L87 Difference]: Start difference. First operand 167 states and 258 transitions. Second operand 5 states. [2019-10-15 03:30:57,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:57,498 INFO L93 Difference]: Finished difference Result 331 states and 514 transitions. [2019-10-15 03:30:57,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:57,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-15 03:30:57,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:57,500 INFO L225 Difference]: With dead ends: 331 [2019-10-15 03:30:57,500 INFO L226 Difference]: Without dead ends: 171 [2019-10-15 03:30:57,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:30:57,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-15 03:30:57,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-10-15 03:30:57,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-15 03:30:57,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 255 transitions. [2019-10-15 03:30:57,510 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 255 transitions. Word has length 60 [2019-10-15 03:30:57,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:57,510 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 255 transitions. [2019-10-15 03:30:57,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:57,511 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 255 transitions. [2019-10-15 03:30:57,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-15 03:30:57,512 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:57,512 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:30:57,512 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:57,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:57,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1631946930, now seen corresponding path program 1 times [2019-10-15 03:30:57,513 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:57,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138005637] [2019-10-15 03:30:57,513 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:57,514 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:57,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:57,606 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:30:57,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138005637] [2019-10-15 03:30:57,607 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:57,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:57,607 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794682325] [2019-10-15 03:30:57,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:57,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:57,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:57,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:57,610 INFO L87 Difference]: Start difference. First operand 167 states and 255 transitions. Second operand 5 states. [2019-10-15 03:30:57,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:57,814 INFO L93 Difference]: Finished difference Result 366 states and 570 transitions. [2019-10-15 03:30:57,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:57,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-15 03:30:57,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:57,817 INFO L225 Difference]: With dead ends: 366 [2019-10-15 03:30:57,817 INFO L226 Difference]: Without dead ends: 205 [2019-10-15 03:30:57,818 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:30:57,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-10-15 03:30:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-10-15 03:30:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-15 03:30:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 320 transitions. [2019-10-15 03:30:57,830 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 320 transitions. Word has length 62 [2019-10-15 03:30:57,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:57,831 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 320 transitions. [2019-10-15 03:30:57,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 320 transitions. [2019-10-15 03:30:57,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-15 03:30:57,832 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:57,832 INFO L380 BasicCegarLoop]: trace histogram [4, 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] [2019-10-15 03:30:57,833 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:57,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:57,833 INFO L82 PathProgramCache]: Analyzing trace with hash -344124922, now seen corresponding path program 1 times [2019-10-15 03:30:57,833 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:57,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157014933] [2019-10-15 03:30:57,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:57,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:57,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:57,901 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-15 03:30:57,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157014933] [2019-10-15 03:30:57,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:57,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:57,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326282993] [2019-10-15 03:30:57,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:57,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:57,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:57,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:57,903 INFO L87 Difference]: Start difference. First operand 205 states and 320 transitions. Second operand 5 states. [2019-10-15 03:30:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:58,052 INFO L93 Difference]: Finished difference Result 420 states and 661 transitions. [2019-10-15 03:30:58,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:58,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-10-15 03:30:58,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:58,054 INFO L225 Difference]: With dead ends: 420 [2019-10-15 03:30:58,054 INFO L226 Difference]: Without dead ends: 222 [2019-10-15 03:30:58,055 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:30:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-15 03:30:58,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-10-15 03:30:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-15 03:30:58,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 341 transitions. [2019-10-15 03:30:58,066 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 341 transitions. Word has length 72 [2019-10-15 03:30:58,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:58,066 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 341 transitions. [2019-10-15 03:30:58,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:58,067 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 341 transitions. [2019-10-15 03:30:58,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-15 03:30:58,068 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:58,068 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-15 03:30:58,068 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:58,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:58,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1456817110, now seen corresponding path program 1 times [2019-10-15 03:30:58,069 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:58,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49273893] [2019-10-15 03:30:58,069 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:58,069 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:58,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:58,130 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-15 03:30:58,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49273893] [2019-10-15 03:30:58,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:58,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:58,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112099750] [2019-10-15 03:30:58,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:58,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:58,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:58,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:58,132 INFO L87 Difference]: Start difference. First operand 220 states and 341 transitions. Second operand 5 states. [2019-10-15 03:30:58,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:58,281 INFO L93 Difference]: Finished difference Result 435 states and 677 transitions. [2019-10-15 03:30:58,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:58,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-10-15 03:30:58,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:58,283 INFO L225 Difference]: With dead ends: 435 [2019-10-15 03:30:58,283 INFO L226 Difference]: Without dead ends: 222 [2019-10-15 03:30:58,284 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:30:58,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-15 03:30:58,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-10-15 03:30:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-15 03:30:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 336 transitions. [2019-10-15 03:30:58,295 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 336 transitions. Word has length 73 [2019-10-15 03:30:58,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:58,296 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 336 transitions. [2019-10-15 03:30:58,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:58,296 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 336 transitions. [2019-10-15 03:30:58,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-15 03:30:58,297 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:58,297 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:30:58,297 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:58,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:58,298 INFO L82 PathProgramCache]: Analyzing trace with hash 164906511, now seen corresponding path program 1 times [2019-10-15 03:30:58,298 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:58,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347817174] [2019-10-15 03:30:58,298 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:58,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:58,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-15 03:30:58,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347817174] [2019-10-15 03:30:58,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:58,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:58,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431008830] [2019-10-15 03:30:58,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:58,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:58,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:58,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:58,345 INFO L87 Difference]: Start difference. First operand 220 states and 336 transitions. Second operand 5 states. [2019-10-15 03:30:58,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:58,498 INFO L93 Difference]: Finished difference Result 448 states and 689 transitions. [2019-10-15 03:30:58,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:58,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-10-15 03:30:58,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:58,500 INFO L225 Difference]: With dead ends: 448 [2019-10-15 03:30:58,500 INFO L226 Difference]: Without dead ends: 235 [2019-10-15 03:30:58,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:30:58,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-15 03:30:58,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2019-10-15 03:30:58,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-15 03:30:58,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 352 transitions. [2019-10-15 03:30:58,513 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 352 transitions. Word has length 83 [2019-10-15 03:30:58,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:58,513 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 352 transitions. [2019-10-15 03:30:58,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:58,514 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 352 transitions. [2019-10-15 03:30:58,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-15 03:30:58,515 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:58,515 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2019-10-15 03:30:58,515 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:58,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:58,515 INFO L82 PathProgramCache]: Analyzing trace with hash 331093727, now seen corresponding path program 1 times [2019-10-15 03:30:58,516 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:58,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772619732] [2019-10-15 03:30:58,516 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:58,516 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:58,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:58,557 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-15 03:30:58,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772619732] [2019-10-15 03:30:58,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:30:58,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:30:58,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953275502] [2019-10-15 03:30:58,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:30:58,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:58,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:30:58,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:30:58,559 INFO L87 Difference]: Start difference. First operand 233 states and 352 transitions. Second operand 5 states. [2019-10-15 03:30:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:58,729 INFO L93 Difference]: Finished difference Result 461 states and 699 transitions. [2019-10-15 03:30:58,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:30:58,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-10-15 03:30:58,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:58,732 INFO L225 Difference]: With dead ends: 461 [2019-10-15 03:30:58,732 INFO L226 Difference]: Without dead ends: 235 [2019-10-15 03:30:58,733 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:30:58,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-15 03:30:58,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2019-10-15 03:30:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-15 03:30:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 346 transitions. [2019-10-15 03:30:58,747 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 346 transitions. Word has length 84 [2019-10-15 03:30:58,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:58,747 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 346 transitions. [2019-10-15 03:30:58,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:30:58,747 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 346 transitions. [2019-10-15 03:30:58,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 03:30:58,748 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:58,749 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 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] [2019-10-15 03:30:58,749 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:58,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:58,749 INFO L82 PathProgramCache]: Analyzing trace with hash -918567538, now seen corresponding path program 1 times [2019-10-15 03:30:58,750 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:58,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574139427] [2019-10-15 03:30:58,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:58,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:58,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-15 03:30:58,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574139427] [2019-10-15 03:30:58,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758198950] [2019-10-15 03:30:58,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:30:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:58,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 03:30:58,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:30:59,018 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-15 03:30:59,018 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:30:59,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:30:59,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:30:59,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:30:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-15 03:30:59,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:30:59,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 5] total 7 [2019-10-15 03:30:59,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275348770] [2019-10-15 03:30:59,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:30:59,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:30:59,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:30:59,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:30:59,085 INFO L87 Difference]: Start difference. First operand 233 states and 346 transitions. Second operand 3 states. [2019-10-15 03:30:59,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:30:59,118 INFO L93 Difference]: Finished difference Result 458 states and 684 transitions. [2019-10-15 03:30:59,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:30:59,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-15 03:30:59,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:30:59,122 INFO L225 Difference]: With dead ends: 458 [2019-10-15 03:30:59,122 INFO L226 Difference]: Without dead ends: 456 [2019-10-15 03:30:59,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 179 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:30:59,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-10-15 03:30:59,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2019-10-15 03:30:59,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-15 03:30:59,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 682 transitions. [2019-10-15 03:30:59,146 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 682 transitions. Word has length 92 [2019-10-15 03:30:59,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:30:59,147 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 682 transitions. [2019-10-15 03:30:59,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:30:59,147 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 682 transitions. [2019-10-15 03:30:59,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-15 03:30:59,149 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:30:59,149 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 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] [2019-10-15 03:30:59,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:30:59,362 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:30:59,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:30:59,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1704935648, now seen corresponding path program 1 times [2019-10-15 03:30:59,363 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:30:59,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524872854] [2019-10-15 03:30:59,364 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:59,364 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:30:59,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:30:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:30:59,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524872854] [2019-10-15 03:30:59,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396929642] [2019-10-15 03:30:59,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:30:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:30:59,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-15 03:30:59,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:30:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:30:59,587 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:30:59,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:30:59,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:30:59,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:30:59,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:30:59,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:30:59,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:30:59,707 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-15 03:30:59,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2093811494] [2019-10-15 03:30:59,736 INFO L162 IcfgInterpreter]: Started Sifa with 44 locations of interest [2019-10-15 03:30:59,736 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:30:59,742 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:30:59,750 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:30:59,751 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:30:59,813 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-15 03:30:59,828 INFO L199 IcfgInterpreter]: Interpreting procedure ssl3_connect with input of size 3 for LOIs [2019-10-15 03:31:02,142 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 215 [2019-10-15 03:31:02,983 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 203 [2019-10-15 03:31:08,703 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 234 [2019-10-15 03:31:08,965 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 222