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.04.i.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:27:18,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:18,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:18,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:18,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:18,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:18,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:18,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:18,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:18,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:18,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:18,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:18,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:18,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:18,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:18,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:18,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:18,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:18,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:18,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:18,604 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:18,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:18,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:18,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:18,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:18,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:18,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:18,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:18,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:18,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:18,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:18,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:18,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:18,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:18,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:18,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:18,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:18,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:18,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:18,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:18,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:18,620 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:18,642 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:18,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:18,643 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:18,643 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:18,644 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:18,644 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:18,645 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:18,645 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:18,645 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:18,645 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:18,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:18,648 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:18,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:18,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:18,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:18,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:18,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:18,649 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:18,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:18,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:18,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:18,650 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:18,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:18,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:18,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:18,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:18,651 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:18,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:18,652 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:18,652 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:18,712 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:18,729 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:18,732 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:18,734 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:18,734 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:18,735 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.04.i.cil.c [2019-09-20 13:27:18,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cb030c93/468d0ecfdc05485ca903ae021136cfcd/FLAG48e26ac30 [2019-09-20 13:27:19,475 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:27:19,477 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.04.i.cil.c [2019-09-20 13:27:19,503 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cb030c93/468d0ecfdc05485ca903ae021136cfcd/FLAG48e26ac30 [2019-09-20 13:27:19,638 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cb030c93/468d0ecfdc05485ca903ae021136cfcd [2019-09-20 13:27:19,648 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:27:19,649 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:27:19,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:19,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:27:19,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:27:19,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:19" (1/1) ... [2019-09-20 13:27:19,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d9af452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:19, skipping insertion in model container [2019-09-20 13:27:19,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:19" (1/1) ... [2019-09-20 13:27:19,667 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:27:19,760 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:27:20,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:20,488 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:27:20,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:20,709 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:27:20,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:20 WrapperNode [2019-09-20 13:27:20,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:20,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:27:20,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:27:20,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:27:20,724 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:20" (1/1) ... [2019-09-20 13:27:20,724 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:20" (1/1) ... [2019-09-20 13:27:20,750 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:20" (1/1) ... [2019-09-20 13:27:20,750 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:20" (1/1) ... [2019-09-20 13:27:20,823 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:20" (1/1) ... [2019-09-20 13:27:20,834 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:20" (1/1) ... [2019-09-20 13:27:20,839 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:20" (1/1) ... [2019-09-20 13:27:20,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:27:20,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:27:20,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:27:20,847 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:27:20,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:20" (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:20,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:27:20,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:27:20,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-20 13:27:20,919 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-20 13:27:20,920 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:27:20,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-20 13:27:20,920 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:27:20,920 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:27:20,920 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:27:20,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:27:20,921 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:27:20,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:27:20,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:27:20,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:27:20,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:27:20,922 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:27:20,922 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-20 13:27:20,922 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:27:20,922 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-20 13:27:20,922 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-20 13:27:20,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:27:20,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:27:20,923 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:27:20,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:27:20,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:27:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:27:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:27:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:27:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:27:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:27:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:27:20,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:27:20,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:27:20,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:27:20,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:27:20,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:27:20,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:27:20,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:27:20,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:27:21,350 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:27:22,146 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-20 13:27:22,146 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-20 13:27:22,177 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:27:22,177 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:27:22,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:22 BoogieIcfgContainer [2019-09-20 13:27:22,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:27:22,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:27:22,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:27:22,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:27:22,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:27:19" (1/3) ... [2019-09-20 13:27:22,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760e7f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:22, skipping insertion in model container [2019-09-20 13:27:22,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:20" (2/3) ... [2019-09-20 13:27:22,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760e7f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:22, skipping insertion in model container [2019-09-20 13:27:22,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:22" (3/3) ... [2019-09-20 13:27:22,190 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2019-09-20 13:27:22,202 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:27:22,214 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:27:22,233 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:27:22,264 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:27:22,264 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:27:22,264 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:27:22,265 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:27:22,265 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:27:22,265 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:27:22,265 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:27:22,265 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:27:22,291 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-09-20 13:27:22,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 13:27:22,310 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:22,311 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:22,315 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:22,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:22,321 INFO L82 PathProgramCache]: Analyzing trace with hash -958109655, now seen corresponding path program 1 times [2019-09-20 13:27:22,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:22,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:22,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:22,695 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:22,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:22,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:22,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:22,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:22,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:22,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:22,723 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 4 states. [2019-09-20 13:27:23,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:23,242 INFO L93 Difference]: Finished difference Result 185 states and 300 transitions. [2019-09-20 13:27:23,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:23,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-09-20 13:27:23,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:23,267 INFO L225 Difference]: With dead ends: 185 [2019-09-20 13:27:23,268 INFO L226 Difference]: Without dead ends: 164 [2019-09-20 13:27:23,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:23,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-20 13:27:23,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2019-09-20 13:27:23,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-20 13:27:23,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 222 transitions. [2019-09-20 13:27:23,324 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 222 transitions. Word has length 51 [2019-09-20 13:27:23,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:23,325 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 222 transitions. [2019-09-20 13:27:23,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:23,325 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2019-09-20 13:27:23,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:27:23,328 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:23,329 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:23,329 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:23,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:23,330 INFO L82 PathProgramCache]: Analyzing trace with hash -479309281, now seen corresponding path program 1 times [2019-09-20 13:27:23,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:23,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:23,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:23,512 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:23,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:23,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:23,513 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:23,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:23,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:23,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:23,516 INFO L87 Difference]: Start difference. First operand 147 states and 222 transitions. Second operand 4 states. [2019-09-20 13:27:23,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:23,959 INFO L93 Difference]: Finished difference Result 164 states and 242 transitions. [2019-09-20 13:27:23,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:23,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:27:23,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:23,963 INFO L225 Difference]: With dead ends: 164 [2019-09-20 13:27:23,963 INFO L226 Difference]: Without dead ends: 164 [2019-09-20 13:27:23,967 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,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-20 13:27:23,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2019-09-20 13:27:23,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-20 13:27:23,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 221 transitions. [2019-09-20 13:27:23,991 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 221 transitions. Word has length 64 [2019-09-20 13:27:23,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:23,991 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 221 transitions. [2019-09-20 13:27:23,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:23,992 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 221 transitions. [2019-09-20 13:27:23,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:23,998 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:23,999 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:23,999 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:23,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:23,999 INFO L82 PathProgramCache]: Analyzing trace with hash 242258695, now seen corresponding path program 1 times [2019-09-20 13:27:24,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:24,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:24,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:24,172 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:24,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:24,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:24,173 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:24,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:24,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:24,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:24,174 INFO L87 Difference]: Start difference. First operand 147 states and 221 transitions. Second operand 4 states. [2019-09-20 13:27:24,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:24,495 INFO L93 Difference]: Finished difference Result 163 states and 240 transitions. [2019-09-20 13:27:24,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:24,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:24,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:24,497 INFO L225 Difference]: With dead ends: 163 [2019-09-20 13:27:24,498 INFO L226 Difference]: Without dead ends: 163 [2019-09-20 13:27:24,498 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,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-20 13:27:24,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 147. [2019-09-20 13:27:24,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-20 13:27:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 220 transitions. [2019-09-20 13:27:24,511 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 220 transitions. Word has length 65 [2019-09-20 13:27:24,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:24,512 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 220 transitions. [2019-09-20 13:27:24,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:24,512 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 220 transitions. [2019-09-20 13:27:24,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:24,515 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:24,516 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:24,516 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:24,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:24,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1080269467, now seen corresponding path program 1 times [2019-09-20 13:27:24,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:24,524 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,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:24,680 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:24,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:24,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:27:24,681 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:24,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:27:24,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:27:24,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:24,682 INFO L87 Difference]: Start difference. First operand 147 states and 220 transitions. Second operand 5 states. [2019-09-20 13:27:25,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:25,203 INFO L93 Difference]: Finished difference Result 168 states and 248 transitions. [2019-09-20 13:27:25,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:27:25,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-09-20 13:27:25,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:25,206 INFO L225 Difference]: With dead ends: 168 [2019-09-20 13:27:25,206 INFO L226 Difference]: Without dead ends: 168 [2019-09-20 13:27:25,206 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:25,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-20 13:27:25,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-09-20 13:27:25,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:25,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 247 transitions. [2019-09-20 13:27:25,217 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 247 transitions. Word has length 65 [2019-09-20 13:27:25,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:25,218 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 247 transitions. [2019-09-20 13:27:25,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:27:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2019-09-20 13:27:25,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:25,225 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:25,225 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:25,225 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:25,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:25,226 INFO L82 PathProgramCache]: Analyzing trace with hash -639330733, now seen corresponding path program 1 times [2019-09-20 13:27:25,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:25,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:25,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:25,357 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:25,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:25,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:25,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:25,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:25,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:25,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:25,359 INFO L87 Difference]: Start difference. First operand 167 states and 247 transitions. Second operand 4 states. [2019-09-20 13:27:25,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:25,673 INFO L93 Difference]: Finished difference Result 182 states and 264 transitions. [2019-09-20 13:27:25,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:25,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:25,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:25,676 INFO L225 Difference]: With dead ends: 182 [2019-09-20 13:27:25,676 INFO L226 Difference]: Without dead ends: 182 [2019-09-20 13:27:25,677 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:25,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-20 13:27:25,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 167. [2019-09-20 13:27:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 246 transitions. [2019-09-20 13:27:25,685 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 246 transitions. Word has length 65 [2019-09-20 13:27:25,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:25,685 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 246 transitions. [2019-09-20 13:27:25,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 246 transitions. [2019-09-20 13:27:25,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:25,687 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:25,687 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:25,688 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:25,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:25,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1139982254, now seen corresponding path program 1 times [2019-09-20 13:27:25,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:25,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:25,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:25,771 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:25,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:25,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:25,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:25,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:25,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:25,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:25,773 INFO L87 Difference]: Start difference. First operand 167 states and 246 transitions. Second operand 4 states. [2019-09-20 13:27:26,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:26,162 INFO L93 Difference]: Finished difference Result 180 states and 261 transitions. [2019-09-20 13:27:26,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:26,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:26,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:26,168 INFO L225 Difference]: With dead ends: 180 [2019-09-20 13:27:26,169 INFO L226 Difference]: Without dead ends: 180 [2019-09-20 13:27:26,169 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:26,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-20 13:27:26,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2019-09-20 13:27:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 245 transitions. [2019-09-20 13:27:26,176 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 245 transitions. Word has length 65 [2019-09-20 13:27:26,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:26,177 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 245 transitions. [2019-09-20 13:27:26,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:26,177 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 245 transitions. [2019-09-20 13:27:26,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:27:26,178 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:26,179 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:26,179 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:26,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:26,179 INFO L82 PathProgramCache]: Analyzing trace with hash -447244068, now seen corresponding path program 1 times [2019-09-20 13:27:26,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:26,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:26,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:26,265 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:26,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:26,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:26,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:26,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:26,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:26,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:26,268 INFO L87 Difference]: Start difference. First operand 167 states and 245 transitions. Second operand 4 states. [2019-09-20 13:27:26,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:26,573 INFO L93 Difference]: Finished difference Result 180 states and 260 transitions. [2019-09-20 13:27:26,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:26,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:27:26,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:26,575 INFO L225 Difference]: With dead ends: 180 [2019-09-20 13:27:26,575 INFO L226 Difference]: Without dead ends: 180 [2019-09-20 13:27:26,575 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:26,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-20 13:27:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2019-09-20 13:27:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 244 transitions. [2019-09-20 13:27:26,580 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 244 transitions. Word has length 66 [2019-09-20 13:27:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:26,580 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 244 transitions. [2019-09-20 13:27:26,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:26,580 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 244 transitions. [2019-09-20 13:27:26,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-20 13:27:26,581 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:26,581 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:26,582 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:26,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:26,582 INFO L82 PathProgramCache]: Analyzing trace with hash 144054159, now seen corresponding path program 1 times [2019-09-20 13:27:26,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:26,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:26,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:26,665 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:26,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:26,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:26,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:26,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:26,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:26,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:26,668 INFO L87 Difference]: Start difference. First operand 167 states and 244 transitions. Second operand 4 states. [2019-09-20 13:27:26,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:26,954 INFO L93 Difference]: Finished difference Result 180 states and 259 transitions. [2019-09-20 13:27:26,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:26,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-20 13:27:26,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:26,957 INFO L225 Difference]: With dead ends: 180 [2019-09-20 13:27:26,957 INFO L226 Difference]: Without dead ends: 180 [2019-09-20 13:27:26,957 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:26,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-20 13:27:26,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2019-09-20 13:27:26,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:26,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 243 transitions. [2019-09-20 13:27:26,964 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 243 transitions. Word has length 67 [2019-09-20 13:27:26,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:26,964 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 243 transitions. [2019-09-20 13:27:26,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:26,964 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 243 transitions. [2019-09-20 13:27:26,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-20 13:27:26,966 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:26,966 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:26,966 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:26,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:26,967 INFO L82 PathProgramCache]: Analyzing trace with hash 91729367, now seen corresponding path program 1 times [2019-09-20 13:27:26,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:26,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:26,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:27,034 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:27,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:27,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:27,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:27,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:27,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:27,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:27,036 INFO L87 Difference]: Start difference. First operand 167 states and 243 transitions. Second operand 4 states. [2019-09-20 13:27:27,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:27,305 INFO L93 Difference]: Finished difference Result 180 states and 258 transitions. [2019-09-20 13:27:27,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:27,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-20 13:27:27,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:27,307 INFO L225 Difference]: With dead ends: 180 [2019-09-20 13:27:27,307 INFO L226 Difference]: Without dead ends: 180 [2019-09-20 13:27:27,307 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,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-20 13:27:27,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2019-09-20 13:27:27,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-20 13:27:27,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 242 transitions. [2019-09-20 13:27:27,313 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 242 transitions. Word has length 68 [2019-09-20 13:27:27,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:27,313 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 242 transitions. [2019-09-20 13:27:27,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 242 transitions. [2019-09-20 13:27:27,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-20 13:27:27,315 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:27,315 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:27,315 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:27,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:27,315 INFO L82 PathProgramCache]: Analyzing trace with hash 952871030, now seen corresponding path program 1 times [2019-09-20 13:27:27,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:27,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:27,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:27,371 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:27,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:27,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:27,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:27,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:27,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:27,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:27,373 INFO L87 Difference]: Start difference. First operand 167 states and 242 transitions. Second operand 4 states. [2019-09-20 13:27:27,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:27,676 INFO L93 Difference]: Finished difference Result 209 states and 304 transitions. [2019-09-20 13:27:27,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:27,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-20 13:27:27,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:27,679 INFO L225 Difference]: With dead ends: 209 [2019-09-20 13:27:27,679 INFO L226 Difference]: Without dead ends: 209 [2019-09-20 13:27:27,680 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:27,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-20 13:27:27,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 189. [2019-09-20 13:27:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 279 transitions. [2019-09-20 13:27:27,686 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 279 transitions. Word has length 68 [2019-09-20 13:27:27,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:27,687 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 279 transitions. [2019-09-20 13:27:27,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 279 transitions. [2019-09-20 13:27:27,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-20 13:27:27,688 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:27,688 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:27,688 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:27,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:27,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1561927466, now seen corresponding path program 1 times [2019-09-20 13:27:27,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:27,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:27,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:27,748 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:27,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:27,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:27,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:27,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:27,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:27,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:27,750 INFO L87 Difference]: Start difference. First operand 189 states and 279 transitions. Second operand 4 states. [2019-09-20 13:27:28,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:28,032 INFO L93 Difference]: Finished difference Result 192 states and 282 transitions. [2019-09-20 13:27:28,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:28,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-20 13:27:28,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:28,035 INFO L225 Difference]: With dead ends: 192 [2019-09-20 13:27:28,036 INFO L226 Difference]: Without dead ends: 192 [2019-09-20 13:27:28,037 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,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-20 13:27:28,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2019-09-20 13:27:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:28,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 278 transitions. [2019-09-20 13:27:28,051 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 278 transitions. Word has length 69 [2019-09-20 13:27:28,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:28,052 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 278 transitions. [2019-09-20 13:27:28,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:28,052 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 278 transitions. [2019-09-20 13:27:28,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:28,053 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:28,054 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:28,054 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:28,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:28,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1661253362, now seen corresponding path program 1 times [2019-09-20 13:27:28,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:28,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:28,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:28,152 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:28,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:28,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:28,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:28,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:28,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:28,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:28,155 INFO L87 Difference]: Start difference. First operand 189 states and 278 transitions. Second operand 4 states. [2019-09-20 13:27:28,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:28,495 INFO L93 Difference]: Finished difference Result 209 states and 302 transitions. [2019-09-20 13:27:28,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:28,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:27:28,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:28,497 INFO L225 Difference]: With dead ends: 209 [2019-09-20 13:27:28,498 INFO L226 Difference]: Without dead ends: 209 [2019-09-20 13:27:28,498 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:28,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-20 13:27:28,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 189. [2019-09-20 13:27:28,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:28,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 277 transitions. [2019-09-20 13:27:28,504 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 277 transitions. Word has length 81 [2019-09-20 13:27:28,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:28,505 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 277 transitions. [2019-09-20 13:27:28,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:28,505 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 277 transitions. [2019-09-20 13:27:28,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:27:28,506 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:28,506 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:28,506 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:28,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:28,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1293601760, now seen corresponding path program 1 times [2019-09-20 13:27:28,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:28,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:28,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:28,564 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:28,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:28,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:28,564 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:28,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:28,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:28,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:28,566 INFO L87 Difference]: Start difference. First operand 189 states and 277 transitions. Second operand 4 states. [2019-09-20 13:27:28,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:28,870 INFO L93 Difference]: Finished difference Result 208 states and 300 transitions. [2019-09-20 13:27:28,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:28,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:27:28,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:28,873 INFO L225 Difference]: With dead ends: 208 [2019-09-20 13:27:28,873 INFO L226 Difference]: Without dead ends: 208 [2019-09-20 13:27:28,873 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:28,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-20 13:27:28,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 189. [2019-09-20 13:27:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 276 transitions. [2019-09-20 13:27:28,879 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 276 transitions. Word has length 82 [2019-09-20 13:27:28,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:28,880 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 276 transitions. [2019-09-20 13:27:28,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 276 transitions. [2019-09-20 13:27:28,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:27:28,881 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:28,881 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:28,882 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:28,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:28,882 INFO L82 PathProgramCache]: Analyzing trace with hash 792950239, now seen corresponding path program 1 times [2019-09-20 13:27:28,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:28,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:28,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:28,938 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:28,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:28,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:28,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:28,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:28,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:28,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:28,940 INFO L87 Difference]: Start difference. First operand 189 states and 276 transitions. Second operand 4 states. [2019-09-20 13:27:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:29,243 INFO L93 Difference]: Finished difference Result 206 states and 297 transitions. [2019-09-20 13:27:29,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:29,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:27:29,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:29,245 INFO L225 Difference]: With dead ends: 206 [2019-09-20 13:27:29,245 INFO L226 Difference]: Without dead ends: 206 [2019-09-20 13:27:29,245 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:29,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-20 13:27:29,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2019-09-20 13:27:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 275 transitions. [2019-09-20 13:27:29,249 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 275 transitions. Word has length 82 [2019-09-20 13:27:29,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:29,250 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 275 transitions. [2019-09-20 13:27:29,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:29,250 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 275 transitions. [2019-09-20 13:27:29,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:27:29,251 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:29,251 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:29,252 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:29,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:29,252 INFO L82 PathProgramCache]: Analyzing trace with hash -655878929, now seen corresponding path program 1 times [2019-09-20 13:27:29,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:29,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:29,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:29,317 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:29,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:29,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:29,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:29,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:29,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:29,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:29,319 INFO L87 Difference]: Start difference. First operand 189 states and 275 transitions. Second operand 4 states. [2019-09-20 13:27:29,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:29,595 INFO L93 Difference]: Finished difference Result 206 states and 296 transitions. [2019-09-20 13:27:29,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:29,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-20 13:27:29,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:29,597 INFO L225 Difference]: With dead ends: 206 [2019-09-20 13:27:29,597 INFO L226 Difference]: Without dead ends: 206 [2019-09-20 13:27:29,598 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:29,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-20 13:27:29,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2019-09-20 13:27:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:29,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 274 transitions. [2019-09-20 13:27:29,604 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 274 transitions. Word has length 83 [2019-09-20 13:27:29,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:29,605 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 274 transitions. [2019-09-20 13:27:29,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:29,605 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 274 transitions. [2019-09-20 13:27:29,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-20 13:27:29,606 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:29,606 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:29,606 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:29,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:29,607 INFO L82 PathProgramCache]: Analyzing trace with hash -2028659236, now seen corresponding path program 1 times [2019-09-20 13:27:29,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:29,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:29,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:29,686 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:29,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:29,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:29,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:29,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:29,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:29,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:29,690 INFO L87 Difference]: Start difference. First operand 189 states and 274 transitions. Second operand 4 states. [2019-09-20 13:27:30,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:30,011 INFO L93 Difference]: Finished difference Result 206 states and 295 transitions. [2019-09-20 13:27:30,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:30,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-20 13:27:30,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:30,013 INFO L225 Difference]: With dead ends: 206 [2019-09-20 13:27:30,013 INFO L226 Difference]: Without dead ends: 206 [2019-09-20 13:27:30,013 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:30,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-20 13:27:30,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2019-09-20 13:27:30,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:30,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 273 transitions. [2019-09-20 13:27:30,019 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 273 transitions. Word has length 84 [2019-09-20 13:27:30,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:30,020 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 273 transitions. [2019-09-20 13:27:30,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:30,020 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 273 transitions. [2019-09-20 13:27:30,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-20 13:27:30,021 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:30,021 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:30,022 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:30,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:30,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1457090858, now seen corresponding path program 1 times [2019-09-20 13:27:30,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:30,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:30,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:30,078 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:30,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:30,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:30,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:30,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:30,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:30,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:30,080 INFO L87 Difference]: Start difference. First operand 189 states and 273 transitions. Second operand 4 states. [2019-09-20 13:27:30,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:30,353 INFO L93 Difference]: Finished difference Result 206 states and 294 transitions. [2019-09-20 13:27:30,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:30,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-20 13:27:30,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:30,355 INFO L225 Difference]: With dead ends: 206 [2019-09-20 13:27:30,355 INFO L226 Difference]: Without dead ends: 206 [2019-09-20 13:27:30,356 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:30,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-20 13:27:30,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2019-09-20 13:27:30,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:30,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 272 transitions. [2019-09-20 13:27:30,362 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 272 transitions. Word has length 85 [2019-09-20 13:27:30,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:30,363 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 272 transitions. [2019-09-20 13:27:30,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:30,363 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 272 transitions. [2019-09-20 13:27:30,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-20 13:27:30,364 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:30,364 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:30,364 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:30,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:30,365 INFO L82 PathProgramCache]: Analyzing trace with hash 938460727, now seen corresponding path program 1 times [2019-09-20 13:27:30,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:30,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:30,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:30,440 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:30,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:30,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:30,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:30,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:30,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:30,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:30,442 INFO L87 Difference]: Start difference. First operand 189 states and 272 transitions. Second operand 4 states. [2019-09-20 13:27:30,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:30,769 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2019-09-20 13:27:30,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:30,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-20 13:27:30,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:30,772 INFO L225 Difference]: With dead ends: 196 [2019-09-20 13:27:30,773 INFO L226 Difference]: Without dead ends: 196 [2019-09-20 13:27:30,773 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:30,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-20 13:27:30,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 189. [2019-09-20 13:27:30,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 13:27:30,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 271 transitions. [2019-09-20 13:27:30,782 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 271 transitions. Word has length 86 [2019-09-20 13:27:30,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:30,782 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 271 transitions. [2019-09-20 13:27:30,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:30,783 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 271 transitions. [2019-09-20 13:27:30,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-20 13:27:30,785 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:30,785 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:30,785 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:30,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:30,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1045397903, now seen corresponding path program 1 times [2019-09-20 13:27:30,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:30,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:30,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:30,921 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:30,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:30,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:30,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:30,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:30,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:30,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:30,926 INFO L87 Difference]: Start difference. First operand 189 states and 271 transitions. Second operand 4 states. [2019-09-20 13:27:31,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:31,389 INFO L93 Difference]: Finished difference Result 283 states and 414 transitions. [2019-09-20 13:27:31,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:31,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-20 13:27:31,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:31,392 INFO L225 Difference]: With dead ends: 283 [2019-09-20 13:27:31,392 INFO L226 Difference]: Without dead ends: 283 [2019-09-20 13:27:31,392 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,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-20 13:27:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 232. [2019-09-20 13:27:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-20 13:27:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 348 transitions. [2019-09-20 13:27:31,399 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 348 transitions. Word has length 90 [2019-09-20 13:27:31,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:31,399 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 348 transitions. [2019-09-20 13:27:31,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 348 transitions. [2019-09-20 13:27:31,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-20 13:27:31,401 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:31,401 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:31,401 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:31,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:31,402 INFO L82 PathProgramCache]: Analyzing trace with hash 148004625, now seen corresponding path program 1 times [2019-09-20 13:27:31,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:31,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:31,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:31,474 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:31,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:31,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:31,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:31,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:31,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:31,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:31,476 INFO L87 Difference]: Start difference. First operand 232 states and 348 transitions. Second operand 4 states. [2019-09-20 13:27:31,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:31,921 INFO L93 Difference]: Finished difference Result 280 states and 419 transitions. [2019-09-20 13:27:31,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:31,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-20 13:27:31,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:31,924 INFO L225 Difference]: With dead ends: 280 [2019-09-20 13:27:31,924 INFO L226 Difference]: Without dead ends: 280 [2019-09-20 13:27:31,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:31,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-20 13:27:31,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2019-09-20 13:27:31,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:31,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 389 transitions. [2019-09-20 13:27:31,934 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 389 transitions. Word has length 90 [2019-09-20 13:27:31,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:31,935 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 389 transitions. [2019-09-20 13:27:31,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:31,935 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 389 transitions. [2019-09-20 13:27:31,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:27:31,937 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:31,937 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:31,938 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:31,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:31,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1192087943, now seen corresponding path program 1 times [2019-09-20 13:27:31,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:31,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:31,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:32,009 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:32,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:32,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:32,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:32,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:32,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:32,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:32,011 INFO L87 Difference]: Start difference. First operand 256 states and 389 transitions. Second operand 4 states. [2019-09-20 13:27:32,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:32,431 INFO L93 Difference]: Finished difference Result 307 states and 454 transitions. [2019-09-20 13:27:32,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:32,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:27:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:32,434 INFO L225 Difference]: With dead ends: 307 [2019-09-20 13:27:32,434 INFO L226 Difference]: Without dead ends: 307 [2019-09-20 13:27:32,435 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,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-20 13:27:32,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 256. [2019-09-20 13:27:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 388 transitions. [2019-09-20 13:27:32,443 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 388 transitions. Word has length 103 [2019-09-20 13:27:32,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:32,443 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 388 transitions. [2019-09-20 13:27:32,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:32,443 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 388 transitions. [2019-09-20 13:27:32,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:27:32,445 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:32,445 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:32,445 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:32,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:32,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1151413193, now seen corresponding path program 1 times [2019-09-20 13:27:32,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:32,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:32,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:32,519 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:32,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:32,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:32,520 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:32,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:32,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:32,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:32,521 INFO L87 Difference]: Start difference. First operand 256 states and 388 transitions. Second operand 4 states. [2019-09-20 13:27:32,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:32,848 INFO L93 Difference]: Finished difference Result 280 states and 417 transitions. [2019-09-20 13:27:32,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:32,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:27:32,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:32,852 INFO L225 Difference]: With dead ends: 280 [2019-09-20 13:27:32,852 INFO L226 Difference]: Without dead ends: 280 [2019-09-20 13:27:32,852 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,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-20 13:27:32,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2019-09-20 13:27:32,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:32,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 387 transitions. [2019-09-20 13:27:32,859 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 387 transitions. Word has length 103 [2019-09-20 13:27:32,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:32,860 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 387 transitions. [2019-09-20 13:27:32,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:32,860 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 387 transitions. [2019-09-20 13:27:32,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:32,861 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:32,862 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:32,862 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:32,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:32,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1260632775, now seen corresponding path program 1 times [2019-09-20 13:27:32,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:32,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:32,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:32,936 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:32,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:32,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:32,937 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:32,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:32,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:32,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:32,938 INFO L87 Difference]: Start difference. First operand 256 states and 387 transitions. Second operand 4 states. [2019-09-20 13:27:33,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:33,342 INFO L93 Difference]: Finished difference Result 306 states and 451 transitions. [2019-09-20 13:27:33,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:33,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:33,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:33,345 INFO L225 Difference]: With dead ends: 306 [2019-09-20 13:27:33,345 INFO L226 Difference]: Without dead ends: 306 [2019-09-20 13:27:33,346 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,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-20 13:27:33,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 256. [2019-09-20 13:27:33,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:33,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 386 transitions. [2019-09-20 13:27:33,353 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 386 transitions. Word has length 104 [2019-09-20 13:27:33,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:33,354 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 386 transitions. [2019-09-20 13:27:33,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:33,354 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 386 transitions. [2019-09-20 13:27:33,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:33,355 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:33,355 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:33,356 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:33,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:33,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1761284296, now seen corresponding path program 1 times [2019-09-20 13:27:33,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:33,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:33,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:33,458 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:33,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:33,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:33,459 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:33,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:33,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:33,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:33,460 INFO L87 Difference]: Start difference. First operand 256 states and 386 transitions. Second operand 4 states. [2019-09-20 13:27:33,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:33,846 INFO L93 Difference]: Finished difference Result 304 states and 448 transitions. [2019-09-20 13:27:33,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:33,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:33,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:33,850 INFO L225 Difference]: With dead ends: 304 [2019-09-20 13:27:33,850 INFO L226 Difference]: Without dead ends: 304 [2019-09-20 13:27:33,850 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,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-20 13:27:33,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 256. [2019-09-20 13:27:33,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:33,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 385 transitions. [2019-09-20 13:27:33,857 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 385 transitions. Word has length 104 [2019-09-20 13:27:33,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:33,857 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 385 transitions. [2019-09-20 13:27:33,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:33,857 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 385 transitions. [2019-09-20 13:27:33,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:33,859 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:33,859 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:33,859 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:33,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:33,859 INFO L82 PathProgramCache]: Analyzing trace with hash 284475, now seen corresponding path program 1 times [2019-09-20 13:27:33,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:33,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:33,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:33,934 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:33,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:33,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:33,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:33,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:33,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:33,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:33,936 INFO L87 Difference]: Start difference. First operand 256 states and 385 transitions. Second operand 4 states. [2019-09-20 13:27:34,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:34,255 INFO L93 Difference]: Finished difference Result 279 states and 413 transitions. [2019-09-20 13:27:34,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:34,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:34,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:34,257 INFO L225 Difference]: With dead ends: 279 [2019-09-20 13:27:34,257 INFO L226 Difference]: Without dead ends: 279 [2019-09-20 13:27:34,257 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,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-09-20 13:27:34,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 256. [2019-09-20 13:27:34,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:34,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 384 transitions. [2019-09-20 13:27:34,263 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 384 transitions. Word has length 104 [2019-09-20 13:27:34,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:34,263 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 384 transitions. [2019-09-20 13:27:34,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:34,263 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 384 transitions. [2019-09-20 13:27:34,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:34,265 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:34,265 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:34,265 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:34,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:34,266 INFO L82 PathProgramCache]: Analyzing trace with hash -500367046, now seen corresponding path program 1 times [2019-09-20 13:27:34,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:34,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:34,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:34,354 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:34,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:34,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:34,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:34,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:34,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:34,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:34,356 INFO L87 Difference]: Start difference. First operand 256 states and 384 transitions. Second operand 4 states. [2019-09-20 13:27:34,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:34,726 INFO L93 Difference]: Finished difference Result 277 states and 410 transitions. [2019-09-20 13:27:34,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:34,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:34,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:34,728 INFO L225 Difference]: With dead ends: 277 [2019-09-20 13:27:34,729 INFO L226 Difference]: Without dead ends: 277 [2019-09-20 13:27:34,729 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,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-20 13:27:34,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 256. [2019-09-20 13:27:34,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 383 transitions. [2019-09-20 13:27:34,736 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 383 transitions. Word has length 104 [2019-09-20 13:27:34,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:34,736 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 383 transitions. [2019-09-20 13:27:34,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:34,736 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 383 transitions. [2019-09-20 13:27:34,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:27:34,738 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:34,738 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:34,738 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:34,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:34,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1767229110, now seen corresponding path program 1 times [2019-09-20 13:27:34,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:34,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:34,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:34,821 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:34,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:34,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:34,822 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:34,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:34,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:34,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:34,823 INFO L87 Difference]: Start difference. First operand 256 states and 383 transitions. Second operand 4 states. [2019-09-20 13:27:35,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:35,237 INFO L93 Difference]: Finished difference Result 304 states and 445 transitions. [2019-09-20 13:27:35,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:35,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:27:35,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:35,240 INFO L225 Difference]: With dead ends: 304 [2019-09-20 13:27:35,240 INFO L226 Difference]: Without dead ends: 304 [2019-09-20 13:27:35,241 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:35,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-20 13:27:35,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 256. [2019-09-20 13:27:35,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:35,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 382 transitions. [2019-09-20 13:27:35,247 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 382 transitions. Word has length 105 [2019-09-20 13:27:35,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:35,247 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 382 transitions. [2019-09-20 13:27:35,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:35,248 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 382 transitions. [2019-09-20 13:27:35,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:27:35,249 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:35,249 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:35,249 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:35,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:35,250 INFO L82 PathProgramCache]: Analyzing trace with hash -2094009100, now seen corresponding path program 1 times [2019-09-20 13:27:35,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:35,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:35,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:35,310 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:35,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:35,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:35,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:35,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:35,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:35,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:35,312 INFO L87 Difference]: Start difference. First operand 256 states and 382 transitions. Second operand 4 states. [2019-09-20 13:27:35,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:35,664 INFO L93 Difference]: Finished difference Result 277 states and 408 transitions. [2019-09-20 13:27:35,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:35,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:27:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:35,666 INFO L225 Difference]: With dead ends: 277 [2019-09-20 13:27:35,666 INFO L226 Difference]: Without dead ends: 277 [2019-09-20 13:27:35,667 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:35,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-20 13:27:35,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 256. [2019-09-20 13:27:35,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:35,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 381 transitions. [2019-09-20 13:27:35,673 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 381 transitions. Word has length 105 [2019-09-20 13:27:35,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:35,673 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 381 transitions. [2019-09-20 13:27:35,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:35,673 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 381 transitions. [2019-09-20 13:27:35,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:27:35,675 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:35,675 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:35,675 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:35,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:35,675 INFO L82 PathProgramCache]: Analyzing trace with hash 73245941, now seen corresponding path program 1 times [2019-09-20 13:27:35,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:35,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:35,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:35,752 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:35,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:35,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:35,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:35,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:35,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:35,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:35,755 INFO L87 Difference]: Start difference. First operand 256 states and 381 transitions. Second operand 4 states. [2019-09-20 13:27:36,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:36,162 INFO L93 Difference]: Finished difference Result 304 states and 443 transitions. [2019-09-20 13:27:36,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:36,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:27:36,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:36,165 INFO L225 Difference]: With dead ends: 304 [2019-09-20 13:27:36,165 INFO L226 Difference]: Without dead ends: 304 [2019-09-20 13:27:36,166 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:36,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-20 13:27:36,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 256. [2019-09-20 13:27:36,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 380 transitions. [2019-09-20 13:27:36,172 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 380 transitions. Word has length 106 [2019-09-20 13:27:36,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:36,173 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 380 transitions. [2019-09-20 13:27:36,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:36,173 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 380 transitions. [2019-09-20 13:27:36,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:27:36,174 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:36,174 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:36,175 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:36,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:36,175 INFO L82 PathProgramCache]: Analyzing trace with hash 633945719, now seen corresponding path program 1 times [2019-09-20 13:27:36,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:36,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:36,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:36,254 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:36,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:36,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:36,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:36,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:36,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:36,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:36,256 INFO L87 Difference]: Start difference. First operand 256 states and 380 transitions. Second operand 4 states. [2019-09-20 13:27:36,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:36,546 INFO L93 Difference]: Finished difference Result 277 states and 406 transitions. [2019-09-20 13:27:36,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:36,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:27:36,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:36,549 INFO L225 Difference]: With dead ends: 277 [2019-09-20 13:27:36,549 INFO L226 Difference]: Without dead ends: 277 [2019-09-20 13:27:36,549 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:36,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-20 13:27:36,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 256. [2019-09-20 13:27:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:36,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 379 transitions. [2019-09-20 13:27:36,556 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 379 transitions. Word has length 106 [2019-09-20 13:27:36,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:36,556 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 379 transitions. [2019-09-20 13:27:36,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:36,557 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 379 transitions. [2019-09-20 13:27:36,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-20 13:27:36,558 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:36,558 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:36,558 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:36,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:36,559 INFO L82 PathProgramCache]: Analyzing trace with hash -2103325391, now seen corresponding path program 1 times [2019-09-20 13:27:36,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:36,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:36,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:36,622 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:36,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:36,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:36,623 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:36,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:36,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:36,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:36,624 INFO L87 Difference]: Start difference. First operand 256 states and 379 transitions. Second operand 4 states. [2019-09-20 13:27:37,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:37,022 INFO L93 Difference]: Finished difference Result 304 states and 441 transitions. [2019-09-20 13:27:37,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:37,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-20 13:27:37,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:37,025 INFO L225 Difference]: With dead ends: 304 [2019-09-20 13:27:37,025 INFO L226 Difference]: Without dead ends: 304 [2019-09-20 13:27:37,026 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:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-20 13:27:37,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 256. [2019-09-20 13:27:37,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 378 transitions. [2019-09-20 13:27:37,032 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 378 transitions. Word has length 107 [2019-09-20 13:27:37,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:37,032 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 378 transitions. [2019-09-20 13:27:37,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 378 transitions. [2019-09-20 13:27:37,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-20 13:27:37,034 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:37,034 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:37,034 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:37,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:37,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1901501457, now seen corresponding path program 1 times [2019-09-20 13:27:37,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:37,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:37,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:37,096 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:37,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:37,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:37,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:37,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:37,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:37,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:37,098 INFO L87 Difference]: Start difference. First operand 256 states and 378 transitions. Second operand 4 states. [2019-09-20 13:27:37,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:37,398 INFO L93 Difference]: Finished difference Result 277 states and 404 transitions. [2019-09-20 13:27:37,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:37,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-20 13:27:37,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:37,401 INFO L225 Difference]: With dead ends: 277 [2019-09-20 13:27:37,401 INFO L226 Difference]: Without dead ends: 277 [2019-09-20 13:27:37,401 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:37,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-20 13:27:37,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 256. [2019-09-20 13:27:37,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:37,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 377 transitions. [2019-09-20 13:27:37,407 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 377 transitions. Word has length 107 [2019-09-20 13:27:37,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:37,407 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 377 transitions. [2019-09-20 13:27:37,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:37,408 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 377 transitions. [2019-09-20 13:27:37,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:27:37,409 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:37,409 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:37,409 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:37,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:37,409 INFO L82 PathProgramCache]: Analyzing trace with hash -2060260592, now seen corresponding path program 1 times [2019-09-20 13:27:37,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:37,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:37,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:37,484 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:37,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:37,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:37,509 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:37,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:37,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:37,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:37,512 INFO L87 Difference]: Start difference. First operand 256 states and 377 transitions. Second operand 4 states. [2019-09-20 13:27:37,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:37,892 INFO L93 Difference]: Finished difference Result 294 states and 427 transitions. [2019-09-20 13:27:37,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:37,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-20 13:27:37,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:37,895 INFO L225 Difference]: With dead ends: 294 [2019-09-20 13:27:37,895 INFO L226 Difference]: Without dead ends: 294 [2019-09-20 13:27:37,896 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:37,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-20 13:27:37,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 256. [2019-09-20 13:27:37,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:37,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 376 transitions. [2019-09-20 13:27:37,902 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 376 transitions. Word has length 108 [2019-09-20 13:27:37,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:37,903 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 376 transitions. [2019-09-20 13:27:37,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:37,903 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 376 transitions. [2019-09-20 13:27:37,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:27:37,904 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:37,904 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:37,904 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:37,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:37,905 INFO L82 PathProgramCache]: Analyzing trace with hash -98685934, now seen corresponding path program 1 times [2019-09-20 13:27:37,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:37,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:37,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:37,972 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:37,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:37,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:37,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:37,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:37,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:37,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:37,974 INFO L87 Difference]: Start difference. First operand 256 states and 376 transitions. Second operand 4 states. [2019-09-20 13:27:38,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:38,242 INFO L93 Difference]: Finished difference Result 267 states and 390 transitions. [2019-09-20 13:27:38,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:38,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-20 13:27:38,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:38,245 INFO L225 Difference]: With dead ends: 267 [2019-09-20 13:27:38,245 INFO L226 Difference]: Without dead ends: 267 [2019-09-20 13:27:38,246 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:38,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-20 13:27:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 256. [2019-09-20 13:27:38,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 375 transitions. [2019-09-20 13:27:38,251 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 375 transitions. Word has length 108 [2019-09-20 13:27:38,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:38,252 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 375 transitions. [2019-09-20 13:27:38,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:38,252 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 375 transitions. [2019-09-20 13:27:38,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-20 13:27:38,253 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:38,254 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:38,254 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:38,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:38,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1406965636, now seen corresponding path program 1 times [2019-09-20 13:27:38,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:38,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:38,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:38,331 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:38,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:38,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:38,331 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:38,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:38,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:38,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:38,332 INFO L87 Difference]: Start difference. First operand 256 states and 375 transitions. Second operand 4 states. [2019-09-20 13:27:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:38,697 INFO L93 Difference]: Finished difference Result 294 states and 425 transitions. [2019-09-20 13:27:38,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:38,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-20 13:27:38,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:38,701 INFO L225 Difference]: With dead ends: 294 [2019-09-20 13:27:38,701 INFO L226 Difference]: Without dead ends: 294 [2019-09-20 13:27:38,701 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:38,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-20 13:27:38,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 256. [2019-09-20 13:27:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:27:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 374 transitions. [2019-09-20 13:27:38,707 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 374 transitions. Word has length 112 [2019-09-20 13:27:38,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:38,707 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 374 transitions. [2019-09-20 13:27:38,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:38,707 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 374 transitions. [2019-09-20 13:27:38,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-20 13:27:38,708 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:38,708 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:38,709 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:38,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:38,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1201821822, now seen corresponding path program 1 times [2019-09-20 13:27:38,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:38,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:38,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:38,780 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:38,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:38,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:38,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:38,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:38,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:38,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:38,782 INFO L87 Difference]: Start difference. First operand 256 states and 374 transitions. Second operand 3 states. [2019-09-20 13:27:38,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:38,806 INFO L93 Difference]: Finished difference Result 485 states and 717 transitions. [2019-09-20 13:27:38,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:38,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-20 13:27:38,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:38,809 INFO L225 Difference]: With dead ends: 485 [2019-09-20 13:27:38,809 INFO L226 Difference]: Without dead ends: 485 [2019-09-20 13:27:38,809 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:38,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-09-20 13:27:38,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2019-09-20 13:27:38,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-09-20 13:27:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 717 transitions. [2019-09-20 13:27:38,818 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 717 transitions. Word has length 112 [2019-09-20 13:27:38,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:38,819 INFO L475 AbstractCegarLoop]: Abstraction has 485 states and 717 transitions. [2019-09-20 13:27:38,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:38,819 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 717 transitions. [2019-09-20 13:27:38,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-20 13:27:38,820 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:38,821 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:38,821 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:38,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:38,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1456172119, now seen corresponding path program 1 times [2019-09-20 13:27:38,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:38,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:38,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-20 13:27:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-20 13:27:39,119 INFO L474 BasicCegarLoop]: Counterexample might be feasible [2019-09-20 13:27:39,200 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967309 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:39,202 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:39,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:27:39 BoogieIcfgContainer [2019-09-20 13:27:39,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:27:39,308 INFO L168 Benchmark]: Toolchain (without parser) took 19658.36 ms. Allocated memory was 138.9 MB in the beginning and 490.7 MB in the end (delta: 351.8 MB). Free memory was 84.1 MB in the beginning and 154.2 MB in the end (delta: -70.1 MB). Peak memory consumption was 281.7 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:39,309 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.9 MB. Free memory was 104.9 MB in the beginning and 104.6 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:39,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1059.50 ms. Allocated memory was 138.9 MB in the beginning and 199.8 MB in the end (delta: 60.8 MB). Free memory was 83.9 MB in the beginning and 156.7 MB in the end (delta: -72.9 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:39,311 INFO L168 Benchmark]: Boogie Preprocessor took 135.83 ms. Allocated memory is still 199.8 MB. Free memory was 156.7 MB in the beginning and 148.3 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:39,311 INFO L168 Benchmark]: RCFGBuilder took 1332.42 ms. Allocated memory was 199.8 MB in the beginning and 222.8 MB in the end (delta: 23.1 MB). Free memory was 148.3 MB in the beginning and 167.2 MB in the end (delta: -18.9 MB). Peak memory consumption was 83.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:39,312 INFO L168 Benchmark]: TraceAbstraction took 17124.97 ms. Allocated memory was 222.8 MB in the beginning and 490.7 MB in the end (delta: 267.9 MB). Free memory was 167.2 MB in the beginning and 154.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 280.9 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:39,318 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.17 ms. Allocated memory is still 138.9 MB. Free memory was 104.9 MB in the beginning and 104.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1059.50 ms. Allocated memory was 138.9 MB in the beginning and 199.8 MB in the end (delta: 60.8 MB). Free memory was 83.9 MB in the beginning and 156.7 MB in the end (delta: -72.9 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.83 ms. Allocated memory is still 199.8 MB. Free memory was 156.7 MB in the beginning and 148.3 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1332.42 ms. Allocated memory was 199.8 MB in the beginning and 222.8 MB in the end (delta: 23.1 MB). Free memory was 148.3 MB in the beginning and 167.2 MB in the end (delta: -18.9 MB). Peak memory consumption was 83.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17124.97 ms. Allocated memory was 222.8 MB in the beginning and 490.7 MB in the end (delta: 267.9 MB). Free memory was 167.2 MB in the beginning and 154.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 280.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967309 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 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)# * 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=4294967300, 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] [L1347] COND FALSE !(ret <= 0) [L1352] 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] [L1352] COND TRUE s->hit [L1353] 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] [L1357] 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=4294967300, 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 [L1550] EXPR s->session [L1550] EXPR s->s3 [L1550] EXPR (s->s3)->tmp.new_cipher [L1550] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1551] COND FALSE !(! tmp___9) [L1557] ret = __VERIFIER_nondet_int() [L1558] COND TRUE blastFlag == 2 [L1559] blastFlag = 4 VAL [={0:0}, blastFlag=4, 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=4, 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=4, 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=4294967300, blastFlag=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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=4, 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 == 4 VAL [={0:0}, blastFlag=4, got_new_session=1, init=1, ret=0, 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=4, got_new_session=1, init=1, ret=0, 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, 17.0s OverallTime, 37 OverallIterations, 4 TraceHistogramMax, 12.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6980 SDtfs, 1928 SDslu, 10039 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.8s 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.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 841 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.8s 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...