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_srvr.blast.02.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:27:14,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:14,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:14,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:14,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:14,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:14,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:14,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:14,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:14,875 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:14,877 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:14,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:14,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:14,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:14,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:14,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:14,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:14,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:14,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:14,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:14,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:14,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:14,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:14,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:14,916 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:14,916 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:14,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:14,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:14,920 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:14,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:14,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:14,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:14,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:14,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:14,928 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:14,928 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:14,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:14,929 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:14,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:14,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:14,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:14,933 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-20 13:27:14,960 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:14,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:14,962 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:14,962 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:14,963 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:14,963 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:14,963 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:14,963 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:14,963 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:14,964 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:14,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:14,967 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:14,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:14,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:14,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:14,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:14,968 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:14,968 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:14,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:14,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:14,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:14,969 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:14,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:14,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:14,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:14,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:14,970 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:14,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:14,970 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:14,971 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:15,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:15,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:15,025 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:15,026 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:15,026 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:15,027 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.02.i.cil-1.c [2019-09-20 13:27:15,100 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b438f6d/6c5696b696c64171a17a221010d80287/FLAGf41a422f5 [2019-09-20 13:27:15,750 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:27:15,752 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.02.i.cil-1.c [2019-09-20 13:27:15,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b438f6d/6c5696b696c64171a17a221010d80287/FLAGf41a422f5 [2019-09-20 13:27:15,942 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b438f6d/6c5696b696c64171a17a221010d80287 [2019-09-20 13:27:15,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:27:15,952 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:27:15,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:15,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:27:15,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:27:15,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:15" (1/1) ... [2019-09-20 13:27:15,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49ffd47a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:15, skipping insertion in model container [2019-09-20 13:27:15,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:15" (1/1) ... [2019-09-20 13:27:15,968 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:27:16,041 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:27:16,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:16,660 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:27:16,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:16,890 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:27:16,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:16 WrapperNode [2019-09-20 13:27:16,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:16,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:27:16,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:27:16,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:27:16,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:16" (1/1) ... [2019-09-20 13:27:16,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:16" (1/1) ... [2019-09-20 13:27:16,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:16" (1/1) ... [2019-09-20 13:27:16,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:16" (1/1) ... [2019-09-20 13:27:17,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:16" (1/1) ... [2019-09-20 13:27:17,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:16" (1/1) ... [2019-09-20 13:27:17,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:16" (1/1) ... [2019-09-20 13:27:17,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:27:17,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:27:17,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:27:17,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:27:17,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:16" (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-20 13:27:17,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:27:17,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:27:17,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-20 13:27:17,132 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-20 13:27:17,132 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:27:17,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-20 13:27:17,133 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:27:17,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:27:17,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:27:17,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:27:17,133 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:27:17,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:27:17,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:27:17,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:27:17,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:27:17,136 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:27:17,136 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-20 13:27:17,136 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:27:17,137 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-20 13:27:17,137 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-20 13:27:17,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:27:17,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:27:17,138 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:27:17,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:27:17,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:27:17,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:27:17,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:27:17,139 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:27:17,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:27:17,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:27:17,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:27:17,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:27:17,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:27:17,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:27:17,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:27:17,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:27:17,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:27:17,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:27:17,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:27:17,667 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:27:18,414 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-20 13:27:18,414 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-20 13:27:18,444 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:27:18,444 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:27:18,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:18 BoogieIcfgContainer [2019-09-20 13:27:18,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:27:18,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:27:18,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:27:18,451 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:27:18,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:27:15" (1/3) ... [2019-09-20 13:27:18,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c75296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:18, skipping insertion in model container [2019-09-20 13:27:18,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:16" (2/3) ... [2019-09-20 13:27:18,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c75296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:18, skipping insertion in model container [2019-09-20 13:27:18,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:18" (3/3) ... [2019-09-20 13:27:18,457 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2019-09-20 13:27:18,468 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:27:18,483 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:27:18,501 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:27:18,528 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:27:18,528 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:27:18,528 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:27:18,529 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:27:18,529 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:27:18,529 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:27:18,529 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:27:18,529 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:27:18,549 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-09-20 13:27:18,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 13:27:18,563 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:18,564 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:18,567 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:18,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:18,573 INFO L82 PathProgramCache]: Analyzing trace with hash -958109655, now seen corresponding path program 1 times [2019-09-20 13:27:18,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:18,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:18,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:19,026 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-20 13:27:19,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:19,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:19,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:19,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:19,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:19,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:19,062 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 4 states. [2019-09-20 13:27:19,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:19,535 INFO L93 Difference]: Finished difference Result 185 states and 300 transitions. [2019-09-20 13:27:19,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:19,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-09-20 13:27:19,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:19,551 INFO L225 Difference]: With dead ends: 185 [2019-09-20 13:27:19,551 INFO L226 Difference]: Without dead ends: 164 [2019-09-20 13:27:19,553 INFO L636 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-20 13:27:19,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-20 13:27:19,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2019-09-20 13:27:19,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-20 13:27:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 222 transitions. [2019-09-20 13:27:19,608 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 222 transitions. Word has length 51 [2019-09-20 13:27:19,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:19,608 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 222 transitions. [2019-09-20 13:27:19,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:19,609 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2019-09-20 13:27:19,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:27:19,612 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:19,612 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:19,613 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:19,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:19,613 INFO L82 PathProgramCache]: Analyzing trace with hash -479309281, now seen corresponding path program 1 times [2019-09-20 13:27:19,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:19,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:19,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:19,754 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-20 13:27:19,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:19,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:19,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:19,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:19,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:19,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:19,758 INFO L87 Difference]: Start difference. First operand 147 states and 222 transitions. Second operand 4 states. [2019-09-20 13:27:20,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:20,232 INFO L93 Difference]: Finished difference Result 164 states and 242 transitions. [2019-09-20 13:27:20,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:20,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:27:20,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:20,236 INFO L225 Difference]: With dead ends: 164 [2019-09-20 13:27:20,236 INFO L226 Difference]: Without dead ends: 164 [2019-09-20 13:27:20,239 INFO L636 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-20 13:27:20,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-20 13:27:20,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2019-09-20 13:27:20,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-20 13:27:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 221 transitions. [2019-09-20 13:27:20,261 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 221 transitions. Word has length 64 [2019-09-20 13:27:20,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:20,265 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 221 transitions. [2019-09-20 13:27:20,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 221 transitions. [2019-09-20 13:27:20,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:20,269 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:20,269 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:20,272 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:20,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:20,273 INFO L82 PathProgramCache]: Analyzing trace with hash 242258695, now seen corresponding path program 1 times [2019-09-20 13:27:20,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:20,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:20,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:20,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:20,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:20,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:20,398 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:20,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:20,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:20,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:20,399 INFO L87 Difference]: Start difference. First operand 147 states and 221 transitions. Second operand 4 states. [2019-09-20 13:27:20,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:20,808 INFO L93 Difference]: Finished difference Result 163 states and 240 transitions. [2019-09-20 13:27:20,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:20,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:20,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:20,811 INFO L225 Difference]: With dead ends: 163 [2019-09-20 13:27:20,811 INFO L226 Difference]: Without dead ends: 163 [2019-09-20 13:27:20,812 INFO L636 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-20 13:27:20,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-20 13:27:20,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 147. [2019-09-20 13:27:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-20 13:27:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 220 transitions. [2019-09-20 13:27:20,822 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 220 transitions. Word has length 65 [2019-09-20 13:27:20,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:20,822 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 220 transitions. [2019-09-20 13:27:20,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:20,823 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 220 transitions. [2019-09-20 13:27:20,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:20,824 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:20,825 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:20,825 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:20,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:20,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1080269467, now seen corresponding path program 1 times [2019-09-20 13:27:20,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:20,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:20,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:20,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:20,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:27:20,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:20,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:27:20,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:27:20,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:20,936 INFO L87 Difference]: Start difference. First operand 147 states and 220 transitions. Second operand 5 states. [2019-09-20 13:27:21,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:21,450 INFO L93 Difference]: Finished difference Result 168 states and 248 transitions. [2019-09-20 13:27:21,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:27:21,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-09-20 13:27:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:21,452 INFO L225 Difference]: With dead ends: 168 [2019-09-20 13:27:21,452 INFO L226 Difference]: Without dead ends: 168 [2019-09-20 13:27:21,453 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:27:21,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-20 13:27:21,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-09-20 13:27:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:21,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 247 transitions. [2019-09-20 13:27:21,463 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 247 transitions. Word has length 65 [2019-09-20 13:27:21,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:21,464 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 247 transitions. [2019-09-20 13:27:21,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:27:21,464 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2019-09-20 13:27:21,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:21,466 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:21,466 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:21,466 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:21,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:21,467 INFO L82 PathProgramCache]: Analyzing trace with hash -639330733, now seen corresponding path program 1 times [2019-09-20 13:27:21,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:21,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:21,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:21,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:21,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:21,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:21,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:21,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:21,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:21,561 INFO L87 Difference]: Start difference. First operand 167 states and 247 transitions. Second operand 4 states. [2019-09-20 13:27:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:21,875 INFO L93 Difference]: Finished difference Result 182 states and 264 transitions. [2019-09-20 13:27:21,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:21,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:21,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:21,878 INFO L225 Difference]: With dead ends: 182 [2019-09-20 13:27:21,878 INFO L226 Difference]: Without dead ends: 182 [2019-09-20 13:27:21,878 INFO L636 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-20 13:27:21,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-20 13:27:21,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 167. [2019-09-20 13:27:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:21,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 246 transitions. [2019-09-20 13:27:21,890 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 246 transitions. Word has length 65 [2019-09-20 13:27:21,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:21,890 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 246 transitions. [2019-09-20 13:27:21,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:21,891 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 246 transitions. [2019-09-20 13:27:21,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:21,892 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:21,892 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:21,892 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:21,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:21,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1139982254, now seen corresponding path program 1 times [2019-09-20 13:27:21,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:21,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:21,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:21,966 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:21,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:21,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:21,969 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:21,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:21,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:21,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:21,971 INFO L87 Difference]: Start difference. First operand 167 states and 246 transitions. Second operand 4 states. [2019-09-20 13:27:22,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:22,268 INFO L93 Difference]: Finished difference Result 180 states and 261 transitions. [2019-09-20 13:27:22,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:22,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:22,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:22,270 INFO L225 Difference]: With dead ends: 180 [2019-09-20 13:27:22,271 INFO L226 Difference]: Without dead ends: 180 [2019-09-20 13:27:22,271 INFO L636 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-20 13:27:22,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-20 13:27:22,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2019-09-20 13:27:22,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 245 transitions. [2019-09-20 13:27:22,278 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 245 transitions. Word has length 65 [2019-09-20 13:27:22,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:22,279 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 245 transitions. [2019-09-20 13:27:22,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:22,279 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 245 transitions. [2019-09-20 13:27:22,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:27:22,280 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:22,280 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:22,280 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:22,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:22,281 INFO L82 PathProgramCache]: Analyzing trace with hash -447244068, now seen corresponding path program 1 times [2019-09-20 13:27:22,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:22,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:22,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:22,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:22,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:22,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:22,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:22,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:22,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:22,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:22,360 INFO L87 Difference]: Start difference. First operand 167 states and 245 transitions. Second operand 4 states. [2019-09-20 13:27:22,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:22,638 INFO L93 Difference]: Finished difference Result 180 states and 260 transitions. [2019-09-20 13:27:22,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:22,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:27:22,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:22,640 INFO L225 Difference]: With dead ends: 180 [2019-09-20 13:27:22,640 INFO L226 Difference]: Without dead ends: 180 [2019-09-20 13:27:22,640 INFO L636 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-20 13:27:22,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-20 13:27:22,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2019-09-20 13:27:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 244 transitions. [2019-09-20 13:27:22,647 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 244 transitions. Word has length 66 [2019-09-20 13:27:22,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:22,647 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 244 transitions. [2019-09-20 13:27:22,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:22,647 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 244 transitions. [2019-09-20 13:27:22,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-20 13:27:22,648 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:22,648 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:22,649 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:22,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:22,649 INFO L82 PathProgramCache]: Analyzing trace with hash 144054159, now seen corresponding path program 1 times [2019-09-20 13:27:22,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:22,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:22,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:22,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:22,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:22,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:22,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:22,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:22,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:22,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:22,709 INFO L87 Difference]: Start difference. First operand 167 states and 244 transitions. Second operand 4 states. [2019-09-20 13:27:22,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:22,975 INFO L93 Difference]: Finished difference Result 180 states and 259 transitions. [2019-09-20 13:27:22,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:22,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-20 13:27:22,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:22,978 INFO L225 Difference]: With dead ends: 180 [2019-09-20 13:27:22,978 INFO L226 Difference]: Without dead ends: 180 [2019-09-20 13:27:22,979 INFO L636 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-20 13:27:22,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-20 13:27:22,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2019-09-20 13:27:22,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:22,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 243 transitions. [2019-09-20 13:27:22,984 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 243 transitions. Word has length 67 [2019-09-20 13:27:22,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:22,984 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 243 transitions. [2019-09-20 13:27:22,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:22,984 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 243 transitions. [2019-09-20 13:27:22,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-20 13:27:22,985 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:22,985 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:22,986 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:22,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:22,986 INFO L82 PathProgramCache]: Analyzing trace with hash 91729367, now seen corresponding path program 1 times [2019-09-20 13:27:22,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:22,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:22,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:23,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:23,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:23,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:23,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:23,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:23,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:23,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:23,074 INFO L87 Difference]: Start difference. First operand 167 states and 243 transitions. Second operand 4 states. [2019-09-20 13:27:23,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:23,394 INFO L93 Difference]: Finished difference Result 180 states and 258 transitions. [2019-09-20 13:27:23,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:23,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-20 13:27:23,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:23,396 INFO L225 Difference]: With dead ends: 180 [2019-09-20 13:27:23,396 INFO L226 Difference]: Without dead ends: 180 [2019-09-20 13:27:23,397 INFO L636 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-20 13:27:23,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-20 13:27:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2019-09-20 13:27:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 242 transitions. [2019-09-20 13:27:23,403 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 242 transitions. Word has length 68 [2019-09-20 13:27:23,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:23,404 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 242 transitions. [2019-09-20 13:27:23,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 242 transitions. [2019-09-20 13:27:23,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-20 13:27:23,405 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:23,405 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:23,405 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:23,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:23,406 INFO L82 PathProgramCache]: Analyzing trace with hash 952871030, now seen corresponding path program 1 times [2019-09-20 13:27:23,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:23,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:23,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:23,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:23,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:23,468 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:23,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:23,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:23,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:23,469 INFO L87 Difference]: Start difference. First operand 167 states and 242 transitions. Second operand 4 states. [2019-09-20 13:27:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:23,773 INFO L93 Difference]: Finished difference Result 210 states and 306 transitions. [2019-09-20 13:27:23,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:23,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-20 13:27:23,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:23,776 INFO L225 Difference]: With dead ends: 210 [2019-09-20 13:27:23,776 INFO L226 Difference]: Without dead ends: 210 [2019-09-20 13:27:23,777 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:23,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-20 13:27:23,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 189. [2019-09-20 13:27:23,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:23,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 279 transitions. [2019-09-20 13:27:23,784 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 279 transitions. Word has length 68 [2019-09-20 13:27:23,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:23,784 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 279 transitions. [2019-09-20 13:27:23,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:23,785 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 279 transitions. [2019-09-20 13:27:23,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-20 13:27:23,786 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:23,786 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:23,786 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:23,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:23,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1561927466, now seen corresponding path program 1 times [2019-09-20 13:27:23,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:23,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:23,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:23,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:23,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:23,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:23,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:23,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:23,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:23,846 INFO L87 Difference]: Start difference. First operand 189 states and 279 transitions. Second operand 4 states. [2019-09-20 13:27:24,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:24,089 INFO L93 Difference]: Finished difference Result 192 states and 282 transitions. [2019-09-20 13:27:24,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:24,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-20 13:27:24,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:24,091 INFO L225 Difference]: With dead ends: 192 [2019-09-20 13:27:24,092 INFO L226 Difference]: Without dead ends: 192 [2019-09-20 13:27:24,092 INFO L636 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-20 13:27:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-20 13:27:24,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2019-09-20 13:27:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:24,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 278 transitions. [2019-09-20 13:27:24,103 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 278 transitions. Word has length 69 [2019-09-20 13:27:24,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:24,103 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 278 transitions. [2019-09-20 13:27:24,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:24,104 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 278 transitions. [2019-09-20 13:27:24,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:24,105 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:24,105 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:24,105 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:24,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:24,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1661253362, now seen corresponding path program 1 times [2019-09-20 13:27:24,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:24,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:24,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:24,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:24,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:24,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:24,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:24,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:24,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:24,198 INFO L87 Difference]: Start difference. First operand 189 states and 278 transitions. Second operand 4 states. [2019-09-20 13:27:24,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:24,512 INFO L93 Difference]: Finished difference Result 210 states and 304 transitions. [2019-09-20 13:27:24,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:24,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:27:24,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:24,514 INFO L225 Difference]: With dead ends: 210 [2019-09-20 13:27:24,514 INFO L226 Difference]: Without dead ends: 210 [2019-09-20 13:27:24,514 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:24,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-20 13:27:24,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 189. [2019-09-20 13:27:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 277 transitions. [2019-09-20 13:27:24,520 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 277 transitions. Word has length 81 [2019-09-20 13:27:24,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:24,521 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 277 transitions. [2019-09-20 13:27:24,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:24,521 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 277 transitions. [2019-09-20 13:27:24,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:27:24,522 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:24,522 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:27:24,522 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:24,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:24,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1293601760, now seen corresponding path program 1 times [2019-09-20 13:27:24,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:24,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:24,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:24,585 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:24,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:24,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:24,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:24,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:24,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:24,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:24,587 INFO L87 Difference]: Start difference. First operand 189 states and 277 transitions. Second operand 4 states. [2019-09-20 13:27:24,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:24,905 INFO L93 Difference]: Finished difference Result 209 states and 302 transitions. [2019-09-20 13:27:24,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:24,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:27:24,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:24,907 INFO L225 Difference]: With dead ends: 209 [2019-09-20 13:27:24,908 INFO L226 Difference]: Without dead ends: 209 [2019-09-20 13:27:24,908 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:24,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-20 13:27:24,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 189. [2019-09-20 13:27:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 276 transitions. [2019-09-20 13:27:24,934 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 276 transitions. Word has length 82 [2019-09-20 13:27:24,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:24,934 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 276 transitions. [2019-09-20 13:27:24,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:24,935 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 276 transitions. [2019-09-20 13:27:24,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:27:24,936 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:24,936 INFO L407 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:24,936 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:24,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:24,937 INFO L82 PathProgramCache]: Analyzing trace with hash 792950239, now seen corresponding path program 1 times [2019-09-20 13:27:24,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:24,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:24,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:24,992 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:24,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:24,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:24,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:24,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:24,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:24,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:24,994 INFO L87 Difference]: Start difference. First operand 189 states and 276 transitions. Second operand 4 states. [2019-09-20 13:27:25,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:25,263 INFO L93 Difference]: Finished difference Result 207 states and 299 transitions. [2019-09-20 13:27:25,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:25,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:27:25,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:25,265 INFO L225 Difference]: With dead ends: 207 [2019-09-20 13:27:25,265 INFO L226 Difference]: Without dead ends: 207 [2019-09-20 13:27:25,265 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:25,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-20 13:27:25,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-09-20 13:27:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:25,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 275 transitions. [2019-09-20 13:27:25,271 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 275 transitions. Word has length 82 [2019-09-20 13:27:25,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:25,272 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 275 transitions. [2019-09-20 13:27:25,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 275 transitions. [2019-09-20 13:27:25,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:27:25,273 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:25,273 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:25,273 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:25,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:25,274 INFO L82 PathProgramCache]: Analyzing trace with hash -655878929, now seen corresponding path program 1 times [2019-09-20 13:27:25,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:25,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:25,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:25,347 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:25,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:25,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:25,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:25,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:25,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:25,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:25,349 INFO L87 Difference]: Start difference. First operand 189 states and 275 transitions. Second operand 4 states. [2019-09-20 13:27:25,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:25,616 INFO L93 Difference]: Finished difference Result 207 states and 298 transitions. [2019-09-20 13:27:25,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:25,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-20 13:27:25,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:25,619 INFO L225 Difference]: With dead ends: 207 [2019-09-20 13:27:25,619 INFO L226 Difference]: Without dead ends: 207 [2019-09-20 13:27:25,619 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:25,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-20 13:27:25,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-09-20 13:27:25,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:25,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 274 transitions. [2019-09-20 13:27:25,625 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 274 transitions. Word has length 83 [2019-09-20 13:27:25,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:25,625 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 274 transitions. [2019-09-20 13:27:25,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:25,625 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 274 transitions. [2019-09-20 13:27:25,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-20 13:27:25,626 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:25,626 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:25,627 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:25,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:25,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2028659236, now seen corresponding path program 1 times [2019-09-20 13:27:25,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:25,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:25,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:25,683 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:25,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:25,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:25,684 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:25,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:25,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:25,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:25,685 INFO L87 Difference]: Start difference. First operand 189 states and 274 transitions. Second operand 4 states. [2019-09-20 13:27:26,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:26,075 INFO L93 Difference]: Finished difference Result 207 states and 297 transitions. [2019-09-20 13:27:26,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:26,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-20 13:27:26,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:26,078 INFO L225 Difference]: With dead ends: 207 [2019-09-20 13:27:26,079 INFO L226 Difference]: Without dead ends: 207 [2019-09-20 13:27:26,079 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:26,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-20 13:27:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-09-20 13:27:26,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 273 transitions. [2019-09-20 13:27:26,087 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 273 transitions. Word has length 84 [2019-09-20 13:27:26,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:26,087 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 273 transitions. [2019-09-20 13:27:26,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:26,087 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 273 transitions. [2019-09-20 13:27:26,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-20 13:27:26,089 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:26,089 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:26,089 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:26,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:26,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1457090858, now seen corresponding path program 1 times [2019-09-20 13:27:26,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:26,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:26,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:26,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:26,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:26,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:26,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:26,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:26,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:26,158 INFO L87 Difference]: Start difference. First operand 189 states and 273 transitions. Second operand 4 states. [2019-09-20 13:27:26,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:26,519 INFO L93 Difference]: Finished difference Result 207 states and 296 transitions. [2019-09-20 13:27:26,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:26,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-20 13:27:26,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:26,521 INFO L225 Difference]: With dead ends: 207 [2019-09-20 13:27:26,522 INFO L226 Difference]: Without dead ends: 207 [2019-09-20 13:27:26,523 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-20 13:27:26,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-09-20 13:27:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 272 transitions. [2019-09-20 13:27:26,529 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 272 transitions. Word has length 85 [2019-09-20 13:27:26,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:26,530 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 272 transitions. [2019-09-20 13:27:26,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:26,530 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 272 transitions. [2019-09-20 13:27:26,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-20 13:27:26,531 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:26,531 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:26,531 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:26,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:26,532 INFO L82 PathProgramCache]: Analyzing trace with hash 938460727, now seen corresponding path program 1 times [2019-09-20 13:27:26,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:26,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:26,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:26,604 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:26,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:26,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:26,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:26,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:26,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:26,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:26,606 INFO L87 Difference]: Start difference. First operand 189 states and 272 transitions. Second operand 4 states. [2019-09-20 13:27:26,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:26,901 INFO L93 Difference]: Finished difference Result 197 states and 283 transitions. [2019-09-20 13:27:26,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:26,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-20 13:27:26,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:26,904 INFO L225 Difference]: With dead ends: 197 [2019-09-20 13:27:26,904 INFO L226 Difference]: Without dead ends: 197 [2019-09-20 13:27:26,904 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:26,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-20 13:27:26,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 189. [2019-09-20 13:27:26,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:26,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 271 transitions. [2019-09-20 13:27:26,910 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 271 transitions. Word has length 86 [2019-09-20 13:27:26,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:26,910 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 271 transitions. [2019-09-20 13:27:26,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:26,911 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 271 transitions. [2019-09-20 13:27:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-20 13:27:26,912 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:26,912 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:26,912 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:26,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:26,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1406221366, now seen corresponding path program 1 times [2019-09-20 13:27:26,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:26,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:26,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:27,006 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:27,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:27,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:27,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:27,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:27,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:27,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:27,009 INFO L87 Difference]: Start difference. First operand 189 states and 271 transitions. Second operand 4 states. [2019-09-20 13:27:27,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:27,475 INFO L93 Difference]: Finished difference Result 284 states and 416 transitions. [2019-09-20 13:27:27,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:27,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-20 13:27:27,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:27,478 INFO L225 Difference]: With dead ends: 284 [2019-09-20 13:27:27,478 INFO L226 Difference]: Without dead ends: 284 [2019-09-20 13:27:27,478 INFO L636 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-20 13:27:27,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-20 13:27:27,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 232. [2019-09-20 13:27:27,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-20 13:27:27,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 348 transitions. [2019-09-20 13:27:27,486 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 348 transitions. Word has length 90 [2019-09-20 13:27:27,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:27,487 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 348 transitions. [2019-09-20 13:27:27,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:27,487 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 348 transitions. [2019-09-20 13:27:27,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-20 13:27:27,488 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:27,488 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:27,489 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:27,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:27,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1991352652, now seen corresponding path program 1 times [2019-09-20 13:27:27,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:27,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:27,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:27,559 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:27,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:27,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:27,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:27,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:27,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:27,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:27,561 INFO L87 Difference]: Start difference. First operand 232 states and 348 transitions. Second operand 4 states. [2019-09-20 13:27:27,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:27,921 INFO L93 Difference]: Finished difference Result 281 states and 421 transitions. [2019-09-20 13:27:27,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:27,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-20 13:27:27,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:27,924 INFO L225 Difference]: With dead ends: 281 [2019-09-20 13:27:27,924 INFO L226 Difference]: Without dead ends: 281 [2019-09-20 13:27:27,925 INFO L636 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-20 13:27:27,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-20 13:27:27,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 256. [2019-09-20 13:27:27,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:27,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 389 transitions. [2019-09-20 13:27:27,936 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 389 transitions. Word has length 90 [2019-09-20 13:27:27,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:27,936 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 389 transitions. [2019-09-20 13:27:27,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 389 transitions. [2019-09-20 13:27:27,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:27:27,939 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:27,940 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:27:27,940 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:27,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:27,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1233888286, now seen corresponding path program 1 times [2019-09-20 13:27:27,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:27,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:27,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:28,043 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:28,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:28,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:28,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:28,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:28,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:28,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:28,045 INFO L87 Difference]: Start difference. First operand 256 states and 389 transitions. Second operand 4 states. [2019-09-20 13:27:28,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:28,497 INFO L93 Difference]: Finished difference Result 308 states and 456 transitions. [2019-09-20 13:27:28,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:28,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:27:28,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:28,500 INFO L225 Difference]: With dead ends: 308 [2019-09-20 13:27:28,501 INFO L226 Difference]: Without dead ends: 308 [2019-09-20 13:27:28,501 INFO L636 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-20 13:27:28,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-20 13:27:28,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 256. [2019-09-20 13:27:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:28,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 388 transitions. [2019-09-20 13:27:28,511 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 388 transitions. Word has length 103 [2019-09-20 13:27:28,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:28,512 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 388 transitions. [2019-09-20 13:27:28,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:28,512 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 388 transitions. [2019-09-20 13:27:28,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:27:28,514 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:28,514 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:27:28,514 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:28,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:28,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1274563036, now seen corresponding path program 1 times [2019-09-20 13:27:28,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:28,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:28,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:28,616 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:28,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:28,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:28,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:28,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:28,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:28,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:28,619 INFO L87 Difference]: Start difference. First operand 256 states and 388 transitions. Second operand 4 states. [2019-09-20 13:27:28,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:28,964 INFO L93 Difference]: Finished difference Result 281 states and 419 transitions. [2019-09-20 13:27:28,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:28,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:27:28,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:28,969 INFO L225 Difference]: With dead ends: 281 [2019-09-20 13:27:28,969 INFO L226 Difference]: Without dead ends: 281 [2019-09-20 13:27:28,969 INFO L636 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-20 13:27:28,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-20 13:27:28,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 256. [2019-09-20 13:27:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:28,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 387 transitions. [2019-09-20 13:27:28,994 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 387 transitions. Word has length 103 [2019-09-20 13:27:28,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:28,995 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 387 transitions. [2019-09-20 13:27:28,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:28,995 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 387 transitions. [2019-09-20 13:27:28,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:28,996 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:28,997 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:27:28,997 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:28,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:28,997 INFO L82 PathProgramCache]: Analyzing trace with hash 930186292, now seen corresponding path program 1 times [2019-09-20 13:27:28,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:28,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:29,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:29,063 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:29,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:29,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:29,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:29,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:29,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:29,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:29,065 INFO L87 Difference]: Start difference. First operand 256 states and 387 transitions. Second operand 4 states. [2019-09-20 13:27:29,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:29,523 INFO L93 Difference]: Finished difference Result 307 states and 453 transitions. [2019-09-20 13:27:29,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:29,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:29,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:29,526 INFO L225 Difference]: With dead ends: 307 [2019-09-20 13:27:29,526 INFO L226 Difference]: Without dead ends: 307 [2019-09-20 13:27:29,527 INFO L636 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-20 13:27:29,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-20 13:27:29,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 256. [2019-09-20 13:27:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 386 transitions. [2019-09-20 13:27:29,539 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 386 transitions. Word has length 104 [2019-09-20 13:27:29,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:29,540 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 386 transitions. [2019-09-20 13:27:29,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:29,540 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 386 transitions. [2019-09-20 13:27:29,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:29,542 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:29,543 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:27:29,543 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:29,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:29,544 INFO L82 PathProgramCache]: Analyzing trace with hash 429534771, now seen corresponding path program 1 times [2019-09-20 13:27:29,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:29,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:29,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:29,628 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:29,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:29,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:29,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:29,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:29,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:29,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:29,633 INFO L87 Difference]: Start difference. First operand 256 states and 386 transitions. Second operand 4 states. [2019-09-20 13:27:30,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:30,068 INFO L93 Difference]: Finished difference Result 305 states and 450 transitions. [2019-09-20 13:27:30,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:30,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:30,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:30,071 INFO L225 Difference]: With dead ends: 305 [2019-09-20 13:27:30,071 INFO L226 Difference]: Without dead ends: 305 [2019-09-20 13:27:30,071 INFO L636 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-20 13:27:30,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-20 13:27:30,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2019-09-20 13:27:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 385 transitions. [2019-09-20 13:27:30,086 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 385 transitions. Word has length 104 [2019-09-20 13:27:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:30,086 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 385 transitions. [2019-09-20 13:27:30,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:30,087 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 385 transitions. [2019-09-20 13:27:30,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:30,089 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:30,089 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:27:30,090 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:30,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:30,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2103863754, now seen corresponding path program 1 times [2019-09-20 13:27:30,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:30,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:30,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:30,185 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:30,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:30,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:30,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:30,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:30,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:30,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:30,187 INFO L87 Difference]: Start difference. First operand 256 states and 385 transitions. Second operand 4 states. [2019-09-20 13:27:30,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:30,523 INFO L93 Difference]: Finished difference Result 280 states and 415 transitions. [2019-09-20 13:27:30,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:30,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:30,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:30,525 INFO L225 Difference]: With dead ends: 280 [2019-09-20 13:27:30,525 INFO L226 Difference]: Without dead ends: 280 [2019-09-20 13:27:30,526 INFO L636 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-20 13:27:30,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-20 13:27:30,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2019-09-20 13:27:30,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:30,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 384 transitions. [2019-09-20 13:27:30,532 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 384 transitions. Word has length 104 [2019-09-20 13:27:30,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:30,533 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 384 transitions. [2019-09-20 13:27:30,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:30,533 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 384 transitions. [2019-09-20 13:27:30,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:30,534 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:30,534 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:27:30,535 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:30,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:30,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1690452021, now seen corresponding path program 1 times [2019-09-20 13:27:30,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:30,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:30,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:30,603 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:30,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:30,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:30,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:30,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:30,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:30,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:30,605 INFO L87 Difference]: Start difference. First operand 256 states and 384 transitions. Second operand 4 states. [2019-09-20 13:27:30,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:30,908 INFO L93 Difference]: Finished difference Result 278 states and 412 transitions. [2019-09-20 13:27:30,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:30,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:30,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:30,911 INFO L225 Difference]: With dead ends: 278 [2019-09-20 13:27:30,911 INFO L226 Difference]: Without dead ends: 278 [2019-09-20 13:27:30,911 INFO L636 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-20 13:27:30,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-20 13:27:30,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2019-09-20 13:27:30,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:30,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 383 transitions. [2019-09-20 13:27:30,918 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 383 transitions. Word has length 104 [2019-09-20 13:27:30,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:30,918 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 383 transitions. [2019-09-20 13:27:30,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 383 transitions. [2019-09-20 13:27:30,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:27:30,920 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:30,920 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:27:30,920 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:30,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:30,921 INFO L82 PathProgramCache]: Analyzing trace with hash 963143451, now seen corresponding path program 1 times [2019-09-20 13:27:30,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:30,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:30,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:31,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:31,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:31,011 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:31,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:31,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:31,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:31,012 INFO L87 Difference]: Start difference. First operand 256 states and 383 transitions. Second operand 4 states. [2019-09-20 13:27:31,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:31,434 INFO L93 Difference]: Finished difference Result 305 states and 447 transitions. [2019-09-20 13:27:31,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:31,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:27:31,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:31,437 INFO L225 Difference]: With dead ends: 305 [2019-09-20 13:27:31,438 INFO L226 Difference]: Without dead ends: 305 [2019-09-20 13:27:31,438 INFO L636 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-20 13:27:31,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-20 13:27:31,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2019-09-20 13:27:31,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:31,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 382 transitions. [2019-09-20 13:27:31,444 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 382 transitions. Word has length 105 [2019-09-20 13:27:31,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:31,445 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 382 transitions. [2019-09-20 13:27:31,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:31,445 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 382 transitions. [2019-09-20 13:27:31,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:27:31,446 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:31,447 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:27:31,447 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:31,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:31,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1396872537, now seen corresponding path program 1 times [2019-09-20 13:27:31,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:31,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:31,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:31,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:31,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:31,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:31,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:31,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:31,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:31,505 INFO L87 Difference]: Start difference. First operand 256 states and 382 transitions. Second operand 4 states. [2019-09-20 13:27:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:31,814 INFO L93 Difference]: Finished difference Result 278 states and 410 transitions. [2019-09-20 13:27:31,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:31,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:27:31,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:31,816 INFO L225 Difference]: With dead ends: 278 [2019-09-20 13:27:31,816 INFO L226 Difference]: Without dead ends: 278 [2019-09-20 13:27:31,817 INFO L636 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-20 13:27:31,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-20 13:27:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2019-09-20 13:27:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 381 transitions. [2019-09-20 13:27:31,824 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 381 transitions. Word has length 105 [2019-09-20 13:27:31,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:31,825 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 381 transitions. [2019-09-20 13:27:31,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 381 transitions. [2019-09-20 13:27:31,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:27:31,828 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:31,828 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:27:31,828 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:31,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:31,829 INFO L82 PathProgramCache]: Analyzing trace with hash 916394288, now seen corresponding path program 1 times [2019-09-20 13:27:31,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:31,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:31,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:31,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:31,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:31,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:31,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:31,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:31,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:31,915 INFO L87 Difference]: Start difference. First operand 256 states and 381 transitions. Second operand 4 states. [2019-09-20 13:27:32,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:32,336 INFO L93 Difference]: Finished difference Result 305 states and 445 transitions. [2019-09-20 13:27:32,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:32,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:27:32,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:32,338 INFO L225 Difference]: With dead ends: 305 [2019-09-20 13:27:32,338 INFO L226 Difference]: Without dead ends: 305 [2019-09-20 13:27:32,338 INFO L636 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-20 13:27:32,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-20 13:27:32,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2019-09-20 13:27:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:32,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 380 transitions. [2019-09-20 13:27:32,348 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 380 transitions. Word has length 106 [2019-09-20 13:27:32,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:32,348 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 380 transitions. [2019-09-20 13:27:32,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:32,348 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 380 transitions. [2019-09-20 13:27:32,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:27:32,350 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:32,350 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:27:32,350 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:32,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:32,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1477094066, now seen corresponding path program 1 times [2019-09-20 13:27:32,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:32,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:32,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:32,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:32,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:32,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:32,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:32,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:32,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:32,415 INFO L87 Difference]: Start difference. First operand 256 states and 380 transitions. Second operand 4 states. [2019-09-20 13:27:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:32,714 INFO L93 Difference]: Finished difference Result 278 states and 408 transitions. [2019-09-20 13:27:32,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:32,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:27:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:32,717 INFO L225 Difference]: With dead ends: 278 [2019-09-20 13:27:32,717 INFO L226 Difference]: Without dead ends: 278 [2019-09-20 13:27:32,717 INFO L636 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-20 13:27:32,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-20 13:27:32,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2019-09-20 13:27:32,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:32,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 379 transitions. [2019-09-20 13:27:32,724 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 379 transitions. Word has length 106 [2019-09-20 13:27:32,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:32,724 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 379 transitions. [2019-09-20 13:27:32,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:32,724 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 379 transitions. [2019-09-20 13:27:32,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-20 13:27:32,725 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:32,726 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:27:32,726 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:32,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:32,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1735530410, now seen corresponding path program 1 times [2019-09-20 13:27:32,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:32,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:32,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:32,790 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:32,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:32,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:32,791 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:32,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:32,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:32,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:32,792 INFO L87 Difference]: Start difference. First operand 256 states and 379 transitions. Second operand 4 states. [2019-09-20 13:27:33,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:33,187 INFO L93 Difference]: Finished difference Result 305 states and 443 transitions. [2019-09-20 13:27:33,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:33,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-20 13:27:33,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:33,190 INFO L225 Difference]: With dead ends: 305 [2019-09-20 13:27:33,190 INFO L226 Difference]: Without dead ends: 305 [2019-09-20 13:27:33,191 INFO L636 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-20 13:27:33,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-20 13:27:33,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2019-09-20 13:27:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 378 transitions. [2019-09-20 13:27:33,197 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 378 transitions. Word has length 107 [2019-09-20 13:27:33,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:33,197 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 378 transitions. [2019-09-20 13:27:33,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:33,198 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 378 transitions. [2019-09-20 13:27:33,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-20 13:27:33,199 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:33,199 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:27:33,199 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:33,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:33,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1533706476, now seen corresponding path program 1 times [2019-09-20 13:27:33,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:33,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:33,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:33,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:33,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:33,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:33,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:33,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:33,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:33,281 INFO L87 Difference]: Start difference. First operand 256 states and 378 transitions. Second operand 4 states. [2019-09-20 13:27:33,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:33,578 INFO L93 Difference]: Finished difference Result 278 states and 406 transitions. [2019-09-20 13:27:33,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:33,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-20 13:27:33,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:33,581 INFO L225 Difference]: With dead ends: 278 [2019-09-20 13:27:33,581 INFO L226 Difference]: Without dead ends: 278 [2019-09-20 13:27:33,582 INFO L636 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-20 13:27:33,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-20 13:27:33,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2019-09-20 13:27:33,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:33,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 377 transitions. [2019-09-20 13:27:33,588 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 377 transitions. Word has length 107 [2019-09-20 13:27:33,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:33,589 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 377 transitions. [2019-09-20 13:27:33,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:33,589 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 377 transitions. [2019-09-20 13:27:33,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:27:33,590 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:33,590 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:27:33,590 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:33,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:33,591 INFO L82 PathProgramCache]: Analyzing trace with hash 751449227, now seen corresponding path program 1 times [2019-09-20 13:27:33,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:33,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:33,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:33,659 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:33,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:33,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:33,660 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:33,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:33,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:33,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:33,661 INFO L87 Difference]: Start difference. First operand 256 states and 377 transitions. Second operand 4 states. [2019-09-20 13:27:34,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:34,031 INFO L93 Difference]: Finished difference Result 295 states and 429 transitions. [2019-09-20 13:27:34,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:34,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-20 13:27:34,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:34,033 INFO L225 Difference]: With dead ends: 295 [2019-09-20 13:27:34,033 INFO L226 Difference]: Without dead ends: 295 [2019-09-20 13:27:34,034 INFO L636 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-20 13:27:34,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-20 13:27:34,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 256. [2019-09-20 13:27:34,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 376 transitions. [2019-09-20 13:27:34,040 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 376 transitions. Word has length 108 [2019-09-20 13:27:34,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:34,040 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 376 transitions. [2019-09-20 13:27:34,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:34,040 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 376 transitions. [2019-09-20 13:27:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:27:34,041 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:34,042 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:27:34,042 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:34,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:34,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1581943411, now seen corresponding path program 1 times [2019-09-20 13:27:34,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:34,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:34,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:34,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:34,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:34,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:34,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:34,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:34,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:34,124 INFO L87 Difference]: Start difference. First operand 256 states and 376 transitions. Second operand 4 states. [2019-09-20 13:27:34,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:34,410 INFO L93 Difference]: Finished difference Result 268 states and 392 transitions. [2019-09-20 13:27:34,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:34,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-20 13:27:34,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:34,412 INFO L225 Difference]: With dead ends: 268 [2019-09-20 13:27:34,412 INFO L226 Difference]: Without dead ends: 268 [2019-09-20 13:27:34,412 INFO L636 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-20 13:27:34,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-09-20 13:27:34,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 256. [2019-09-20 13:27:34,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:34,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 375 transitions. [2019-09-20 13:27:34,419 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 375 transitions. Word has length 108 [2019-09-20 13:27:34,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:34,419 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 375 transitions. [2019-09-20 13:27:34,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:34,419 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 375 transitions. [2019-09-20 13:27:34,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-20 13:27:34,421 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:34,421 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:34,421 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:34,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:34,422 INFO L82 PathProgramCache]: Analyzing trace with hash 697482930, now seen corresponding path program 1 times [2019-09-20 13:27:34,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:34,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:34,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:34,490 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:34,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:34,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:34,491 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:34,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:34,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:34,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:34,492 INFO L87 Difference]: Start difference. First operand 256 states and 375 transitions. Second operand 4 states. [2019-09-20 13:27:34,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:34,858 INFO L93 Difference]: Finished difference Result 295 states and 427 transitions. [2019-09-20 13:27:34,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:34,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-20 13:27:34,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:34,860 INFO L225 Difference]: With dead ends: 295 [2019-09-20 13:27:34,860 INFO L226 Difference]: Without dead ends: 295 [2019-09-20 13:27:34,861 INFO L636 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-20 13:27:34,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-20 13:27:34,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 256. [2019-09-20 13:27:34,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:34,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 374 transitions. [2019-09-20 13:27:34,867 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 374 transitions. Word has length 112 [2019-09-20 13:27:34,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:34,867 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 374 transitions. [2019-09-20 13:27:34,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:34,867 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 374 transitions. [2019-09-20 13:27:34,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-20 13:27:34,868 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:34,868 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:34,869 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:34,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:34,869 INFO L82 PathProgramCache]: Analyzing trace with hash -988696908, now seen corresponding path program 1 times [2019-09-20 13:27:34,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:34,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:34,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:34,945 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-20 13:27:34,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:34,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:34,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:34,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:34,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:34,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:34,947 INFO L87 Difference]: Start difference. First operand 256 states and 374 transitions. Second operand 3 states. [2019-09-20 13:27:34,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:34,974 INFO L93 Difference]: Finished difference Result 485 states and 717 transitions. [2019-09-20 13:27:34,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:34,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-20 13:27:34,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:34,977 INFO L225 Difference]: With dead ends: 485 [2019-09-20 13:27:34,977 INFO L226 Difference]: Without dead ends: 485 [2019-09-20 13:27:34,978 INFO L636 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-20 13:27:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-09-20 13:27:34,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2019-09-20 13:27:34,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-09-20 13:27:34,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 717 transitions. [2019-09-20 13:27:34,989 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 717 transitions. Word has length 112 [2019-09-20 13:27:34,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:34,989 INFO L475 AbstractCegarLoop]: Abstraction has 485 states and 717 transitions. [2019-09-20 13:27:34,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:34,989 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 717 transitions. [2019-09-20 13:27:34,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-20 13:27:34,991 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:34,992 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:34,992 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:34,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:34,992 INFO L82 PathProgramCache]: Analyzing trace with hash 250169335, now seen corresponding path program 1 times [2019-09-20 13:27:34,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:34,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:34,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-20 13:27:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-20 13:27:35,348 INFO L474 BasicCegarLoop]: Counterexample might be feasible [2019-09-20 13:27:35,395 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967308 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-20 13:27:35,396 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967307 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-20 13:27:35,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:27:35 BoogieIcfgContainer [2019-09-20 13:27:35,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:27:35,489 INFO L168 Benchmark]: Toolchain (without parser) took 19535.84 ms. Allocated memory was 129.5 MB in the beginning and 485.5 MB in the end (delta: 356.0 MB). Free memory was 82.0 MB in the beginning and 94.0 MB in the end (delta: -12.0 MB). Peak memory consumption was 343.9 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:35,490 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 129.5 MB. Free memory was 102.4 MB in the beginning and 102.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:27:35,491 INFO L168 Benchmark]: CACSL2BoogieTranslator took 938.61 ms. Allocated memory was 129.5 MB in the beginning and 198.7 MB in the end (delta: 69.2 MB). Free memory was 81.8 MB in the beginning and 154.5 MB in the end (delta: -72.7 MB). Peak memory consumption was 30.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:35,491 INFO L168 Benchmark]: Boogie Preprocessor took 151.75 ms. Allocated memory is still 198.7 MB. Free memory was 154.5 MB in the beginning and 146.9 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:35,492 INFO L168 Benchmark]: RCFGBuilder took 1401.85 ms. Allocated memory was 198.7 MB in the beginning and 216.0 MB in the end (delta: 17.3 MB). Free memory was 146.2 MB in the beginning and 164.6 MB in the end (delta: -18.4 MB). Peak memory consumption was 87.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:35,493 INFO L168 Benchmark]: TraceAbstraction took 17039.22 ms. Allocated memory was 216.0 MB in the beginning and 485.5 MB in the end (delta: 269.5 MB). Free memory was 164.6 MB in the beginning and 94.0 MB in the end (delta: 70.5 MB). Peak memory consumption was 340.0 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:35,497 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.22 ms. Allocated memory is still 129.5 MB. Free memory was 102.4 MB in the beginning and 102.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 938.61 ms. Allocated memory was 129.5 MB in the beginning and 198.7 MB in the end (delta: 69.2 MB). Free memory was 81.8 MB in the beginning and 154.5 MB in the end (delta: -72.7 MB). Peak memory consumption was 30.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 151.75 ms. Allocated memory is still 198.7 MB. Free memory was 154.5 MB in the beginning and 146.9 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1401.85 ms. Allocated memory was 198.7 MB in the beginning and 216.0 MB in the end (delta: 17.3 MB). Free memory was 146.2 MB in the beginning and 164.6 MB in the end (delta: -18.4 MB). Peak memory consumption was 87.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17039.22 ms. Allocated memory was 216.0 MB in the beginning and 485.5 MB in the end (delta: 269.5 MB). Free memory was 164.6 MB in the beginning and 94.0 MB in the end (delta: 70.5 MB). Peak memory consumption was 340.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967308 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 4294967307 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: 1702]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=4294967321, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={-2:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 VAL [init=1, malloc(sizeof(SSL))={2:0}, malloc(sizeof(SSL_CTX))={3:0}, malloc(sizeof(SSL_SESSION))={6:0}, malloc(sizeof(struct ssl3_state_st))={1:0}, s={2:0}, SSLv3_server_data={-2:0}] [L1075] CALL ssl3_accept(s) VAL [init=1, s={2:0}, SSLv3_server_data={-2:0}] [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, s->info_callback={1:4294967295}, skip=0, SSLv3_server_data={-2:0}, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1115] COND FALSE !((unsigned long )s->info_callback != (unsigned long )((void *)0)) [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1130] EXPR s->cert VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, s->cert={5:-4}, skip=0, SSLv3_server_data={-2:0}, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=8464, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=8464, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=8464, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=8464, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=8464, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=8464, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=8464, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=8464, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=8464, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [={0:0}, blastFlag=1, got_new_session=0, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [={0:0}, (s->s3)->tmp.reuse_message=4294967311, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->s3={1:0}, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1136] COND TRUE 1 VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={0:0}, blastFlag=1, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8496, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1351] COND FALSE !(ret <= 0) [L1356] s->hit VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->hit=1, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1356] COND TRUE s->hit [L1357] s->state = 8656 VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1361] s->init_num = 0 VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [={0:0}, (s->s3)->tmp.reuse_message=4294967311, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->s3={1:0}, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1136] COND TRUE 1 VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [={0:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8656, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1229] COND TRUE s->state == 8656 [L1554] EXPR s->session [L1554] EXPR s->s3 [L1554] EXPR (s->s3)->tmp.new_cipher [L1554] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1555] COND FALSE !(! tmp___9) [L1561] ret = __VERIFIER_nondet_int() [L1562] COND TRUE blastFlag == 2 [L1563] blastFlag = 3 VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1574] COND FALSE !(! tmp___10) VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [={0:0}, (s->s3)->tmp.reuse_message=4294967311, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->s3={1:0}, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1136] COND TRUE 1 VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8656, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, s->state=8672, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 3 VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] [L1702] __VERIFIER_error() VAL [={0:0}, blastFlag=3, got_new_session=1, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_server_data={-2:0}, state=8672, Time=1, tmp=1, tmp___1=1, tmp___10=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=1, tmp___8=1, tmp___9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 181 locations, 1 error locations. UNSAFE Result, 16.9s OverallTime, 37 OverallIterations, 4 TraceHistogramMax, 12.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7014 SDtfs, 1980 SDslu, 10077 SDs, 0 SdLazy, 6391 SolverSat, 316 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 78 SyntacticMatches, 31 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=485occurred in iteration=36, 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.3s AutomataMinimizationTime, 36 MinimizatonAttempts, 866 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 3305 NumberOfCodeBlocks, 3305 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3138 ConstructedInterpolants, 0 QuantifiedInterpolants, 785784 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 1437/1437 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...