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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh/s3_clnt.blast.03.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:52:48,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:52:48,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:52:48,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:52:48,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:52:48,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:52:48,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:52:48,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:52:48,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:52:48,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:52:48,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:52:48,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:52:48,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:52:48,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:52:48,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:52:48,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:52:48,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:52:48,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:52:48,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:52:48,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:52:48,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:52:48,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:52:48,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:52:48,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:52:48,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:52:48,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:52:48,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:52:48,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:52:48,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:52:48,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:52:48,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:52:48,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:52:48,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:52:48,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:52:48,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:52:48,214 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:52:48,215 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:52:48,215 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:52:48,215 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:52:48,216 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:52:48,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:52:48,222 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:52:48,246 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:52:48,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:52:48,247 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:52:48,248 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:52:48,248 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:52:48,248 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:52:48,249 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:52:48,249 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:52:48,249 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:52:48,249 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:52:48,251 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:52:48,251 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:52:48,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:52:48,252 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:52:48,252 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:52:48,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:52:48,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:52:48,252 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:52:48,253 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:52:48,253 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:52:48,253 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:52:48,253 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:52:48,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:52:48,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:52:48,254 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:52:48,254 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:52:48,254 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:52:48,254 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:52:48,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:52:48,255 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:52:48,284 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:52:48,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:52:48,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:52:48,303 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:52:48,304 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:52:48,305 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_clnt.blast.03.i.cil-1.c [2019-09-09 05:52:48,386 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2dc6a4ac/15c4473d9a9d4f60b219f434ef72f594/FLAG9c0056298 [2019-09-09 05:52:48,994 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:52:48,995 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_clnt.blast.03.i.cil-1.c [2019-09-09 05:52:49,022 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2dc6a4ac/15c4473d9a9d4f60b219f434ef72f594/FLAG9c0056298 [2019-09-09 05:52:49,254 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2dc6a4ac/15c4473d9a9d4f60b219f434ef72f594 [2019-09-09 05:52:49,263 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:52:49,265 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:52:49,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:52:49,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:52:49,270 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:52:49,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:52:49" (1/1) ... [2019-09-09 05:52:49,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@613a2159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:49, skipping insertion in model container [2019-09-09 05:52:49,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:52:49" (1/1) ... [2019-09-09 05:52:49,284 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:52:49,365 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:52:49,898 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:52:49,914 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:52:50,122 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:52:50,153 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:52:50,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:50 WrapperNode [2019-09-09 05:52:50,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:52:50,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:52:50,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:52:50,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:52:50,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:50" (1/1) ... [2019-09-09 05:52:50,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:50" (1/1) ... [2019-09-09 05:52:50,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:50" (1/1) ... [2019-09-09 05:52:50,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:50" (1/1) ... [2019-09-09 05:52:50,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:50" (1/1) ... [2019-09-09 05:52:50,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:50" (1/1) ... [2019-09-09 05:52:50,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:50" (1/1) ... [2019-09-09 05:52:50,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:52:50,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:52:50,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:52:50,370 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:52:50,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:52:50,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:52:50,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:52:50,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2019-09-09 05:52:50,473 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2019-09-09 05:52:50,473 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:52:50,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-09 05:52:50,474 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-09 05:52:50,474 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-09 05:52:50,474 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-09 05:52:50,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:52:50,475 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-09 05:52:50,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:52:50,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:52:50,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:52:50,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:52:50,476 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-09 05:52:50,476 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2019-09-09 05:52:50,476 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-09 05:52:50,477 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-09 05:52:50,477 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2019-09-09 05:52:50,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-09 05:52:50,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-09 05:52:50,478 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:52:50,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-09 05:52:50,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-09 05:52:50,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-09 05:52:50,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-09 05:52:50,479 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-09 05:52:50,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-09 05:52:50,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:52:50,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-09 05:52:50,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-09 05:52:50,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-09 05:52:50,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:52:50,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-09 05:52:50,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-09 05:52:50,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-09 05:52:50,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-09 05:52:50,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-09 05:52:51,165 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:51,914 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-09 05:52:51,914 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-09 05:52:51,932 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:52:51,933 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:52:51,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:52:51 BoogieIcfgContainer [2019-09-09 05:52:51,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:52:51,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:52:51,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:52:51,939 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:52:51,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:52:49" (1/3) ... [2019-09-09 05:52:51,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5440145c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:52:51, skipping insertion in model container [2019-09-09 05:52:51,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:50" (2/3) ... [2019-09-09 05:52:51,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5440145c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:52:51, skipping insertion in model container [2019-09-09 05:52:51,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:52:51" (3/3) ... [2019-09-09 05:52:51,942 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-1.c [2019-09-09 05:52:51,953 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:52:51,964 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:52:51,982 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:52:52,010 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:52:52,010 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:52:52,010 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:52:52,011 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:52:52,011 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:52:52,011 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:52:52,011 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:52:52,011 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:52:52,038 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2019-09-09 05:52:52,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-09 05:52:52,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:52,058 INFO L399 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, 1] [2019-09-09 05:52:52,063 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:52,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:52,069 INFO L82 PathProgramCache]: Analyzing trace with hash 461476132, now seen corresponding path program 1 times [2019-09-09 05:52:52,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:52,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:52,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:52,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:52,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:52,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:52:52,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:52,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:52:52,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:52,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:52:52,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:52:52,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:52:52,530 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2019-09-09 05:52:52,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:52,691 INFO L93 Difference]: Finished difference Result 254 states and 414 transitions. [2019-09-09 05:52:52,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:52:52,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-09 05:52:52,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:52,717 INFO L225 Difference]: With dead ends: 254 [2019-09-09 05:52:52,717 INFO L226 Difference]: Without dead ends: 219 [2019-09-09 05:52:52,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:52:52,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-09 05:52:52,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2019-09-09 05:52:52,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-09 05:52:52,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2019-09-09 05:52:52,789 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 30 [2019-09-09 05:52:52,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:52,790 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2019-09-09 05:52:52,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:52:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2019-09-09 05:52:52,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-09 05:52:52,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:52,793 INFO L399 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, 1, 1] [2019-09-09 05:52:52,794 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:52,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:52,794 INFO L82 PathProgramCache]: Analyzing trace with hash -147745042, now seen corresponding path program 1 times [2019-09-09 05:52:52,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:52,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:52,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:52,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:52,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:52,961 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:52:52,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:52,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:52:52,961 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:52,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:52:52,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:52:52,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:52:52,966 INFO L87 Difference]: Start difference. First operand 219 states and 323 transitions. Second operand 3 states. [2019-09-09 05:52:53,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:53,044 INFO L93 Difference]: Finished difference Result 318 states and 469 transitions. [2019-09-09 05:52:53,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:52:53,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-09 05:52:53,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:53,051 INFO L225 Difference]: With dead ends: 318 [2019-09-09 05:52:53,051 INFO L226 Difference]: Without dead ends: 318 [2019-09-09 05:52:53,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:52:53,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-09 05:52:53,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2019-09-09 05:52:53,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-09 05:52:53,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 469 transitions. [2019-09-09 05:52:53,095 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 469 transitions. Word has length 45 [2019-09-09 05:52:53,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:53,096 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 469 transitions. [2019-09-09 05:52:53,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:52:53,096 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 469 transitions. [2019-09-09 05:52:53,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:52:53,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:53,108 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:52:53,109 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:53,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:53,109 INFO L82 PathProgramCache]: Analyzing trace with hash -592195955, now seen corresponding path program 1 times [2019-09-09 05:52:53,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:53,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:53,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:53,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:53,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:53,282 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:53,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:53,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:53,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:53,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:53,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:53,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:53,284 INFO L87 Difference]: Start difference. First operand 318 states and 469 transitions. Second operand 4 states. [2019-09-09 05:52:53,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:53,954 INFO L93 Difference]: Finished difference Result 504 states and 746 transitions. [2019-09-09 05:52:53,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:53,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-09 05:52:53,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:53,959 INFO L225 Difference]: With dead ends: 504 [2019-09-09 05:52:53,959 INFO L226 Difference]: Without dead ends: 504 [2019-09-09 05:52:53,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:53,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-09 05:52:53,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 368. [2019-09-09 05:52:53,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-09 05:52:53,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 555 transitions. [2019-09-09 05:52:53,998 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 555 transitions. Word has length 63 [2019-09-09 05:52:54,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:54,000 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 555 transitions. [2019-09-09 05:52:54,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:54,001 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 555 transitions. [2019-09-09 05:52:54,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:52:54,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:54,004 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:52:54,005 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:54,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:54,005 INFO L82 PathProgramCache]: Analyzing trace with hash -726209461, now seen corresponding path program 1 times [2019-09-09 05:52:54,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:54,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:54,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:54,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:54,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:54,113 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:54,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:54,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:54,114 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:54,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:54,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:54,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:54,115 INFO L87 Difference]: Start difference. First operand 368 states and 555 transitions. Second operand 4 states. [2019-09-09 05:52:54,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:54,487 INFO L93 Difference]: Finished difference Result 454 states and 681 transitions. [2019-09-09 05:52:54,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:54,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-09 05:52:54,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:54,491 INFO L225 Difference]: With dead ends: 454 [2019-09-09 05:52:54,491 INFO L226 Difference]: Without dead ends: 454 [2019-09-09 05:52:54,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-09 05:52:54,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 408. [2019-09-09 05:52:54,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-09 05:52:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 623 transitions. [2019-09-09 05:52:54,505 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 623 transitions. Word has length 63 [2019-09-09 05:52:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:54,505 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 623 transitions. [2019-09-09 05:52:54,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:54,506 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 623 transitions. [2019-09-09 05:52:54,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:52:54,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:54,509 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:52:54,509 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:54,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:54,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1182891182, now seen corresponding path program 1 times [2019-09-09 05:52:54,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:54,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:54,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:54,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:54,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:54,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:54,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:54,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:54,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:54,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:54,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:54,631 INFO L87 Difference]: Start difference. First operand 408 states and 623 transitions. Second operand 4 states. [2019-09-09 05:52:55,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:55,114 INFO L93 Difference]: Finished difference Result 536 states and 804 transitions. [2019-09-09 05:52:55,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:55,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-09 05:52:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:55,123 INFO L225 Difference]: With dead ends: 536 [2019-09-09 05:52:55,123 INFO L226 Difference]: Without dead ends: 536 [2019-09-09 05:52:55,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:55,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-09-09 05:52:55,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 410. [2019-09-09 05:52:55,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:52:55,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 625 transitions. [2019-09-09 05:52:55,171 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 625 transitions. Word has length 64 [2019-09-09 05:52:55,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:55,171 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 625 transitions. [2019-09-09 05:52:55,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:55,172 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 625 transitions. [2019-09-09 05:52:55,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-09 05:52:55,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:55,174 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1] [2019-09-09 05:52:55,174 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:55,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:55,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1433744923, now seen corresponding path program 1 times [2019-09-09 05:52:55,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:55,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:55,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:55,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:55,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:55,258 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:55,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:55,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:55,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:55,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:55,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:55,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:55,261 INFO L87 Difference]: Start difference. First operand 410 states and 625 transitions. Second operand 4 states. [2019-09-09 05:52:55,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:55,752 INFO L93 Difference]: Finished difference Result 534 states and 800 transitions. [2019-09-09 05:52:55,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:55,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-09 05:52:55,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:55,757 INFO L225 Difference]: With dead ends: 534 [2019-09-09 05:52:55,759 INFO L226 Difference]: Without dead ends: 534 [2019-09-09 05:52:55,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:55,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-09 05:52:55,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-09 05:52:55,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:52:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 623 transitions. [2019-09-09 05:52:55,772 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 623 transitions. Word has length 77 [2019-09-09 05:52:55,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:55,772 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 623 transitions. [2019-09-09 05:52:55,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 623 transitions. [2019-09-09 05:52:55,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-09 05:52:55,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:55,775 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:52:55,775 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:55,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:55,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1752241927, now seen corresponding path program 1 times [2019-09-09 05:52:55,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:55,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:55,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:55,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:55,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:55,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:55,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:55,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:55,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:55,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:55,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:55,895 INFO L87 Difference]: Start difference. First operand 410 states and 623 transitions. Second operand 4 states. [2019-09-09 05:52:56,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:56,369 INFO L93 Difference]: Finished difference Result 534 states and 798 transitions. [2019-09-09 05:52:56,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:56,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-09 05:52:56,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:56,374 INFO L225 Difference]: With dead ends: 534 [2019-09-09 05:52:56,374 INFO L226 Difference]: Without dead ends: 534 [2019-09-09 05:52:56,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:56,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-09 05:52:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-09 05:52:56,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:52:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 621 transitions. [2019-09-09 05:52:56,389 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 621 transitions. Word has length 77 [2019-09-09 05:52:56,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:56,390 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 621 transitions. [2019-09-09 05:52:56,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:56,390 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 621 transitions. [2019-09-09 05:52:56,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-09 05:52:56,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:56,392 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1] [2019-09-09 05:52:56,392 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:56,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:56,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1831863075, now seen corresponding path program 1 times [2019-09-09 05:52:56,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:56,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:56,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:56,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:56,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:56,532 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:56,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:56,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:56,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:56,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:56,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:56,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:56,534 INFO L87 Difference]: Start difference. First operand 410 states and 621 transitions. Second operand 4 states. [2019-09-09 05:52:56,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:56,830 INFO L93 Difference]: Finished difference Result 454 states and 675 transitions. [2019-09-09 05:52:56,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:56,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-09 05:52:56,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:56,835 INFO L225 Difference]: With dead ends: 454 [2019-09-09 05:52:56,835 INFO L226 Difference]: Without dead ends: 454 [2019-09-09 05:52:56,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:56,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-09 05:52:56,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-09 05:52:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:52:56,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 619 transitions. [2019-09-09 05:52:56,853 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 619 transitions. Word has length 77 [2019-09-09 05:52:56,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:56,853 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 619 transitions. [2019-09-09 05:52:56,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:56,854 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 619 transitions. [2019-09-09 05:52:56,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-09 05:52:56,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:56,864 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:52:56,865 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:56,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:56,865 INFO L82 PathProgramCache]: Analyzing trace with hash 722882629, now seen corresponding path program 1 times [2019-09-09 05:52:56,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:56,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:56,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:56,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:56,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:56,976 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:56,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:56,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:56,977 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:56,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:56,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:56,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:56,979 INFO L87 Difference]: Start difference. First operand 410 states and 619 transitions. Second operand 4 states. [2019-09-09 05:52:57,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:57,363 INFO L93 Difference]: Finished difference Result 454 states and 673 transitions. [2019-09-09 05:52:57,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:57,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-09 05:52:57,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:57,367 INFO L225 Difference]: With dead ends: 454 [2019-09-09 05:52:57,367 INFO L226 Difference]: Without dead ends: 454 [2019-09-09 05:52:57,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:57,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-09 05:52:57,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-09 05:52:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:52:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 617 transitions. [2019-09-09 05:52:57,381 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 617 transitions. Word has length 77 [2019-09-09 05:52:57,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:57,381 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 617 transitions. [2019-09-09 05:52:57,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 617 transitions. [2019-09-09 05:52:57,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-09 05:52:57,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:57,387 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:52:57,387 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:57,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:57,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1460682036, now seen corresponding path program 1 times [2019-09-09 05:52:57,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:57,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:57,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:57,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:57,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:57,496 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:57,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:57,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:57,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:57,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:57,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:57,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:57,499 INFO L87 Difference]: Start difference. First operand 410 states and 617 transitions. Second operand 4 states. [2019-09-09 05:52:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:57,951 INFO L93 Difference]: Finished difference Result 534 states and 792 transitions. [2019-09-09 05:52:57,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:57,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-09 05:52:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:57,956 INFO L225 Difference]: With dead ends: 534 [2019-09-09 05:52:57,956 INFO L226 Difference]: Without dead ends: 534 [2019-09-09 05:52:57,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-09 05:52:57,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-09 05:52:57,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:52:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 615 transitions. [2019-09-09 05:52:57,969 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 615 transitions. Word has length 78 [2019-09-09 05:52:57,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:57,969 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 615 transitions. [2019-09-09 05:52:57,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:57,969 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2019-09-09 05:52:57,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-09 05:52:57,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:57,972 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:52:57,972 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:57,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:57,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1160620953, now seen corresponding path program 1 times [2019-09-09 05:52:57,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:57,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:57,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:57,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:57,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:58,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:58,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:58,052 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:58,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:58,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:58,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:58,054 INFO L87 Difference]: Start difference. First operand 410 states and 615 transitions. Second operand 4 states. [2019-09-09 05:52:58,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:58,534 INFO L93 Difference]: Finished difference Result 534 states and 790 transitions. [2019-09-09 05:52:58,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:58,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-09 05:52:58,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:58,538 INFO L225 Difference]: With dead ends: 534 [2019-09-09 05:52:58,538 INFO L226 Difference]: Without dead ends: 534 [2019-09-09 05:52:58,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-09 05:52:58,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-09 05:52:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:52:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 613 transitions. [2019-09-09 05:52:58,549 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 613 transitions. Word has length 78 [2019-09-09 05:52:58,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:58,550 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 613 transitions. [2019-09-09 05:52:58,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 613 transitions. [2019-09-09 05:52:58,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-09 05:52:58,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:58,552 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:52:58,552 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:58,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:58,552 INFO L82 PathProgramCache]: Analyzing trace with hash 988918094, now seen corresponding path program 1 times [2019-09-09 05:52:58,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:58,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:58,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:58,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:58,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:58,615 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:58,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:58,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:58,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:58,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:58,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:58,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:58,617 INFO L87 Difference]: Start difference. First operand 410 states and 613 transitions. Second operand 4 states. [2019-09-09 05:52:58,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:58,889 INFO L93 Difference]: Finished difference Result 454 states and 667 transitions. [2019-09-09 05:52:58,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:58,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-09 05:52:58,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:58,893 INFO L225 Difference]: With dead ends: 454 [2019-09-09 05:52:58,893 INFO L226 Difference]: Without dead ends: 454 [2019-09-09 05:52:58,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:58,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-09 05:52:58,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-09 05:52:58,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:52:58,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 611 transitions. [2019-09-09 05:52:58,903 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 611 transitions. Word has length 78 [2019-09-09 05:52:58,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:58,903 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 611 transitions. [2019-09-09 05:52:58,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 611 transitions. [2019-09-09 05:52:58,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-09 05:52:58,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:58,905 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:52:58,906 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:58,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:58,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1288979177, now seen corresponding path program 1 times [2019-09-09 05:52:58,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:58,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:58,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:58,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:58,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:58,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:58,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:58,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:58,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:58,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:58,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:58,969 INFO L87 Difference]: Start difference. First operand 410 states and 611 transitions. Second operand 4 states. [2019-09-09 05:52:59,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:59,299 INFO L93 Difference]: Finished difference Result 454 states and 665 transitions. [2019-09-09 05:52:59,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:59,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-09 05:52:59,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:59,302 INFO L225 Difference]: With dead ends: 454 [2019-09-09 05:52:59,302 INFO L226 Difference]: Without dead ends: 454 [2019-09-09 05:52:59,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:59,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-09 05:52:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-09 05:52:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:52:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 609 transitions. [2019-09-09 05:52:59,313 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 609 transitions. Word has length 78 [2019-09-09 05:52:59,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:59,313 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 609 transitions. [2019-09-09 05:52:59,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 609 transitions. [2019-09-09 05:52:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:52:59,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:59,316 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:52:59,316 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:59,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:59,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2074470850, now seen corresponding path program 1 times [2019-09-09 05:52:59,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:59,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:59,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:59,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:59,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:59,382 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:59,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:59,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:59,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:59,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:59,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:59,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:59,384 INFO L87 Difference]: Start difference. First operand 410 states and 609 transitions. Second operand 4 states. [2019-09-09 05:52:59,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:59,840 INFO L93 Difference]: Finished difference Result 534 states and 784 transitions. [2019-09-09 05:52:59,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:52:59,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-09 05:52:59,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:59,845 INFO L225 Difference]: With dead ends: 534 [2019-09-09 05:52:59,845 INFO L226 Difference]: Without dead ends: 534 [2019-09-09 05:52:59,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:59,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-09 05:52:59,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-09 05:52:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:52:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 607 transitions. [2019-09-09 05:52:59,859 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 607 transitions. Word has length 79 [2019-09-09 05:52:59,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:59,859 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 607 transitions. [2019-09-09 05:52:59,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:52:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 607 transitions. [2019-09-09 05:52:59,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:52:59,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:59,862 INFO L399 BasicCegarLoop]: trace histogram [4, 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] [2019-09-09 05:52:59,862 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:59,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:59,862 INFO L82 PathProgramCache]: Analyzing trace with hash 784493186, now seen corresponding path program 1 times [2019-09-09 05:52:59,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:59,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:59,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:59,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:59,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:59,952 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:52:59,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:59,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:52:59,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:59,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:52:59,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:52:59,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:52:59,954 INFO L87 Difference]: Start difference. First operand 410 states and 607 transitions. Second operand 4 states. [2019-09-09 05:53:00,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:00,353 INFO L93 Difference]: Finished difference Result 528 states and 775 transitions. [2019-09-09 05:53:00,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:00,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-09 05:53:00,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:00,356 INFO L225 Difference]: With dead ends: 528 [2019-09-09 05:53:00,356 INFO L226 Difference]: Without dead ends: 528 [2019-09-09 05:53:00,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:00,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-09-09 05:53:00,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 410. [2019-09-09 05:53:00,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:53:00,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 605 transitions. [2019-09-09 05:53:00,367 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 605 transitions. Word has length 79 [2019-09-09 05:53:00,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:00,367 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 605 transitions. [2019-09-09 05:53:00,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:00,367 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 605 transitions. [2019-09-09 05:53:00,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:53:00,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:00,369 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:00,370 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:00,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:00,370 INFO L82 PathProgramCache]: Analyzing trace with hash 702663552, now seen corresponding path program 1 times [2019-09-09 05:53:00,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:00,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:00,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:00,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:00,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:00,433 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:53:00,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:00,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:00,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:00,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:00,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:00,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:00,436 INFO L87 Difference]: Start difference. First operand 410 states and 605 transitions. Second operand 4 states. [2019-09-09 05:53:00,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:00,719 INFO L93 Difference]: Finished difference Result 454 states and 659 transitions. [2019-09-09 05:53:00,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:00,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-09 05:53:00,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:00,723 INFO L225 Difference]: With dead ends: 454 [2019-09-09 05:53:00,723 INFO L226 Difference]: Without dead ends: 454 [2019-09-09 05:53:00,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:00,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-09 05:53:00,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-09 05:53:00,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:53:00,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 603 transitions. [2019-09-09 05:53:00,733 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 603 transitions. Word has length 79 [2019-09-09 05:53:00,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:00,733 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 603 transitions. [2019-09-09 05:53:00,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:00,733 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 603 transitions. [2019-09-09 05:53:00,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:53:00,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:00,735 INFO L399 BasicCegarLoop]: trace histogram [4, 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] [2019-09-09 05:53:00,735 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:00,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:00,736 INFO L82 PathProgramCache]: Analyzing trace with hash -587314112, now seen corresponding path program 1 times [2019-09-09 05:53:00,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:00,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:00,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:00,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:00,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:00,801 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:53:00,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:00,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:00,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:00,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:00,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:00,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:00,803 INFO L87 Difference]: Start difference. First operand 410 states and 603 transitions. Second operand 4 states. [2019-09-09 05:53:01,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:01,131 INFO L93 Difference]: Finished difference Result 448 states and 650 transitions. [2019-09-09 05:53:01,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:01,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-09 05:53:01,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:01,136 INFO L225 Difference]: With dead ends: 448 [2019-09-09 05:53:01,136 INFO L226 Difference]: Without dead ends: 448 [2019-09-09 05:53:01,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:01,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-09-09 05:53:01,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 410. [2019-09-09 05:53:01,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:53:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 601 transitions. [2019-09-09 05:53:01,149 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 601 transitions. Word has length 79 [2019-09-09 05:53:01,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:01,150 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 601 transitions. [2019-09-09 05:53:01,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:01,150 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 601 transitions. [2019-09-09 05:53:01,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:53:01,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:01,153 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:01,154 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:01,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:01,154 INFO L82 PathProgramCache]: Analyzing trace with hash 51641255, now seen corresponding path program 1 times [2019-09-09 05:53:01,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:01,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:01,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:01,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:01,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:53:01,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:01,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:01,247 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:01,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:01,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:01,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:01,248 INFO L87 Difference]: Start difference. First operand 410 states and 601 transitions. Second operand 4 states. [2019-09-09 05:53:01,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:01,682 INFO L93 Difference]: Finished difference Result 510 states and 747 transitions. [2019-09-09 05:53:01,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:01,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-09 05:53:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:01,687 INFO L225 Difference]: With dead ends: 510 [2019-09-09 05:53:01,687 INFO L226 Difference]: Without dead ends: 510 [2019-09-09 05:53:01,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:01,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-09-09 05:53:01,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 410. [2019-09-09 05:53:01,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:53:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 599 transitions. [2019-09-09 05:53:01,697 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 599 transitions. Word has length 80 [2019-09-09 05:53:01,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:01,697 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 599 transitions. [2019-09-09 05:53:01,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:01,697 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 599 transitions. [2019-09-09 05:53:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:53:01,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:01,699 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:01,699 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:01,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:01,700 INFO L82 PathProgramCache]: Analyzing trace with hash 475287977, now seen corresponding path program 1 times [2019-09-09 05:53:01,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:01,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:01,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:01,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:01,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:01,761 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:53:01,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:01,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:01,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:01,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:01,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:01,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:01,763 INFO L87 Difference]: Start difference. First operand 410 states and 599 transitions. Second operand 4 states. [2019-09-09 05:53:02,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:02,005 INFO L93 Difference]: Finished difference Result 430 states and 624 transitions. [2019-09-09 05:53:02,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:02,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-09 05:53:02,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:02,008 INFO L225 Difference]: With dead ends: 430 [2019-09-09 05:53:02,009 INFO L226 Difference]: Without dead ends: 430 [2019-09-09 05:53:02,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:02,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-09-09 05:53:02,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 410. [2019-09-09 05:53:02,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:53:02,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 597 transitions. [2019-09-09 05:53:02,018 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 597 transitions. Word has length 80 [2019-09-09 05:53:02,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:02,018 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 597 transitions. [2019-09-09 05:53:02,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:02,018 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 597 transitions. [2019-09-09 05:53:02,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-09 05:53:02,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:02,020 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:53:02,020 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:02,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:02,021 INFO L82 PathProgramCache]: Analyzing trace with hash 643036702, now seen corresponding path program 1 times [2019-09-09 05:53:02,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:02,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:02,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:02,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:02,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:53:02,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:02,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:02,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:02,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:02,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:02,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:02,082 INFO L87 Difference]: Start difference. First operand 410 states and 597 transitions. Second operand 4 states. [2019-09-09 05:53:02,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:02,443 INFO L93 Difference]: Finished difference Result 510 states and 743 transitions. [2019-09-09 05:53:02,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:02,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-09 05:53:02,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:02,449 INFO L225 Difference]: With dead ends: 510 [2019-09-09 05:53:02,449 INFO L226 Difference]: Without dead ends: 510 [2019-09-09 05:53:02,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:02,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-09-09 05:53:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 410. [2019-09-09 05:53:02,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-09 05:53:02,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 595 transitions. [2019-09-09 05:53:02,464 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 595 transitions. Word has length 81 [2019-09-09 05:53:02,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:02,465 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 595 transitions. [2019-09-09 05:53:02,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:02,465 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 595 transitions. [2019-09-09 05:53:02,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-09 05:53:02,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:02,467 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:53:02,467 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:02,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:02,467 INFO L82 PathProgramCache]: Analyzing trace with hash 891183196, now seen corresponding path program 1 times [2019-09-09 05:53:02,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:02,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:02,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:02,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:02,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:02,544 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-09 05:53:02,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:02,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:02,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:02,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:02,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:02,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:02,546 INFO L87 Difference]: Start difference. First operand 410 states and 595 transitions. Second operand 3 states. [2019-09-09 05:53:02,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:02,578 INFO L93 Difference]: Finished difference Result 559 states and 812 transitions. [2019-09-09 05:53:02,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:02,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-09 05:53:02,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:02,582 INFO L225 Difference]: With dead ends: 559 [2019-09-09 05:53:02,582 INFO L226 Difference]: Without dead ends: 559 [2019-09-09 05:53:02,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-09 05:53:02,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2019-09-09 05:53:02,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-09 05:53:02,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 812 transitions. [2019-09-09 05:53:02,596 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 812 transitions. Word has length 81 [2019-09-09 05:53:02,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:02,596 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 812 transitions. [2019-09-09 05:53:02,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 812 transitions. [2019-09-09 05:53:02,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-09 05:53:02,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:02,598 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:53:02,599 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:02,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:02,599 INFO L82 PathProgramCache]: Analyzing trace with hash 363210002, now seen corresponding path program 1 times [2019-09-09 05:53:02,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:02,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:02,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:02,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:02,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-09 05:53:02,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:02,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:02,666 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:02,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:02,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:02,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:02,667 INFO L87 Difference]: Start difference. First operand 559 states and 812 transitions. Second operand 3 states. [2019-09-09 05:53:02,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:02,700 INFO L93 Difference]: Finished difference Result 708 states and 1030 transitions. [2019-09-09 05:53:02,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:02,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-09 05:53:02,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:02,708 INFO L225 Difference]: With dead ends: 708 [2019-09-09 05:53:02,708 INFO L226 Difference]: Without dead ends: 708 [2019-09-09 05:53:02,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:02,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-09-09 05:53:02,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2019-09-09 05:53:02,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-09-09 05:53:02,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1030 transitions. [2019-09-09 05:53:02,725 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1030 transitions. Word has length 83 [2019-09-09 05:53:02,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:02,726 INFO L475 AbstractCegarLoop]: Abstraction has 708 states and 1030 transitions. [2019-09-09 05:53:02,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:02,726 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1030 transitions. [2019-09-09 05:53:02,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:53:02,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:02,728 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:02,729 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:02,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:02,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1857235727, now seen corresponding path program 1 times [2019-09-09 05:53:02,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:02,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:02,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:02,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:02,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:02,873 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:53:02,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:02,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:53:02,874 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:02,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:53:02,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:53:02,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:53:02,875 INFO L87 Difference]: Start difference. First operand 708 states and 1030 transitions. Second operand 6 states. [2019-09-09 05:53:03,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:03,449 INFO L93 Difference]: Finished difference Result 791 states and 1151 transitions. [2019-09-09 05:53:03,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:53:03,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2019-09-09 05:53:03,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:03,454 INFO L225 Difference]: With dead ends: 791 [2019-09-09 05:53:03,454 INFO L226 Difference]: Without dead ends: 791 [2019-09-09 05:53:03,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:53:03,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-09-09 05:53:03,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 716. [2019-09-09 05:53:03,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-09-09 05:53:03,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1043 transitions. [2019-09-09 05:53:03,469 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1043 transitions. Word has length 104 [2019-09-09 05:53:03,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:03,469 INFO L475 AbstractCegarLoop]: Abstraction has 716 states and 1043 transitions. [2019-09-09 05:53:03,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:53:03,470 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1043 transitions. [2019-09-09 05:53:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:53:03,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:03,472 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:03,472 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:03,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:03,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1303361832, now seen corresponding path program 1 times [2019-09-09 05:53:03,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:03,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:03,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:03,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:03,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:53:03,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:03,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:53:03,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:03,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:53:03,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:53:03,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:53:03,579 INFO L87 Difference]: Start difference. First operand 716 states and 1043 transitions. Second operand 6 states. [2019-09-09 05:53:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:04,125 INFO L93 Difference]: Finished difference Result 788 states and 1147 transitions. [2019-09-09 05:53:04,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:53:04,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-09 05:53:04,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:04,129 INFO L225 Difference]: With dead ends: 788 [2019-09-09 05:53:04,129 INFO L226 Difference]: Without dead ends: 788 [2019-09-09 05:53:04,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:53:04,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-09-09 05:53:04,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 717. [2019-09-09 05:53:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-09-09 05:53:04,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1044 transitions. [2019-09-09 05:53:04,144 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1044 transitions. Word has length 105 [2019-09-09 05:53:04,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:04,144 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1044 transitions. [2019-09-09 05:53:04,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:53:04,144 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1044 transitions. [2019-09-09 05:53:04,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-09 05:53:04,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:04,147 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:04,147 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:04,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:04,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1198210569, now seen corresponding path program 1 times [2019-09-09 05:53:04,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:04,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:04,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:04,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:04,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-09 05:53:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-09 05:53:04,836 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-09 05:53:04,904 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967294 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2019-09-09 05:53:04,906 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967296 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2019-09-09 05:53:05,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:53:05 BoogieIcfgContainer [2019-09-09 05:53:05,018 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:53:05,021 INFO L168 Benchmark]: Toolchain (without parser) took 15755.08 ms. Allocated memory was 134.7 MB in the beginning and 407.9 MB in the end (delta: 273.2 MB). Free memory was 87.1 MB in the beginning and 328.4 MB in the end (delta: -241.4 MB). Peak memory consumption was 285.1 MB. Max. memory is 7.1 GB. [2019-09-09 05:53:05,022 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 134.7 MB. Free memory was 108.0 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:53:05,023 INFO L168 Benchmark]: CACSL2BoogieTranslator took 889.60 ms. Allocated memory was 134.7 MB in the beginning and 202.9 MB in the end (delta: 68.2 MB). Free memory was 86.9 MB in the beginning and 159.3 MB in the end (delta: -72.5 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:53:05,024 INFO L168 Benchmark]: Boogie Preprocessor took 213.46 ms. Allocated memory is still 202.9 MB. Free memory was 159.3 MB in the beginning and 151.9 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:53:05,032 INFO L168 Benchmark]: RCFGBuilder took 1564.71 ms. Allocated memory was 202.9 MB in the beginning and 230.2 MB in the end (delta: 27.3 MB). Free memory was 151.9 MB in the beginning and 174.7 MB in the end (delta: -22.8 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:53:05,033 INFO L168 Benchmark]: TraceAbstraction took 13083.04 ms. Allocated memory was 230.2 MB in the beginning and 407.9 MB in the end (delta: 177.7 MB). Free memory was 174.7 MB in the beginning and 328.4 MB in the end (delta: -153.7 MB). Peak memory consumption was 277.3 MB. Max. memory is 7.1 GB. [2019-09-09 05:53:05,045 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 134.7 MB. Free memory was 108.0 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 889.60 ms. Allocated memory was 134.7 MB in the beginning and 202.9 MB in the end (delta: 68.2 MB). Free memory was 86.9 MB in the beginning and 159.3 MB in the end (delta: -72.5 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 213.46 ms. Allocated memory is still 202.9 MB. Free memory was 159.3 MB in the beginning and 151.9 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1564.71 ms. Allocated memory was 202.9 MB in the beginning and 230.2 MB in the end (delta: 27.3 MB). Free memory was 151.9 MB in the beginning and 174.7 MB in the end (delta: -22.8 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13083.04 ms. Allocated memory was 230.2 MB in the beginning and 407.9 MB in the end (delta: 177.7 MB). Free memory was 174.7 MB in the beginning and 328.4 MB in the end (delta: -153.7 MB). Peak memory consumption was 277.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967294 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967296 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1643]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1338. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=4294967337, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={-3:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1074] CALL ssl3_connect(s) VAL [init=1, s={-1:0}, SSLv3_client_data={-3:0}] [L1080] BUF_MEM *buf ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int *tmp___0 = __VERIFIER_nondet_pointer() ; [L1090] int tmp___1 = __VERIFIER_nondet_int() ; [L1091] int tmp___2 = __VERIFIER_nondet_int() ; [L1092] int tmp___3 = __VERIFIER_nondet_int() ; [L1093] int tmp___4 = __VERIFIER_nondet_int() ; [L1094] int tmp___5 = __VERIFIER_nondet_int() ; [L1095] int tmp___6 = __VERIFIER_nondet_int() ; [L1096] int tmp___7 = __VERIFIER_nondet_int() ; [L1097] int tmp___8 = __VERIFIER_nondet_int() ; [L1098] long tmp___9 = __VERIFIER_nondet_long() ; [L1099] int blastFlag ; [L1102] blastFlag = 0 [L1103] s->hit=__VERIFIER_nondet_int () [L1104] s->state = 12292 [L1105] tmp = __VERIFIER_nondet_int() [L1106] cb = (void (*)())((void *)0) [L1107] ret = -1 [L1108] skip = 0 [L1109] *tmp___0 = 0 [L1110] EXPR s->info_callback VAL [={0:0}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->info_callback={4294967290:7}, skip=0, SSLv3_client_data={-3:0}, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=12292, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1249] EXPR s->version VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->version=2, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->init_buf={-4294967295:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1274] COND FALSE !(! tmp___4) VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1280] COND FALSE !(! tmp___5) [L1286] s->state = 4368 [L1287] EXPR s->ctx [L1287] EXPR (s->ctx)->stats.sess_connect [L1287] (s->ctx)->stats.sess_connect += 1 [L1288] s->init_num = 0 VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={4294967290:7}, (s->s3)->tmp.reuse_message=4294967334, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->s3={-1:-801}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={4294967290:7}, blastFlag=0, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND TRUE s->state == 4368 [L1292] s->shutdown = 0 [L1293] ret = __VERIFIER_nondet_int() [L1294] COND TRUE blastFlag == 0 [L1295] blastFlag = 1 VAL [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1299] COND FALSE !(ret <= 0) [L1304] s->state = 4384 [L1305] s->init_num = 0 [L1306] EXPR s->bbio [L1306] EXPR s->wbio VAL [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, s->bbio={3:1}, s->wbio={-1:3}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1306] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={4294967290:7}, (s->s3)->tmp.reuse_message=4294967334, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, s->s3={-1:-801}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={4294967290:7}, blastFlag=1, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND TRUE s->state == 4384 [L1314] ret = __VERIFIER_nondet_int() [L1315] COND TRUE blastFlag == 1 [L1316] blastFlag = 2 VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1324] COND FALSE !(ret <= 0) [L1329] s->hit VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->hit=0, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1329] COND FALSE !(s->hit) [L1332] s->state = 4400 VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1334] s->init_num = 0 VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={4294967290:7}, (s->s3)->tmp.reuse_message=4294967334, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->s3={-1:-801}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={4294967290:7}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND TRUE s->state == 4400 [L1338] EXPR s->s3 [L1338] EXPR (s->s3)->tmp.new_cipher [L1338] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={4294967290:7}, ((s->s3)->tmp.new_cipher)->algorithms=4294967333, (s->s3)->tmp.new_cipher={4294967313:3}, blastFlag=2, init=1, ret=1, s={-1:0}, s={-1:0}, s->s3={-1:-801}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1338] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 2 [L1343] blastFlag = 3 VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1347] COND FALSE !(ret <= 0) VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1353] s->state = 4416 [L1354] s->init_num = 0 VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={4294967290:7}, (s->s3)->tmp.reuse_message=4294967334, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->s3={-1:-801}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={4294967290:7}, blastFlag=3, init=1, ret=5, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1166] COND TRUE s->state == 4416 [L1358] ret = __VERIFIER_nondet_int() [L1359] COND TRUE blastFlag == 3 [L1360] blastFlag = 4 VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1364] COND FALSE !(ret <= 0) [L1369] s->state = 4432 [L1370] s->init_num = 0 VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1371] COND FALSE !(! tmp___6) VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={4294967290:7}, (s->s3)->tmp.reuse_message=4294967334, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->s3={-1:-801}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={4294967290:7}, blastFlag=4, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1172] COND TRUE s->state == 4432 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 4 VAL [={4294967290:7}, blastFlag=4, init=1, ret=3, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] [L1643] __VERIFIER_error() VAL [={4294967290:7}, blastFlag=4, init=1, ret=3, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=3, tmp___5=1, tmp___6=3, tmp___7=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 167 locations, 1 error locations. UNSAFE Result, 13.0s OverallTime, 25 OverallIterations, 6 TraceHistogramMax, 8.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5114 SDtfs, 2384 SDslu, 6858 SDs, 0 SdLazy, 4107 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 20 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=717occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 1670 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1933 NumberOfCodeBlocks, 1933 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1791 ConstructedInterpolants, 0 QuantifiedInterpolants, 397585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 1286/1286 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...